Generating Optimal Stowage Plans for Container Vessel Bays
2009 (English)In: PRINCIPLES AND PRACTICE OF CONSTRAINT PROGRAMMING, 2009, Vol. 5732, 6-20 p.Conference paper (Refereed)
Millions of containers are stowed ever.), week with goods worth billions of dollars, but container vessel stowage is an all but neglected combinatorial optimization problem. In this paper, we introduce a model for stowing containers in a vessel bay which is the result of probably the longest collaboration to date with a liner shipping company on automated stowage planning. We then show how to solve this model efficiently in - to our knowledge - the first; application of CP to stowage planning using state-of-the-art techniques such as extensive use of global constraints, viewpoints, static and dynamic symmetry breaking, decomposed branching strategies, and early failure detection. Our CP approach outperforms an integer programming and column generation approach in a preliminary study. Since a complete model of this problem includes even more logical constraints, we believe that stowage planning is a new application area, for CP with a high impact potential.
Place, publisher, year, edition, pages
2009. Vol. 5732, 6-20 p.
, Lecture Notes in Computer Science, ISSN 0302-9743 ; 5732
IdentifiersURN: urn:nbn:se:kth:diva-70423DOI: 10.1007/978-3-642-04244-7_4ISI: 000273241200001ScopusID: 2-s2.0-70350414473OAI: oai:DiVA.org:kth-70423DiVA: diva2:486332
15th International Conference on Principles and Practice of Constraint Programming (CP 2009). Lisbon, PORTUGAL. SEP 20-24, 2009
QC 201202082012-01-302012-01-302012-02-08Bibliographically approved