Constraint-based local search for container stowage slot planning

Dario Pacino, Rune Møller Jensen

Research output: Contribution to journalConference articleResearch

379 Downloads (Pure)


Due to the economical importance of stowage planning, there recently has been an increasing interest in developing optimization algorithms for this problem. We have developed 2-phase approach that in most cases can generate near optimal stowage plans within a few hundred seconds for large deep-sea vessels. This paper describes the constrained- based local search algorithm used in the second phase of this approach where individual containers are assigned to slots in each bay section. The algorithm can solve this problem in an average of 0.18 seconds per bay, corresponding to a 20 seconds runtime for the entire vessel. The algorithm has been validated on a benchmark suite of 133 industrial instances for which 86% of the instances were solved to optimality.
Original languageEnglish
JournalLecture Notes in Engineering and Computer Science
Pages (from-to)1467-1472
Number of pages6
Publication statusPublished - 2012
Externally publishedYes
EventInternational MultiConference of Engineers and Computer Scientists 2012 (IMECS 2012) - Hong Kong, Hong Kong
Duration: 14 Mar 201216 Mar 2012


ConferenceInternational MultiConference of Engineers and Computer Scientists 2012 (IMECS 2012)
Country/TerritoryHong Kong
CityHong Kong


Dive into the research topics of 'Constraint-based local search for container stowage slot planning'. Together they form a unique fingerprint.

Cite this