A branch and cut algorithm for the container shipping network design problem

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 dependent 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.

[1]  José Fernando Álvarez,et al.  Joint Routing and Deployment of a Fleet of Container Vessels , 2009 .

[2]  Journal of the Association for Computing Machinery , 1961, Nature.

[3]  Qiang Meng,et al.  A novel modeling approach for the fleet deployment problem within a short-term planning horizon , 2010 .

[4]  Kjetil Fagerholt,et al.  Optimal fleet design in a ship routing problem , 1999 .

[5]  Qiang Meng,et al.  Liner shipping service network design with empty container repositioning , 2011 .

[6]  D Ronen,et al.  CARGO SHIPS ROUTING AND SCHEDULING: SURVEY OF MODELS AND PROBLEMS. IN: MARITIME TRANSPORT , 1983 .

[7]  Natashia Boland,et al.  Path inequalities for the vehicle routing problem with time windows , 2007, Networks.

[8]  T. Notteboom,et al.  Containerisation, Box Logistics and Global Supply Chains: The Integration of Ports and Liner Shipping Networks , 2008 .

[9]  R. A. Zemlin,et al.  Integer Programming Formulation of Traveling Salesman Problems , 1960, JACM.

[10]  Michael Jünger,et al.  A Branch & Cut Algorithm for the Asymmetric Traveling Salesman Problem with Precedence Constraints , 2000, Comput. Optim. Appl..

[11]  Marielle Christiansen,et al.  A method for solving ship routing problemswith inventory constraints , 1998, Ann. Oper. Res..

[12]  Kjetil Fagerholt,et al.  Ship Routing and Scheduling: Status and Perspectives , 2004, Transp. Sci..

[13]  Matteo Fischetti,et al.  A Branch-and-Cut Algorithm for the Symmetric Generalized Traveling Salesman Problem , 1997, Oper. Res..

[14]  Krishan Rana,et al.  Routing Container Ships Using Lagrangean Relaxation and Decomposition , 1991, Transp. Sci..

[15]  Özlem Ergun,et al.  Ship Scheduling and Network Design for Cargo Routing in Liner Shipping , 2008, Transp. Sci..

[16]  Dong-Ping Song,et al.  Container fleet sizing and empty repositioning in liner shipping systems , 2009 .

[17]  Gang Yu,et al.  A Branch-and-Cut Procedure for the Vehicle Routing Problem with Time Windows , 2002, Transp. Sci..

[18]  T. Notteboom.  The Time Factor in Liner Shipping Services , 2006 .

[19]  Michel Gendreau,et al.  A branch-and-cut algorithm for the undirected selective traveling salesman problem , 1998, Networks.

[20]  H. P. Williams,et al.  Model Building in Mathematical Programming , 1979 .

[21]  David Ronen,et al.  Ship scheduling: The last decade , 1993 .

[22]  Theo N O T Teboom,et al.  Containerisation, Box Logistics and Global Supply Chains: The Integration of Ports and Liner Shipping Networks , 2008 .

[23]  Akio Imai,et al.  The container shipping network design problem with empty container repositioning , 2007 .

[24]  N. Boland,et al.  Path inequalities for the vehicle routing problem with time windows , 2007 .

[25]  David Pisinger,et al.  A Base Integer Programming Model and Benchmark Suite for Liner-Shipping Network Design , 2014, Transp. Sci..