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

Anibal Tavares De Azevedo, Cassilda Maria Ribeiro, Galeno José De Sena, Antônio Augusto Chaves, Luis Leduíno Salles Neto and Antônio Carlos Moretti

International Journal of Data Analysis Techniques and Strategies, 2014, vol. 6, issue 3, 228-260

Abstract: 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.

Keywords: 3D container ship stowage; combinatorial optimisation; metaheuristics; container shipping; ship loading; loading planning; stowage planning; genetic algorithms; simulated annealing; beam search. (search for similar items in EconPapers)
Date: 2014
References: Add references at CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://www.inderscience.com/link.php?id=63060 (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:ids:injdan:v:6:y:2014:i:3:p:228-260

Access Statistics for this article

More articles in International Journal of Data Analysis Techniques and Strategies from Inderscience Enterprises Ltd
Bibliographic data for series maintained by Sarah Parker ().