Abstract
The container relocation problem (CRP) is concerned with clearing out a single yard-bay which contains a fixed number of containers each following a given pickup order so as to minimize the total number of relocations made during their retrieval process. In this work, we consider an extension of the CRP where containers are both received and retrieved at a single yard-bay named Dynamic Container Relocation Problem (DCRP). The arrival and departure sequences of containers are assumed to be known in advance. A tabu search based heuristic approach is proposed to solve the DCRP. Computational experiments are performed on an extensive set of randomly generated test instances from the literature. Our results show that the proposed algorithm is efficient and yields promising outcomes.
This is a preview of subscription content, log in via an institution to check access.
References
Akyüz, M.H., Lee, C.: A mathematical formulation and efficient heuristics for the dynamic container relocation problem. Nav. Res. Log. 61, 101–118 (2014)
Caserta, M., Schwarze, S., Voss, S.: A mathematical formulation and complexity considerations for the blocks relocation problem. Eur. J. Oper. Res. 219, 96–104 (2012)
Glover, F., Laguna, M.: Tabu search. Kluwer academic publishers, Boston (1997)
Jin, B., Zhu, W., Lim, A.: Solving the container relocation problem by an improved greedy look-ahead heuristic. Eur. J. Oper. Res. 240, 837–847 (2015)
Jovanovic, R., Voss, S.: A chain heuristic for the blocks relocation problem. Comput. Ind. Eng. 75, 79–86 (2014)
Kim, K.H., Hong, G.P.: A heuristic rule for relocating blocks. Comput. Oper. Res. 33, 940–954 (2006)
Lehnfeld, J., Knust, S.: Loading, unloading and premarshalling of stacks in storage areas: survey and classification. Eur. J. Oper. Res. 239, 297–312 (2014)
Murty, K., Liu, J., Wan, Y., et al.: A decision support system for operations in a container terminal. Decis. Support. Syst. 39, 309–332 (2005)
Petering, M.E.H., Hussein, M.I.: A new mixed integer program and extended look-ahead heuristic algorithm for the block relocation problem. Eur. J. Oper. Res. 231, 120–130 (2013)
Stahlbock, R., Voss, S.: Operations research at container terminals: a literature update. OR Spectr. 30, 1–52 (2008)
UNCTAD (2014) Review of Maritime Transportation 2014. Paper presented at the United Nations Conference on Trade and Development, New York and Geneva. http://unctad.org/en/PublicationsLibrary/rmt2014_en.pdf. Cited 28 June 2015
Wan, Y., Liu, J., Tsai, P.: The assignment of storage locations to containers for a container stack. Nav. Res. Log. 56, 699–713 (2009)
Acknowledgements
This research is supported by the Turkish Scientific and Technological Research Council (TÜBİTAK) Research Grant no: 214M222, and Galatasaray University Scientific Research Project Grant no: 13.402.010.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2017 Springer International Publishing Switzerland
About this paper
Cite this paper
Karpuzoğlu, O., Akyüz, M.H., Öncan, T. (2017). A Tabu Search Based Heuristic Approach for the Dynamic Container Relocation Problem. In: Dörner, K., Ljubic, I., Pflug, G., Tragler, G. (eds) Operations Research Proceedings 2015. Operations Research Proceedings. Springer, Cham. https://doi.org/10.1007/978-3-319-42902-1_22
Download citation
DOI: https://doi.org/10.1007/978-3-319-42902-1_22
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-42901-4
Online ISBN: 978-3-319-42902-1
eBook Packages: Business and ManagementBusiness and Management (R0)