The network design problem in liner shipping is of increasing importance in a strongly competitive market
where potential cost reductions can influence market share and profits significantly. In this paper the network design and fleet assignment problems are combined into a mixed integer linear programming model minimizing the overall cost. To better reflect the real-life situation we take into account the cost of transhipment, a heterogeneous fleet, route dependant capacities, and butterfly routes. To the best of our knowledge it is the first time an exact solution method to the problem considers transhipment cost. The problem is solved with branch-and-cut using clover and transhipment inequalities. Computational results are reported for instances with up to 15 ports.
|Place of Publication||Kgs. Lyngby|
|Number of pages||18|
|Publication status||Published - 2010|
|Series||DTU Management 2010|