A decomposition heuristics for the container ship stowage problem

In this paper we face the problem of stowing a containership, referred to as the Master Bay Plan Problem (MBPP); this problem is difficult to solve due to its combinatorial nature and the constraints related to both the ship and the containers. We present a decomposition approach that allows us to assign a priori the bays of a containership to the set of containers to be loaded according to their final destination, such that different portions of the ship are independently considered for the stowage. Then, we find the optimal solution of each subset of bays by using a 0/1 Linear Programming model. Finally, we check the global ship stability of the overall stowage plan and look for its feasibility by using an exchange algorithm which is based on local search techniques. The validation of the proposed approach is performed with some real life test cases.

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

[2]  Eberhard E. Bischoff,et al.  Weight distribution considerations in container loading , 1999, Eur. J. Oper. Res..

[3]  B J Thomas,et al.  Management of port maintenance : a review of current problems and practices , 1989 .

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

[5]  Thomas Rist,et al.  Presenting through performing: on the use of multiple lifelike characters in knowledge-based presentation systems , 2001, Knowl. Based Syst..

[6]  Hermann Gehring,et al.  A hybrid genetic algorithm for the container loading problem , 2001, Eur. J. Oper. Res..

[7]  Hermann Gehring,et al.  A Genetic Algorithm for Solving the Container Loading Problem , 1997 .

[8]  E. E. Bischoff,et al.  Issues in the development of approaches to container loading , 1995 .

[9]  Paul A. Roach,et al.  Principles of Combinatorial Optimization Applied to Container-Ship Stowage Planning , 1999, J. Heuristics.

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

[11]  Akio Imai,et al.  The Containership Loading Problem , 2002 .

[12]  Alf Kimms,et al.  Beyond Manufacturing Resource Planning (MRP II) , 1998 .

[13]  M. Meyer,et al.  A computer-based heuristic for packing pooled shipment containers , 1990 .

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

[15]  Michael Eley,et al.  Solving container loading problems by block arrangement , 2002, Eur. J. Oper. Res..

[16]  Eberhard E. Bischoff,et al.  A comparative evaluation of heuristics for container loading , 1990 .

[17]  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.

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

[19]  Sabah U. Randhawa,et al.  Computerized container-ship load planning: a methodology and evaluation , 1988 .

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

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

[22]  Mordecai Avriel,et al.  Exact and approximate solutions of the container ship stowage problem , 1993 .

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

[24]  M. J Dorfman,et al.  Scheduling trains on a railway network using a discrete event model of railway traffic , 2004 .