Eco-efficient stowage plans that are both competitive and sustainable have become a priority for the shipping industry. Stowage planning is NP-hard and is a challenging optimization problem in practice. We propose a new 2-phase approach that generates near-optimal stowage plans and fulfills industrial time and quality requirements. Our approach combines an integer programming model for assigning groups of containers to storage areas of the vessel over multiple ports, and a constraint programming and local search procedure for stowing individual containers.
|Journal||Proceedings of the International Joint Conference on Artificial Intelligence|
|Publication status||Published - 2011|
|Event||2nd International Conference on Computational Logistics - Hamburg, Germany|
Duration: 19 Sep 2011 → 22 Sep 2011
Conference number: 2
|Conference||2nd International Conference on Computational Logistics|
|Period||19/09/2011 → 22/09/2011|