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.
Lecture Notes in Computer Science: 4th International Conference, Iccl 2013, Copenhagen, Denmark, September 25-27, 2013. Proceedings, 2013, p. 35-44
Algorithm Analysis and Problem Complexity; Information Systems Applications (incl. Internet); Software Engineering; Artificial Intelligence (incl. Robotics); Simulation and Modeling; Computer Appl. in Administrative Data Processing
Main Research Area:
Lecture Notes in Computer Science
4th International Conference on Computational Logistics, 2013