Abstract
Quay cranes are the most important equipment in port container terminals, because they are directly related to the wharf productivity. This study proposes a heuristic search algorithm, called greedy randomized adaptive search procedure (GRASP), for constructing a schedule of quay cranes in a way of minimizing the makespan and considering interference among yard cranes. The performance of the heuristic algorithm was tested by a numerical experiment.
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
Daganzo, C.F.: The Crane Scheduling Problem. Transportation Research 23B, 159–175 (1989)
Feo, T.A., Resende, M.G.C.: Greedy Randomized Adaptive Search Procedures. Journal of Global Optimization 6, 109–133 (1995)
Kim, K.H., Park, Y.M.: A Crane Scheduling Method for Port Container Terminals. European Journal of Operational Research 156, 752–768 (2004)
Peterkofsky, R.I., Daganzo, C.F.: A Branch and Bound Solution Method for the Crane Scheduling Problem. Transportation Research 24B, 159–172 (1990)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Jung, D.H., Park, YM., Lee, B.K., Kim, K.H., Ryu, K.R. (2006). A Quay Crane Scheduling Method Considering Interference of Yard Cranes in Container Terminals. In: Gelbukh, A., Reyes-Garcia, C.A. (eds) MICAI 2006: Advances in Artificial Intelligence. MICAI 2006. Lecture Notes in Computer Science(), vol 4293. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11925231_43
Download citation
DOI: https://doi.org/10.1007/11925231_43
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-49026-5
Online ISBN: 978-3-540-49058-6
eBook Packages: Computer ScienceComputer Science (R0)