Designing optimal routes in a liner shipping problem

Abstract

A real liner shipping problem of deciding optimal weekly routes for a given fleet of ships is considered and a solution method for solving the problem is proposed. First, all feasible routes for each ship are generated together with the cost and the duration for each route. The routes are given as input to an integer programming (IP) problem. By solving the IP problem, routes for each ship are selected such that total transportation costs are minimized and the demand at each port is satisfied. The total duration for the routes that are selected for a given ship must not exceed one week.

The real liner shipping problem is solved together with four randomly generated test problems. The computational results show that proposed solution method is suitable for designing optimal routes in several liner shipping problems.

Notes

e-mail: [email protected]

Additional information

Notes on contributors

Kjetil Fagerholt *

e-mail: [email protected]