Solving the 3D container ship loading planning problem by representation by rules and meta-heuristics
Carregando...
Data
Orientador
Coorientador
Pós-graduação
Curso de graduação
Título da Revista
ISSN da Revista
Título de Volume
Editor
Tipo
Artigo
Direito de acesso
Resumo
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. © 2014 Inderscience Enterprises Ltd.
Descrição
Palavras-chave
3D Container ship stowage, Combinatorial optimisation, Meta-heuristic
Idioma
Inglês
Citação
International Journal of Data Analysis Techniques and Strategies, v. 6, n. 3, p. 228-260, 2014.
