Abstract
Stochastic nature of vessel arrivals and handling times adds to the complexity of the well-known NP-hard berth allocation problem. To aid real decision-making under customer differentiations, a dynamic stochastic model designed to reflect different levels of vessel priorities is put forward. For exponential interarrival and handling times, a recursive procedure to calculate the objective function value is proposed. To reveal the characteristics of the model, numerical experiments based on heuristic approaches are conducted. Solution procedures based on artificial bee colony and genetic algorithms, covering both global and local search features, are launched to improve the solution quality. The practical inferences led by these approaches are shown to be helpful for container terminals faced with multifaceted priority considerations.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Stahlbock, R., Steenken, S.V.: Operations Research at Container Terminals: A Literature update. OR Spectrum 30, 1–52 (2008)
Bierwirth, C., Meisel, F.: A Survey of Berth Allocation and Quay Crane Scheduling Problems in Container Terminals. European J. Oper. Res. 202, 615–627 (2010)
Golias, M., Boile, M., Theofanis, S.: The Stochastic Berth Allocation Problem. In: Proceedings of the International Conference on Transport Science and Technology (TRANSTEC 2007), pp. 52–66. Czech Technical University, Prague (2007)
Zhou, P., Kang, H., Lin, L.: A Dynamic Berth Allocation Model Based on Stochastic Consideration. In: Proceedings of the Sixth World Congress on Intelligent Control and Automation (WCICA 2006), vol. 2, pp. 7297–7301. IEEE, Washington DC (2006)
Du, Y.q., Xu, Y., Chen, Q.S.: A Feedback Rocedure for Robust Berth Allocation with Stochastic Vessel Delays. In: Proceedings of the 8th World Congress on Intelligent Control and Automation, Jinan, China, July 6-9 (2010)
Moorthy, R., Teo, C.: Berth Management in Container Terminal. The Template Design Problem. OR Spectrum 28, 495–518 (2006)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Guldogan, E.U., Bulut, O., Tasgetiren, M.F. (2012). A Dynamic Berth Allocation Problem with Priority Considerations under Stochastic Nature. In: Huang, DS., Gan, Y., Gupta, P., Gromiha, M.M. (eds) Advanced Intelligent Computing Theories and Applications. With Aspects of Artificial Intelligence. ICIC 2011. Lecture Notes in Computer Science(), vol 6839. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-25944-9_10
Download citation
DOI: https://doi.org/10.1007/978-3-642-25944-9_10
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-25943-2
Online ISBN: 978-3-642-25944-9
eBook Packages: Computer ScienceComputer Science (R0)