Container ships travel on 'round-robin' routes. At each port of destination (POD) along the ship's journey containers may be unloaded whilst additional containers destined for subsequent ports may be loaded. Determining which legal configuration of containerss best facilitates this process, in a cost- effective way, comprises the container stowage problem. Determining all acceptable arrangement of containers is an error-prone process that traditionally relies oil the intuitive skills of human planners. The planner must, determine a suitable arrangement of containers so that constraints are satisfied and handling costs are minimised. The paper explains and compares a range of approaches to the solution of the container-ship stowage problem, which focuses on the reliable production of valid, sub-optimal solutions. These include the strong decomposition of the problem into different conceptual levels of planning to which branch & bound, Tabu search techniques and Genetic algorithms have been applied. A particular focus lies on the relationships between the methods of solution and the corresponding models of cargo and stowage spaces, and the consequences that these models have for the accuracy and usefulness of the solutions produced.
Artificial intelligence for automatic container stowage planning optimisation
Künstliche Intelligenz für die Optimierung der automatischen Container-Stauplanung
Ship Technology Research / Schiffstechnik ; 50 , 4 ; 151-156
2003
6 Seiten, 15 Quellen
Article (Journal)
English
Artificial Intelligence for Automatic Container Stowage Planning Optimisation
Taylor & Francis Verlag | 2003
|Artificial Intelligence for Automatic Container Stowage Planning Optimisation
Online Contents | 2003
|Group-Bay Stowage Planning Problem for Container Ship
Online Contents | 2016
|