Abstract
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 \(86\,\%\) of the instances were solved to optimality.
This research is sponsored in part by the Danish Maritime Fund under the BAYSTOW project.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Ambrosino D, Anghinolfi D, Paolucci M, Sciomachen A (2010) An experimental comparison of different heuristics for the master bay plan problem. In: Proceedings of the 9th international symposium on experimental algorithms, pp 314–325
Ambrosino D, Sciomachen A (1998) A constraint satisfaction approach for master bay plans. Marit Eng Ports 36:175–184
Ambrosino D, Sciomachen A (2003) Impact of yard organization on the master bay planning problem. Marit Econ Logist 5:285–300
Avriel M, Penn M, Shpirer N, Witteboon S (1998) Stowage planning for container ships to reduce the number of shifts. Ann Oper Res 76:55–71
Aye WC, Low MYH, Ying HS, Jing HW, Min Z (2010) Visualization and simulation tool for automated stowage plan generation system. In: Proceedings of the international multiconference of engineers and computer scientists (IMECS 2010), vol 2. Hong Kong, pp 1013–1019
Botter RC, Brinati MA (1992) Stowage container planning: a model for getting an optimal solution. In: Proceedings of the 7th international conference on computer applications in the automation of shipyard operation and ship design, pp 217–229
Davidor Y, Avihail M (1996) A method for determining a vessel stowage plan. Patent Publication WO9735266
Delgado A, Jensen RM, Schulte C (2009) Generating optimal stowage plans for container vessel bays. In: Proceedings of the 15th international conference on principles and practice of constraint programming (CP-09), LNCS series, vol 5732, pp 6–20
Delgado A, Jensen RM, Janstrup K, Rose TH, Andersen KH (2011) A constraint programming model for fast optimal stowage of container vessel bays. Eur J Oper Res (accepted for publication)
Dubrovsky O, Levitin G, Michal P (2002) A genetic algorithm with a compact solution encoding for the container ship stowage problem. J Heuristics 8:585–599
Giemesch P, Jellinghaus A (2003) Optimization models for the containership stowage problem. In: Proceedings of the international conference of the german operations research society
Kang JG, Kim YD (2002) Stowage planning in maritime container transportation. J Oper Res Soc 53(4):415–426
Li F, Tian C, Cao R, Ding W (2008) An integer programming for container stowage problem. In: Proceedings of the international conference on computational science, Part I, LNCS, vol 5101. Springer, pp 853–862
Nugroho S (2004) Case-based stowage planning for container ships. In: The international logistics congress
Pacino D, Jensen RM (2012) Constraint-based local search for container stowage slot planning. In: Proceedings of the international multiconference of engineers and computer scientists (IMECS 2012). Hong Kong, pp 1467–1472
Pacino D, Delgado A, Jensen RM, Bebbington T (2011) Fast generation of near-optimal plans for eco-efficient stowage of large container vessels. In: ICCL, pp 286–301
Pacino D, Jensen RM (2010) A 3-phase randomized constraint based local search algorithm for stowing under deck locations of container vessel bays. Technical report TR-2010-123, IT-University of Copenhagen
Sciomachen A, Tanfani A (2003) The master bay plan problem: a solution method based on its connection to the three-dimensional bin packing problem. IMA J Manag Math 14:251–269
Van Hentenryck P, Michel L (2009) Constraint-based local search. The MIT Press, Cambridge
Wilson ID, Roach P (1999) Principles of combinatorial optimization applied to container-ship stowage planning. J Heuristics 5:403–418
Yoke M, Low H, Xiao X, Liu F, Huang SY, Hsu, WJ, Li Z (2009) An automated stowage planning system for large containerships. In: Proceedings of the 4th virtual international conference on intelligent production machines and systems
Zhang W-Y, Lin Y, Ji Z-S (2005) Model and algorithm for container ship stowage planning based on bin-packing problem. J Mar Sci Appl 4(3):1269
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer Science+Business Media Dordrecht
About this chapter
Cite this chapter
Pacino, D., Jensen, R.M. (2013). Fast Slot Planning Using Constraint-Based Local Search. In: Yang, GC., Ao, SI., Huang, X., Castillo, O. (eds) IAENG Transactions on Engineering Technologies. Lecture Notes in Electrical Engineering, vol 186. Springer, Dordrecht. https://doi.org/10.1007/978-94-007-5651-9_4
Download citation
DOI: https://doi.org/10.1007/978-94-007-5651-9_4
Published:
Publisher Name: Springer, Dordrecht
Print ISBN: 978-94-007-5623-6
Online ISBN: 978-94-007-5651-9
eBook Packages: EngineeringEngineering (R0)