Abstract
Minimizing the number of reshuffling operations at maritime container terminals incorporates the pre-marshalling problem (PMP) as an important problem. Based on an analysis of existing solution approaches we develop new heuristics utilizing specific properties of problem instances of the PMP. We show that the heuristic performance is highly dependent on these properties. We introduce a new method that exploits a greedy heuristic of four stages, where for each of these stages several different heuristics may be applied. Instead of using randomization to improve the performance of the heuristic, we repetitively generate a number of solutions by using a combination of different heuristics for each stage. In doing so, only a small number of solutions is generated for which we intend that they do not have undesirable properties, contrary to the case when simple randomization is used. Our experiments show that such a deterministic algorithm significantly outperforms the original nondeterministic method. The improvement is twofold, both in the quality of found solutions, and in the computational effort.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
Notes
Note that the data from that paper had been lost and was replaced by those on the webpage of the authors: https://sites.google.com/site/gciports/premarshalling-problem/bay-generator. These data sets are used in the second group of tests.
References
Bortfeldt A, Forster F (2012) A tree search procedure for the container pre-marshalling problem. Eur J Oper Res 217(3):531–540
Caserta M, Voß S (2009) A corridor method-based algorithm for the pre-marshalling problem. Lect Notes Comput Sci 5484:788–797
Caserta M, Schwarze S, Voß S (2011a) Container rehandling at maritime container terminals. In: Böse J (ed) Handbook of terminal planning, operations research/computer science interfaces series, vol 49. Springer, New York, pp 247–269
Caserta M, Voß S, Sniedovich M (2011b) Applying the corridor method to a blocks relocation problem. OR Spectrum 33:915–929
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
Gupta N, Nau D (1992) On the complexity of blocks-world planning. Artif Intell 56(23):223–254
Huang SH, Lin TH (2012) Heuristic algorithms for container pre-marshalling problems. Comput Ind Eng 62(1):13–20
Jovanovic R, Voß S (2014) A chain heuristic for the blocks relocation problem. Comput Ind Eng 75(1):79–86
Kim K, Hong GP (2006) A heuristic rule for relocating blocks. Comput Oper Res 33(4):940–954
Kim KH (1997) Evaluation of the number of rehandles in container yards. Comput Ind Eng 32:701–711
Lee Y, Chao SL (2009) A neighborhood search heuristic for pre-marshalling export containers. Eur J Oper Res 196(2):468–475
Lee Y, Lee YJ (2010) A heuristic for retrieving containers from a yard. Comput Oper Res 37(6):1139–1147
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
Murty K, Wan YW, Liu J, Tseng M, Leung E, Lai KK, Chiu H (2005) Hongkong international terminals gains elastic capacity using a data-intensive decision support system. Interfaces 35(1):61–75
Rendl A, Prandtstetter M (2013) Constraint models for the container pre-marshaling problem. In: Katsirelos G, Quimper CG (eds) ModRef 2013: 12th international workshop on constraint modelling and reformulation, pp 44–56
Scholl A, Voß S (1996) Simple assembly line balancing—heuristic approaches. J Heuristics 2:217–244
Steenken D, Voß S, Stahlbock R (2004) Container terminal operations and operations research—a classification and literature review. OR Spectrum 26(1):3–49
Tierney K, Pacino D, Voß S (2013) Solving the pre-marshalling problem to optimality with A* and IDA*. Tech. Rep. Technical University of Denmark
Tran NK, Haasis H-D (2014) Empirical analysis of the container liner shipping network on the East-West corridor (1995–2011). Netnomics 15(3):121–153
Ünlüyurt T, Aydin C (2012) Improved rehandling strategies for the container retrieval process. J Adv Transp 46(4):378–393
Voß S (2012) Extended mis-overlay calculation for pre-marshalling containers. Lect Notes Comput Sci 7555:86–91
Wu KC, Ting CJ (2010) A beam search algorithm for minimizing reshuffle operations at container yards. In: Proceedings of the 2010 international conference on logistics and maritime systems. Busan, Korea
Zhang C (2000) Resource planning in container storage yard. PhD thesis, Department of Industrial Engineering, The Hong Kong University of Science and Technology
Acknowledgments
We greatly appreciate the constructive response from three anonymous reviewers regarding our paper which helped to improve its presentation.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Jovanovic, R., Tuba, M. & Voß, S. A multi-heuristic approach for solving the pre-marshalling problem. Cent Eur J Oper Res 25, 1–28 (2017). https://doi.org/10.1007/s10100-015-0410-y
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10100-015-0410-y