Abstract This paper deals with the containership stowage problem. Containers are placed on the ship in a last-in-first-out manner and therefore temporary unloading and reloading in subsequent ports along the route, called shifting, is common and results in high costs. This is true, in particular, if the stowage plan is based only on stability constraints of the ship. The generating of such schedules depends on the transportation load, the technical constraints and possibilities in the ports, the ship geometry, the sequence of ports visited and some other rather technical constraints (e. g. very heavy containers or hazardous goods). We will show how this containership stowage problem can be modeled as a mixed integer programming model and discuss the computational complexity of the problem. Based on these results, solution methods are developed and some special cases are analyzed. Furthermore, as a cross reference, we draw our attention to other combinatorial problems like the three-dimensional packing problem with special precedence constraints or pile-up problems. Finally, we propose possible directions for further research.
Optimization Models for the Containership Stowage Problem
Operations Research Proceedings 2003 ; 12 ; 347-354
Operations Research Proceedings ; 2003 , 12
2004-01-01
8 pages
Article/Chapter (Book)
Electronic Resource
English
Applying expert knowledge to containership stowage planning: an empirical study
Springer Verlag | 2021
|Containership cargo profiles, cargo systems, and stowage capacity: key performance indicators
Springer Verlag | 2021
|Containerships - Containership overcapacity continues
Online Contents | 2014