Highlights A generalization of Slot Planning including intake maximization and IMO containers. An improved IP formulation with a better lower bound and optimality performance. A GRASP implementation with different randomization strategies and improvement moves. A novel public benchmark of instances with different characteristics.
Abstract This work presents a generalization of the Slot Planning Problem which raises when the liner shipping industry needs to plan the placement of containers within a vessel (stowage planning). State-of-the-art stowage planning relies on a heuristic decomposition where containers are first distributed in clusters along the vessel. For each of those clusters a specific position for each container must be found. Compared to previous studies, we have introduced two new features: the explicit handling of rolled out containers and the inclusion of separations rules for dangerous cargo. We present a novel integer programming formulation and a Greedy Randomized Adaptive Search Procedure (GRASP) to solve the problem. The approach is able to find high-quality solution within 1s. We also provide comparison with the state-of-the-art on an existing and a new set of benchmark instances.
A GRASP algorithm for the container stowage slot planning problem
2016-07-23
17 pages
Aufsatz (Zeitschrift)
Elektronische Ressource
Englisch
A GRASP algorithm for the container stowage slot planning problem
Online Contents | 2016
|Group-Bay Stowage Planning Problem for Container Ship
Online Contents | 2016
|The ship stowage planning problem
Tema Archiv | 2008
|Artificial Intelligence for Automatic Container Stowage Planning Optimisation
Taylor & Francis Verlag | 2003
|