Abstract
We present a novel solution approach to the container pre-marshalling problem using the A* and IDA* algorithms combined with several novel branching and symmetry breaking rules that significantly increases the number of pre-marshalling instances that can be solved to optimality. A* and IDA* are graph search algorithms that use heuristics combined with a complete graph search to find optimal solutions to problems. The container pre-marshalling problem is a key problem for container terminals seeking to reduce delays of inter-modal container transports. The goal of the container pre-marshalling problem is to find the minimal sequence of container movements to shuffle containers in a set of stacks such that the resulting stacks are arranged according to the time each container must leave the stacks. We evaluate our approach on three well-known datasets of pre-marshalling problem instances, solving over 500 previously unsolved instances to optimality, which is nearly twice as many instances as the current state-of-the-art method solves.
Similar content being viewed by others
Notes
We note that multiple containers may have the same priority, but in order to make containers easily identifiable, in this example we have assigned a different priority to each container.
We note that this may be a fruitful direction for future work.
Moving container 4 to stack a is actually a move reversal as discussed in Sect. 5.1, which is a special case of successive transitive moves.
We note that we cannot use the exact same instances as in Expósito-Izquierdo et al. (2012) because their instances were unfortunately lost by those authors.
References
Betzalel O, Felner A, Shimony SE (2015) Type system based rational lazy IDA*. In: Eighth annual symposium on combinatorial search
Bortfeldt A, Forster F (2012) A tree search procedure for the container pre-marshalling problem. Eur J Oper Res 217(3):531–540
Carlo HJ, Vis IFA, Roodbergen KJ (2014) Storage yard operations in container terminals: literature overview, trends, and research directions. Eur J Oper Res 235(2):412–430
Carlo HJ, Vis IFA, Roodbergen KJ (2015) Seaside operations in container terminals: literature overview, trends, and research directions. Flex Serv Manuf J 27(2–3):224–262
Caserta M, Schwarze S, Voß S (2011) Container rehandling at maritime container terminals. In: Böse JW (ed) Handbook of terminal planning, operations research/computer science interfaces series, vol 49. Springer, New York, pp 247–269
Caserta M, Voß S (2009) A corridor method-based algorithm for the pre-marshalling problem. Lecture Notes Comput Sci 5484:788–797
Choe R, Park T, Oh MS, Kang J, Ryu KR (2011) Generating a rehandling-free intra-block remarshaling plan. J Intell Manuf 22(2):201–217
Culberson JC, Schaeffer J (1998) Pattern databases. Computat Intell 14(3):318–334
Dekker R, Voogd P, van Asperen E (2006) Advanced methods for container stacking. OR Spectr 28(4):563–586
Dijkstra EW (1959) A note on two problems in connexion with graphs. Num Math 1(1):269–271
Expósito-Izquierdo C, Melián-Batista B, Moreno-Vega M (2012) Pre-marshalling problem: Heuristic solution method and instances generator. Expert Syst Appl 39(9):8337–8349
Felsner S, Pergel M (2008) The complexity of sorting with networks of stacks and queues. Lecture Notes Comput Sci 5193:417–429
Gheith MS, El-Tawil AB, Harraz NA (2013) A proposed heuristic for solving the container pre-marshalling problem. In: Qi E, Shen J, Dou R (eds) The 19th international conference on industrial engineering and engineering management. Springer, Berlin, pp 955–964
Gupta N, Nau DS (1992) On the complexity of blocks-world planning. Artif Intell 56(2–3):223–254
Hart PE, Nilsson NJ, Raphael B (1968) A formal basis for the heuristic determination of minimum cost paths. IEEE Trans Syst Sci Cybern 4(2):100–107
Hinz AM (1989) The tower of Hanoi. Enseign Math 35(2):289–321
Holte RC, Burch N (2014) Automatic move pruning for single-agent search. AI Commun 27(4):363–383
Huang S-H, Lin T-H (2012) Heuristic algorithms for container pre-marshalling problems. Comput Ind Eng 62(1):13–20
ISO/IEC (2011) Information technology—Programming languages—C++, third edition. ISO/IEC 14882:2011, International Organization for Standardization/International Electrotechnical Commission, Geneva, Switzerland
Jovanovic R, Tuba M, Voß S (2015) A multi-heuristic approach for solving the pre-marshalling problem. Cent Eur J Oper Res. doi:10.1007/s10100-015-0410-y
Kang J, Oh MS, Ahn EY, Ryu KR, Kim KH (2006) Planning for intra-block remarshalling in a container terminal. Lecture Notes Artif Intell 4031:1211–1220
Kang J, Ryu KR, Kim KH (2006) Deriving stacking strategies for export containers with uncertain weight information. J Intell Manuf 17(4):399–410
Kim KH (1997) Evaluation of the number of rehandles in container yards. Comput Ind Eng 32:701–711
Kim KH, Bae JW (1998) Re-marshalling export containers in port container terminals. Comput Ind Eng 35(3–4):655–658
Kim KH, Hong G-P (2006) A heuristic rule for relocating blocks. Comput Oper Res 33(4):940–954
Klaws J, Stahlbock R, Voß S (2011) Container terminal yard operations—simulation of a side-loaded container block served by triple rail mounted gantry cranes. Lecture Notes Comput Sci 6971:243–255
Korf RE (1985) Depth-first iterative-deepening: an optimal admissible tree search. Artif Intell 27(1):97–109
Lee Y, Chao SL (2009) A neighborhood search heuristic for pre-marshalling export containers. Eur J Oper Res 196(2):468–475
Lee Y, Hsu NY (2007) An optimization model for the container pre-marshalling problem. Comput Oper Res 34(11):3295–3313
Lee Y, Lee Y-J (2010) A heuristic for retrieving containers from a yard. Comput Oper Res 37(6):1139–1147
Legato P, Mazza RM, Trunfio R (2013) Medcenter container terminal SpA uses simulation in housekeeping operations. Interfaces 43(4):313–324
Lehnfeld J, Knust S (2014) Loading, unloading and premarshalling of stacks in storage areas: survey and classification. Eur J Oper Res 239(2):297–312
Nishi T, Konishi M (2010) An optimisation model and its effective beam search heuristics for floor-storage warehousing systems. Int J Prod Res 48:1947–1966
Park K, Park T, Ryu KR (2009) Planning for remarshalling in an automated container terminal using cooperative coevolutionary algorithms. In: SAC 2009—Honolulu, Hawaii, pp 1098–1105
Petering MEH (2015) Real-time container storage location assignment at an RTG-based seaport container transshipment terminal: problem description, control system, simulation model, and penalty scheme experimentation. Flex Serv Manuf J 27(2–3):351–381
Prandtstetter M (2013) A dynamic programming based branch-and-bound algorithm for the container pre-marshalling problem. Technical report, Austrian Institute of Technology
Rendl A, Prandtstetter M (2013) Constraint models for the container pre-marshaling problem. In: Katsirelos G, Quimper C-G (eds), ModRef 2013: 12th international workshop on constraint modelling and reformulation, pp 44–56
Rodrigue JP, Comtois C, Slack B (2009) The geography of transport systems, 2nd edn. Routledge, Milton Park
Rodríguez-Molins M, Salido MÁ, Barber F (2010) Domain-dependent planning heuristics for locating containers in maritime terminals. In: García-Pedrajas N, Herrera F, Fyfe C, Benítez JM, Ali M (eds) Trends in applied intelligent systems. Lecture Notes Comput Sci, vol 6096. Springer, Berlin, Heidelberg, pp 742–751
Romero AG, Alquézar R (2004) To block or not to block? Lecture Notes Comput Sci 3315:134–143
Russell SJ, Norvig P (2010) Artificial intelligence: a modern approach. Prentice Hall, Upper Saddle River
Salido MA, Rodriguez-Molins M, Barber F (2012) A decision support system for managing combinatorial problems in container terminals. Knowl-Based Syst 29:63–74
Salido MA, Sapena O, Rodriguez M, Barber F (2009) A planning tool for minimizing reshuffles in container terminals. In: 21st IEEE international conference on tools with artificial intelligence, pp 567–571
Schulte C, Carlsson M (2006) Finite domain constraint programming systems. In: Rossi F, van Beek P, Walsh T (eds) Handbook of constraint programming, volume of 2 foundations of artificial intelligence. Elsevier, Amsterdam, pp 29–83
Shleyfman A, Katz M, Helmert M, Sievers S, Wehrle M (2015) Heuristics and symmetries in classical planning. In: Twenty-Ninth AAAI conference on artificial intelligence
Stahlbock R, Voß S (2008) Operations research at container terminals: a literature update. OR Spectr 30(1):1–52
Steenken D, Voß S, Stahlbock R (2004) Container terminal operations and operations research—a classification and literature review. OR Spectr 26(1):3–49
Tang L, Zhao R, Liu J (2012) Models and algorithms for shuffling problems in steel plants. Nav Res Logist (NRL) 59(7):502–524
Tierney K, Voß S, Stahlbock R (2014) A mathematical model of inter-terminal transportation. Eur J Oper Res 235(2):448–460
UNCTAD (2012) United Nations Conference on Trade and Development (UNCTAD), review of maritime transport
van Asperen E, Borgman B, Dekker R (2013) Evaluating impact of truck announcements on container stacking efficiency. Flex Serv Manuf J 25(4):543–556
Voß S (2012) Extended mis-overlay calculation for pre-marshalling containers. In: Hu H, Shi X, Stahlbock R, Voß S (eds) Computational logistics. Lecture Notes Comput Sci, vol 7555. Springer, Berlin, pp 86–91
Zäpfel G, Wasner M (2006) Warehouse sequencing in the steel supply chain as a generalized job shop model. Int J Prod Econ 104(2):482–501
Zehendner E, Feillet D (2014) A branch and price approach for the container relocation problem. Int J Prod Res 52(24):7159–7176
Zhang H, Guo S, Zhu W, Lim A, Cheang B (2010) An investigation of IDA* algorithms for the container relocation problem. In: García-Pedrajas N, Herrera F, Fyfe C, Benítez JM, Ali M (eds) Trends in applied intelligent systems. Lecture Notes Comput Sci, vol 6096. Springer, Berlin, Heidelberg, pp 31–40
Zhang R, Jiang Z, Yun W (2015a) Stack pre-marshalling problem: a heuristic-guided branch-and-bound algorithm. Int J Ind Eng Theory Appl Pract 22(5):509–523
Zhang R, Liu S, Kopfer H (2015b) Tree search procedures for the blocks relocation problem with batch moves. Flex Serv Manuf J. doi:10.1007/s10696-015-9229-z
Zhang Y, Mi W, Chang D, and Yan W (2007) An optimization model for intra-bay relocation of outbound containers on container yards. In: Proceedings of the IEEE international conference on automation and logistics, pp 776–781
Zhu W, Qin H, Lim A, Zhang H (2012) Iterative deepening A* algorithms for the container relocation problem. IEEE Trans Autom Sci Eng 9(4):710–722
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Tierney, K., Pacino, D. & Voß, S. Solving the pre-marshalling problem to optimality with A* and IDA*. Flex Serv Manuf J 29, 223–259 (2017). https://doi.org/10.1007/s10696-016-9246-6
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10696-016-9246-6