Abstract
To ease the situation and to ensure a high performance of ship, train and truck operations at container terminals, containers sometimes are pre-stowed near to the loading place and in such an order that it fits the loading sequence. This is done after the stowage plan is finished and before ship loading starts. Such a problem may be referred to as pre-marshalling. Motivated by most recent publications on this problem we describe a metaheuristic approach which is able to solve this type of problem. The approach utilizes the paradigm of the corridor method.
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
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Sniedovich, M., Voß, S.: The Corridor Method: a Dynamic Programming Inspired Metaheuristic. Control and Cybernetics 35(3), 551–578 (2006)
Ergun, Ö., Orlin, J.B.: A dynamic programming methodology in very large scale neighborhood search applied to the traveling salesman problem. Discrete Optimization 3, 78–85 (2006)
Potts, C., van de Velde, S.: Dynasearch - iterative local improvement by dynamic programming. Technical report, University of Twente (1995)
Steenken, D., Voß, S., Stahlbock, R.: Container terminal operations and operations research – a classification and literature review. OR Spectrum 26, 3–49 (2004)
Stahlbock, R., Voß, S.: Operations research at container terminals: a literature update. OR Spectrum 30, 1–52 (2008)
Lee, Y., Chao, S.-L.: A Neighborhood Search Heuristic for Pre-marshalling Export Containers. European Journal of Operational Research (2008), doi:10.1016/j.ejor.2008.03.011
Lee, Y., Hsu, N.Y.: An optimization model for the container pre-marshalling problem. Computers & Operations Research 34, 3295–3313 (2007)
Hart, J.P., Shogan, A.W.: Semi-greedy heuristics: An empirical study. Operations Research Letters 6, 107–114 (1987)
Festa, P., Resende, M.G.C.: An annotated bibliography of GRASP. Technical report, AT&T Labs Research (2004)
Binato, S., Hery, W.J., Loewenstern, D., Resende, M.G.C.: A greedy randomized adaptive search procedure for job shop scheduling. In: Ribeiro, C.C., Hansen, P. (eds.) Essays and surveys in metaheuristics, pp. 58–79. Kluwer Academic Publishers, Boston (2002)
Prais, M., Ribeiro, C.C.: Reactive GRASP: An application to a matrix decomposition problem in TDMA traffic assignment. INFORMS Journal on Computing 12, 164–176 (2000)
Goldberg, D.E.: Genetic Algorithms in Search, Optimization, and Machine Learning. Addison-Wesley, Reading (1989)
Kim, K.H., Hong, G.P.: A heuristic rule for relocating blocks. Computers & Operations Research 33, 940–954 (2006)
Caserta, M., Voß, S., Sniedovich, M.: An algorithm for the blocks relocation problem. Working Paper, Institute of Information Systems, University of Hamburg (2008)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Caserta, M., Voß, S. (2009). A Corridor Method-Based Algorithm for the Pre-marshalling Problem. In: Giacobini, M., et al. Applications of Evolutionary Computing. EvoWorkshops 2009. Lecture Notes in Computer Science, vol 5484. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-01129-0_89
Download citation
DOI: https://doi.org/10.1007/978-3-642-01129-0_89
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-01128-3
Online ISBN: 978-3-642-01129-0
eBook Packages: Computer ScienceComputer Science (R0)