Solving the Liner Shipping Fleet Repositioning Problem with Cargo Flows

We solve a central problem in the liner shipping industry called the liner shipping fleet repositioning problem LSFRP. The LSFRP poses a large financial burden on liner shipping firms. During repositioning, vessels are moved between routes in a liner shipping network. Liner carriers wish to reposition vessels as cheaply as possible without disrupting cargo flows. The LSFRP is characterized by chains of interacting activities with a multicommodity flow over paths defined by the activities chosen. Despite its industrial importance, the LSFRP has received little attention in the literature. We introduce a novel mathematical model and a simulated annealing algorithm for the LSFRP with cargo flows that makes use of a carefully constructed graph; we evaluate these approaches using real-world data from our industrial collaborator. Additionally, we compare the performance of our approach against an actual repositioning scenario, one of many undertaken by our industrial collaborator in 2011. Our simulated annealing algorithm is able to increase the profit from $18.1 to $31.8 million using only a few minutes of CPU time. This shows that our algorithm could be used in a decision support system to solve the LSFRP.

[1]  Stefan Voß,et al.  Slow Steaming in Container Shipping , 2012, 2012 45th Hawaii International Conference on System Sciences.

[2]  Philip Kilby,et al.  CP Methods for Scheduling and Routing with Time-Dependent Task Costs , 2013, CPAIOR.

[3]  Kjetil Fagerholt,et al.  Ship routing and scheduling in the new millennium , 2013, Eur. J. Oper. Res..

[4]  B. J. Powell,et al.  Fleet deployment optimization for liner shipping: an integer programming model , 1997 .

[5]  C. D. Gelatt,et al.  Optimization by Simulated Annealing , 1983, Science.

[6]  H. Kuhn.  The Hungarian method for the assignment problem , 1955 .

[7]  Allan Larsen,et al.  Disruption management in the airline industry - Concepts, models and methods , 2010, Comput. Oper. Res..

[8]  Thomas Stützle,et al.  Stochastic Local Search , 2007, Handbook of Approximation Algorithms and Metaheuristics.

[9]  Albert Y. Zomaya,et al.  A simulated annealing approach for mobile location management , 2005, 19th IEEE International Parallel and Distributed Processing Symposium.

[10]  Kjetil Fagerholt,et al.  Chapter 4 Maritime Transportation , 2007, Transportation.

[11]  Qiang Meng,et al.  Sailing speed optimization for container ships in a liner shipping network , 2012 .

[12]  Rune Møller Jensen,et al.  The Liner Shipping Fleet Repositioning Problem with Cargo Flows , 2012, ICCL.

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

[14]  B. Tabachnick,et al.  Using Multivariate Statistics , 1983 .

[15]  Stefan Voß,et al.  Container terminal operation and operations research — a classification and literature review , 2004 .

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

[17]  David Pisinger,et al.  The Vessel Schedule Recovery Problem (VSRP) - A MIP model for handling disruptions in liner shipping , 2013, Eur. J. Oper. Res..

[18]  Thomas Stützle,et al.  Stochastic Local Search: Foundations & Applications , 2004 .

[19]  Stefan Voß,et al.  Operations research at container terminals: a literature update , 2007, OR Spectr..

[20]  Marielle Christiansen,et al.  Decomposition of a Combined Inventory and Time Constrained Ship Routing Problem , 1999, Transp. Sci..

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

[22]  Helena Ramalhinho Dias Lourenço,et al.  Iterated Local Search , 2001, Handbook of Metaheuristics.

[23]  Kjetil Fagerholt,et al.  A large neighbourhood search heuristic for ship routing and scheduling with split loads , 2010, Comput. Oper. Res..

[24]  Thomas Riis Stidsen,et al.  Service Network Design and Management in Linear Container Shipping Applications , 2010 .

[25]  Laurence A. Wolsey,et al.  Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, 4th International Conference, CPAIOR 2007, Brussels, Belgium, May 23-26, 2007, Proceedings , 2007, CPAIOR.

[26]  Allan Larsen,et al.  Airline Disruption Management - Perspectives, Experiences and Outlook , 2007 .

[27]  Andrew Coles,et al.  Automated Planning for Liner Shipping Fleet Repositioning , 2012, ICAPS.

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

[29]  Cecilia R. Aragon,et al.  Optimization by Simulated Annealing: An Experimental Evaluation; Part I, Graph Partitioning , 1989, Oper. Res..

[30]  Carlos Ansótegui,et al.  A Gender-Based Genetic Algorithm for the Automatic Configuration of Algorithms , 2009, CP.

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