Routing of barge container ships by mixed-integer programming heuristics

Abstract We investigate the optimization of transport routes of barge container ships with the objective to maximize the profit of a shipping company. This problem consists of determining the upstream and downstream calling sequence and the number of loaded and empty containers transported between any two ports. We present a mixed integer linear programming (MILP) formulation for this problem. The problem is tackled by the commercial CPLEX MIP solver and improved variants of the existing MIP heuristics: Local Branching, Variable Neighborhood Branching and Variable Neighborhood Decomposition Search. It appears that our implementation of Variable Neighborhood Branching outperforms CPLEX MIP solver both regarding the solution quality and the computational time. All other studied heuristics provide results competitive with CPLEX MIP solver within a significantly shorter amount of time. Moreover, we present a detailed case study transportation analysis which illustrates how the proposed approach can be used by managers of barge shipping companies to make appropriate decisions and solve real life problems.

[1]  K. Lai,et al.  Shipping Container Logistics and Allocation , 1995 .

[2]  Loo Hay Lee,et al.  An approximate dynamic programming approach for the empty container allocation problem , 2007 .

[3]  Pierre Hansen,et al.  Variable Neighborhood Search , 2018, Handbook of Heuristics.

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

[5]  Gerrit K. Janssens,et al.  MODELLING CORRIDOR NETWORKS IN INTERMODAL BARGE TRANSPORT , 2010 .

[6]  Yanbin Liu,et al.  A decision support system using soft computing for modern international container transportation services , 2010, Appl. Soft Comput..

[7]  Ke Liu,et al.  Allocation of empty containers between multi-ports , 2007, Eur. J. Oper. Res..

[8]  C. M. Khoong,et al.  A DSS for empty container distribution planning , 1995, Decis. Support Syst..

[9]  Rob Konings,et al.  Network Design for Intermodal Barge Transport , 2003 .

[10]  Teodor Gabriel Crainic,et al.  Survey Paper - A Review of Empty Flows and Fleet Management Models in Freight Transportation , 1987, Transp. Sci..

[11]  Pierre Hansen,et al.  Variable Neighborhood Decomposition Search , 1998, J. Heuristics.

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

[13]  Krishan Rana,et al.  A Model and Solution Algorithm for Optimal Routing of a Time-Chartered Containership , 1988, Transp. Sci..

[14]  D. Song,et al.  Empty Container Management in Cyclic Shipping Routes , 2008 .

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

[16]  Matteo Fischetti,et al.  Local branching , 2003, Math. Program..

[17]  Andrew Lim,et al.  A network flow based method for the distribution of empty containers , 2005 .

[18]  Nenad Mladenovic,et al.  Variable neighbourhood decomposition search for 0-1 mixed integer programs , 2009, Comput. Oper. Res..

[19]  Matteo Fischetti,et al.  A local branching heuristic for mixed‐integer programs with 2‐level variables, with an application to a telecommunication network design problem , 2004, Networks.

[20]  Dong-Ping Song,et al.  Empty Container Repositioning , 2015 .

[21]  Rob Konings.  Hub-and-spoke networks in container-on-barge transport , 2006 .

[22]  Shangyao Yan,et al.  Ship scheduling and container shipment planning for liners in short-term operations , 2009 .

[23]  Vladislav Maraš,et al.  Power unit-cargo space link in transport , 2005 .

[24]  Gerrit K. Janssens,et al.  Determining optimal shipping routes for barge transport with empty container repositioning , 2010 .

[25]  Pierre Hansen,et al.  Variable neighbourhood search: methods and applications , 2010, Ann. Oper. Res..

[26]  Stefan Nickel,et al.  Liner Shipping Hub Network Design in a Competitive Environment , 2010 .

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

[28]  Chuen-Yih Chen,et al.  A Two-Stage Stochastic Network Model and Solution Methods for the Dynamic Empty Container Allocation Problem , 1998, Transp. Sci..

[29]  Maria Boile,et al.  Collaborative vs. non-collaborative container-vessel scheduling , 2008 .

[30]  Ming-Cheng Tsou,et al.  Application of a mixed fuzzy decision making and optimization programming model to the empty container allocation , 2010, Appl. Soft Comput..

[31]  Brian W. Kernighan,et al.  AMPL: A Modeling Language for Mathematical Programming , 1993 .

[32]  Michel Gendreau,et al.  Dynamic and Stochastic Models for the Allocation of Empty Containers , 1993, Oper. Res..

[33]  J. Konings,et al.  Intermodal Barge Transport: Network Design, Nodes and Competitiveness , 2009 .

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

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

[36]  Pierre Hansen,et al.  Variable Neighbourhood Search , 2003 .

[37]  Theo Notteboom,et al.  Container river services and gateway ports: Similarities between the Yangtze River and the Rhine River , 2007 .

[38]  P. Hansen,et al.  Variable neighbourhood search: methods and applications , 2010, Ann. Oper. Res..

[39]  Vladislav Maraš.  Determining Optimal Transport Routes of Inland Waterway Container Ships , 2008 .

[40]  Rob Konings,et al.  Terminals and the Competitiveness of Container Barge Transport , 2008 .

[41]  Kin Keung Lai,et al.  Empty container management in a port with long-run average criterion , 2004, Math. Comput. Model..

[42]  Matteo Fischetti,et al.  A feasibility pump heuristic for general mixed-integer problems , 2007, Discret. Optim..