The generation of competitive stowage plans have become a priority for the shipping industry. Stowage planning is NP-hard and is a challenging optimization problem in practice. Two-phase decomposition approaches have proved to give viable solutions. We propose a large neighborhood search (LNS) to solve the first of the two phases, the multi-port master planning problem. Our approach combines the strength of mathematical modeling with the flexibility of a local search. We show how the new approach can solve more instances than previous mathematical models, and present an analysis of its performance. © 2013 Springer-Verlag.
CITATION STYLE
Pacino, D. (2013). An LNS approach for container stowage multi-port master planning. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8197 LNCS, pp. 35–44). Springer Verlag. https://doi.org/10.1007/978-3-642-41019-2_3
Mendeley helps you to discover research relevant for your work.