Fast Generation of Container Vessel Stowage Plans

Containerization has changed the way the world perceives shipping. It is now possible to establish complex international supply chains that have minimized shipping costs. Over the past two decades, the demand for cost efficient containerized transportation has seen a continuous increase. In order to answer to this demand, shipping companies have deployed bigger container vessels, that nowadays can transport up to 18,000 containers and are wider than the extended Panama Canal. Like busses, container vessels sail from port to port through a fixed route loading and discharging thousands of containers. Before the vessel arrives at a port, it is the job of a stowage coordinator to devise a stowage plan. A stowage plan is a document describing where each container should be loaded in the vessel once terminal operations commence. When creating stowage plans, stowage coordinators must make sure that the vessel is stable and seaworthy, and at the same time arrange the cargo such that the time at port is minimized. Moreover, stowage coordinators only have a limited amount of time to produce the plan. This thesis addresses the question of whether it is possible to automatically generate stowage plans to be used by stowage coordinators, and it advocates that the quality of the stowage plans and the time in which they can be generated is of the outmost importance for practical usage. We introduce a detailed description of a representative problem of the computational complexity of stowage planning that has enough detail to allow professionals from the industry to evaluate its solutions. A 2-phase hierarchical decomposition of the problem is presented. In the first phase, the problem of distributing containers to sections of the vessel is solved, and it is here that the seaworthiness of the solution is evaluated. In the second phase, the assignment of containers is refined to specific positions within the ship and lower level constraints are handled. The approach has been implemented with a combination of operations research and artificial intelligence methods, and has produced promising results on real test instances provided by a major liner shipping company. Improvements to the modeling of vessel stability and an analysis of its accuracy together with an analysis of the computational complexity of the container stowage problem are also included in the thesis, resulting in an overall in-depth analysis of the problem.

[1]  Lin Yan,et al.  Model and algorithm for container ship stowage planning based on bin-packing problem , 2005 .

[2]  Stanley B. Gershwin,et al.  Performance of hierarchical production scheduling policy , 1984 .

[3]  Giuseppe Menga,et al.  Hybrid hierarchical scheduling and control systems in manufacturing , 1990, IEEE Trans. Robotics Autom..

[4]  D. Ambrosino,et al.  A constraint satisfaction approach for Master Bay Plans , 1970 .

[5]  Rjm Rob Vaessens Generalized job shop scheduling : complexity and local search , 1995 .

[6]  Pascal Van Hentenryck,et al.  Iterative Relaxations for Iterative Flattening in Cumulative Scheduling , 2004, ICAPS.

[7]  Mordecai Avriel,et al.  Stowage planning for container ships to reduce the number of shifts , 1998, Ann. Oper. Res..

[8]  J. Christopher Beck,et al.  Texture-Based Heuristics for Scheduling Revisited , 1997, AAAI/IAAI.

[9]  Gregory Levitin,et al.  A Genetic Algorithm with a Compact Solution Encoding for the Container Ship Stowage Problem , 2002, J. Heuristics.

[10]  Benoît Demil,et al.  The box : how the shipping container made the world smaller and the world economy bigger , 2006 .

[11]  Russell Bent,et al.  Spatial, Temporal, and Hybrid Decompositions for Large-Scale Vehicle Routing with Time Windows , 2010, CP.

[12]  J. Christopher Beck,et al.  Principles for the Design of Large Neighborhood Search , 2009, J. Math. Model. Algorithms.

[13]  Anastasios Haralampos Aslidis Optimal container loading , 1984 .

[14]  Imed Kacem,et al.  Genetic algorithm for the flexible job-shop scheduling problem , 2003, SMC'03 Conference Proceedings. 2003 IEEE International Conference on Systems, Man and Cybernetics. Conference Theme - System Security and Assurance (Cat. No.03CH37483).

[15]  Anastasios Haralampos Aslidis Combinatorial algorithms for stacking problems , 1989 .

[16]  I. D. Wilson,et al.  Container stowage planning: a methodology for generating computerised solutions , 2000, J. Oper. Res. Soc..

[17]  Wim Nuijten,et al.  Randomized Large Neighborhood Search for Cumulative Scheduling , 2005, ICAPS.

[18]  Peter Brucker,et al.  Job-shop scheduling with multi-purpose machines , 1991, Computing.

[19]  Evangelos Kaisar,et al.  A Stowage Planning Model for Multiport container Transportation , 2006 .

[20]  Anna Sciomachen,et al.  A new three-step heuristic for the Master Bay Plan Problem , 2009 .

[21]  Shell Ying Huang,et al.  An Automated Stowage Planning System for Large Containerships , 2009 .

[22]  Feng Li,et al.  An Integer Linear Programming for Container Stowage Problem , 2008, ICCS.

[23]  Anna Sciomachen,et al.  Stowing a containership: the master bay plan problem , 2004 .

[24]  Paul A. Roach,et al.  Container stowage pre-planning: using search to generate solutions, a case study , 2001, Knowl. Based Syst..

[25]  Stéphane Dauzère-Pérès,et al.  An integrated approach for modeling and solving the general multiprocessor job-shop scheduling problem using tabu search , 1997, Ann. Oper. Res..

[26]  Anna Sciomachen,et al.  An Experimental Comparison of Different Heuristics for the Master Bay Plan Problem , 2010, SEA.

[27]  Liu Yanbin,et al.  Multi-agent ERA Model Based on Belief Solves Multi-port Container Stowage Problem , 2008, 2008 Seventh Mexican International Conference on Artificial Intelligence.

[28]  Johann L. Hurink,et al.  Tabu search for the job-shop scheduling problem with multi-purpose machines , 1994 .

[29]  Philip M. Kaminsky,et al.  A Multi-stage Decomposition Heuristic for the Container Stowage Problem , 2008 .

[30]  Pascal Van Hentenryck,et al.  Large Neighborhood Search and Adaptive Randomized Decompositions for Flexible Jobshop Scheduling , 2011, IJCAI.

[31]  Mordecai Avriel,et al.  Container ship stowage problem: complexity and connection to the coloring of circle graphs , 2000, Discret. Appl. Math..

[32]  Paolo Brandimarte,et al.  Routing and scheduling in a flexible job shop by tabu search , 1993, Ann. Oper. Res..

[33]  Liu Fan,et al.  Stowage Planning of Large Containership with Tradeoff between Crane Workload Balance and Ship Stability , 2010 .

[34]  Dario Pacino,et al.  A local search extended placement heuristic for stowing under deck bays of container vessels , 2009 .

[35]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[36]  Wen-Jing Hsu,et al.  Randomized Algorithm with Tabu Search for Multi-Objective Optimization of Large Containership Stowage Plans , 2011, ICCL.

[37]  Peter Brucker,et al.  Tabu-search for the multi-mode job-shop problem , 1998 .

[38]  I. D. Wilson,et al.  Principles of Combinatorial Optimization Applied to Container-Ship Stowage Planning , 1999, J. Heuristics.

[39]  Alberto Delgado,et al.  A Constraint Programming model for fast optimal stowage of container vessel bays , 2012, Eur. J. Oper. Res..

[40]  R. C. Botter,et al.  Stowage Container Planning: A Model for Getting an Optimal Solution , 1991, Computer Applications in the Automation of Shipyard Operation and Ship Design.

[41]  Alberto Delgado,et al.  Fast Generation of Near-Optimal Plans for Eco-Efficient Stowage of Large Container Vessels , 2011, ICCL.

[42]  Rune Møller Jensen,et al.  A 3-Phase Randomized Constraint Based Local Search Algorithm for Stowing Under Deck Locations of Container Vessel Bays , 2010 .

[43]  Anna Sciomachen,et al.  A decomposition heuristics for the container ship stowage problem , 2006, J. Heuristics.

[44]  Mohamed Haouari,et al.  Discrepancy search for solving flexible scheduling problems , 2010 .

[45]  Bernd Jurisch,et al.  Scheduling jobs in shops with multi-purpose machines , 1992 .

[46]  Akio Imai,et al.  Multi-objective simultaneous stowage and load planning for a container ship with container rehandle in yard stacks , 2006, Eur. J. Oper. Res..

[47]  Steven Minton,et al.  Minimizing Conflicts: A Heuristic Repair Method for Constraint Satisfaction and Scheduling Problems , 1992, Artif. Intell..

[48]  D Ambrosino,et al.  Impact of Yard Organisation on the Master Bay Planning Problem , 2003 .

[49]  A. Sciomachen,et al.  The master bay plan problem: a solution method based on its connection to the three‐dimensional bin packing problem , 2003 .

[50]  Alberto Delgado,et al.  Generating Optimal Stowage Plans for Container Vessel Bays , 2009, CP.

[51]  Stefan Voß,et al.  Container terminal operation and operations research - a classification and literature review , 2004, OR Spectr..

[52]  Mitsuo Gen,et al.  A hybrid genetic and variable neighborhood descent algorithm for flexible job shop scheduling problems , 2008, Comput. Oper. Res..

[53]  P. Lopez,et al.  Climbing depth-bounded discrepancy search for solving hybrid flow shop problems , 2007 .

[54]  Stephen F. Smith,et al.  Iterative Flattening: A Scalable Method for Solving Multi-Capacity Scheduling Problems , 2000, AAAI/IAAI.

[55]  Wen-Jing Hsu,et al.  Improving Safety and Stability of Large Containerships in Automated Stowage Planning , 2011, IEEE Systems Journal.

[56]  J.-G. Kang,et al.  Stowage planning in maritime container transportation , 2002, J. Oper. Res. Soc..

[57]  Peer Giemsch,et al.  Optimization Models for the Containership Stowage Problem , 2004 .

[58]  Rune Møller Jensen,et al.  Fast Interactive Decision Support for Modifying Stowage Plans Using Binary Decision Diagrams , 2012, IMECS 2012.

[59]  Dario Pacino,et al.  Constraint-based local search for container stowage slot planning , 2012, IMECS 2012.