Fast slot planning using constraint-based local search

Dario Pacino, Rune Møller Jensen

Research output: Contribution to journalJournal articleResearch

391 Downloads (Pure)


Due to the economic importance of stowage planning, there recently has been an increasing interest in developing optimization algorithms for this problem. We have developed a 2-phase approach that in most cases can generate near optimal stowage plans within a few 100 s for large deep-sea vessels. This paper describes the constraint-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 s per bay, corresponding to a runtime of 20 s for the entire vessel. The algorithm has been validated on a benchmark suite of 133 industrial instances for which of the instances were solved to optimality. © 2013 Springer Science+Business Media Dordrecht.
Original languageEnglish
JournalLecture Notes in Engineering and Computer Science
Pages (from-to)49-63
Number of pages15
Publication statusPublished - 2013
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)
CountryHong Kong
CityHong Kong

Cite this