Solving the 3D container ship loading planning problem by representation by rules and meta-heuristics

This paper formulates the 3D containership loading planning problem 3D CLPP and also proposes a new and compact representation to efficiently solve it. The key objective of stowage planning is to minimise the number of container movements and also the ship's instability. The binary formulation of this problem is properly described and an alternative formulation called Representation by Rules is proposed. This new representation is combined with three metaheuristics - genetic algorithm, simulated annealing, and beam search - to solve the 3D CLPP in a manner that ensures that every solution analysed in the optimisation process is compact and feasible.

[1]  Michel Bierlaire,et al.  Optimization at Container Terminals: Status, Trends and Perspectives (revised version) , 2007 .

[2]  Federico Della Croce,et al.  A Recovering Beam Search algorithm for the one-machine dynamic total completion time scheduling problem , 2002, J. Oper. Res. Soc..

[3]  Christian Blum,et al.  Metaheuristics in combinatorial optimization: Overview and conceptual comparison , 2003, CSUR.

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

[5]  Anibal Tavares de Azevedo,et al.  Problem of assignment cells to switches in a cellular mobile network via Beam search method , 2010 .

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

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

[8]  Patrick R. McMullen,et al.  A simulated annealing approach to mixed-model sequencing with multiple objectives on a just-in-time line , 2000 .

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

[10]  Goldberg,et al.  Genetic algorithms , 1993, Robust Control Systems with Genetic Algorithms.

[11]  Zbigniew Michalewicz,et al.  Genetic Algorithms + Data Structures = Evolution Programs , 1996, Springer Berlin Heidelberg.

[12]  Anna Sciomachen,et al.  A 3D-BPP approach for optimising stowage plans and terminal productivity , 2007, Eur. J. Oper. Res..

[13]  Bruce T. Lowerre,et al.  The HARPY speech recognition system , 1976 .

[14]  Harald Dyckhoff,et al.  A typology of cutting and packing problems , 1990 .

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

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

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

[18]  Zbigniew Michalewicz,et al.  Genetic algorithms + data structures = evolution programs (3rd ed.) , 1996 .

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

[20]  Jorge M. S. Valente,et al.  Filtered and recovering beam search algorithms for the early/tardy scheduling problem with no idle time , 2005, Comput. Ind. Eng..

[21]  P. Ow,et al.  Filtered beam search in scheduling , 1988 .

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

[23]  Gerhard Wäscher,et al.  An improved typology of cutting and packing problems , 2007, Eur. J. Oper. Res..

[24]  John H. Holland,et al.  Adaptation in Natural and Artificial Systems: An Introductory Analysis with Applications to Biology, Control, and Artificial Intelligence , 1992 .

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