Abstract
In this paper, we study the problem of assignment of suitable berths to the vessels under different scenarios of vessel berthing policies, priorities and vessel serving or container handling-off. The problem was solved as a queuing system with non-preemptive priority. The objective was to maximize the utilization of the berth under different service levels. Different scenarios for berthing process of vessels and unloading of containers at the container terminal were considered to evaluate the performance of the system and to obtain the optimal service level parameters. The model considered a system in which different types of containers were managed together in an integrated manner. The steady-state behaviours of the expected waiting time, queue length, server utilization rate and the optimal number of servers necessary to attain given service levels for the different container types were studied experimentally under different conditions of arrival and service rates.
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
References
Abdorreza, S., Ilati, G., & Hassannayebi, E. (2013). A simulation model for the problem in integrated berth allocation and quay crane assignment. Journal of Basic and Applied Scientific Research, 3(8), 343–354.
Akio, I., Sun, X., Nishimura, E., & Papadimitriou, S. (2005). Berth allocation in a container port: Using a continuous location space approach. Transportation Research Part B, 39, 199–221.
Akio, I., Chen, H. S., Nishimura, E., & Papadimitriou, S. (2008). The simultaneous berth and quay crane allocation problem. Transportation Research Part E, 44, 900–920.
Boile, M., Sotirios, T., & Mihalis, G. (2006). Berth allocation with service priorities: A linear reformulation. In Proceedings of the 5th WSEAS Int. Conf. on System Science and Simulation in Engineering, Tenerife, Canary Islands, Spain, December 16–18 (pp 72–77).
Dai, J., Wuqin, L., Rajeeva, M., & Chung-Piaw, T. (2004) Berth allocation planning optimization in container terminal. National University of Singapore Academic Research Grant R-314–000–030–112.
Golias Mihalis, M., Georgios, K. S., Maria, B., Sotirios, T., & Marianthi, G. I. The berth allocation problem: Optimizing vessel arrival time. Maritime Economics & Logistics, 11(4), 358–377.
Hendriks, M. P. M., Lefeber, E., & Udding, J. T. (2012). Simultaneous berth allocation and yard planning at tactical level. Or Spectrum, 2013(35), 441–456. https://doi.org/10.1007/s00291-012-0305-4 Publishedonline:9September2012,©Springer-Verlag.
Hwan, K., Kyung, C. M. (2003) Berth scheduling by simulated annealing. Transportation Research Part B, 37, 541–560
Javanshir, H., & Seyed-Alizadeh Ganji, S. R. (2010). Optimal allocation of ships to quay length in container ports. Journal of Industrial and Systems Engineering, 3(4), 275–290.
Krčum, M., Gudelj, A., & Vlahinić, S. (2007). Genetic Algorithm for Solving Berth and Quay Cranes Assignment problems. In 2nd International Conference on Ports and Waterways (pp. 165-177), supported by the Ministry of Science, Education and Sports of the Republic of Croatia.
Ma, H. L., Chan, F. T. S., Chung, S. H., & Wong, C. S. (2012, July). Berth allocation planning for improving container terminal performances. In Proceedings of the International Conference on Industrial Engineering and Operations Management Istanbul, Turkey, July 3–6, 2012 (pp. 502–508).
Rajeeva, M., & Teo, C.-P. (2006). Berth management in container terminal: The template design problem. Or Spectrum, 28(4), 495–518.
Shan, T. (2012) Genetic algorithm for dynamic berth allocation problem with discrete layout. In The 2nd International Conference on Computer Application and System Modeling (2012) (261–264). Atlantis Press.
Theofanis, S., Maria, B., & Mihalis, G. (2007) An optimization based genetic algorithm Heuristic for the berth allocation problem. In 2007 IEEE Congress on Evolutionary Computation (CEC 2007) (pp 4439–4445).
Zeng, Q., Xiangpei, H., Wen, J. Wang, & Yan, F. (2011) Disruption management model and its algorithms for berth allocation problem in container terminals. International Journal of Innovative Computing, Information and Control, 7(5(B)), 2763–2773.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2021 The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd.
About this chapter
Cite this chapter
Yadavalli, V.S.S., Adetunji, O., Alrikabi, R. (2021). Optimization of the Berth Allocation Problem to the Vessels Using Priority Queuing Systems. In: Shah, N.H., Mittal, M. (eds) Soft Computing in Inventory Management. Inventory Optimization. Springer, Singapore. https://doi.org/10.1007/978-981-16-2156-7_3
Download citation
DOI: https://doi.org/10.1007/978-981-16-2156-7_3
Published:
Publisher Name: Springer, Singapore
Print ISBN: 978-981-16-2155-0
Online ISBN: 978-981-16-2156-7
eBook Packages: Business and ManagementBusiness and Management (R0)