Future Generation Computer Systems
Container ship stowage problem: complexity and connection to the coloring of circle graphs
Discrete Applied Mathematics
Ant colony optimization theory: a survey
Theoretical Computer Science
A decomposition heuristics for the container ship stowage problem
Journal of Heuristics
Ant colony system: a cooperative learning approach to the traveling salesman problem
IEEE Transactions on Evolutionary Computation
Fast generation of near-optimal plans for eco-efficient stowage of large container vessels
ICCL'11 Proceedings of the Second international conference on Computational logistics
An accurate model for seaworthy container vessel stowage planning with ballast tanks
ICCL'12 Proceedings of the Third international conference on Computational Logistics
Hi-index | 0.00 |
Different heuristics for the problem of determining stowage plans for containerships, that is the so called Master Bay Plan Problem (MBPP), are compared. The first approach is a tabu search (TS) heuristic and it has been recently presented in literature. Two new solution procedures are proposed in this paper: a fast simple constructive loading heuristic (LH) and an ant colony optimization (ACO) algorithm. An extensive computational experimentation performed on both random and real size instances is reported and conclusions on the appropriateness of the tested approaches for the MBPP are drawn.