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.
Optimization of the Berth Allocation Problem to the Vessels Using Priority Queuing Systems
Inventory Optimization
2021-08-22
28 pages
Article/Chapter (Book)
Electronic Resource
English
Berth allocation with service priority
Online Contents | 2003
|Berth Allocation and Crane Assignment Problem in Continuous Berth Containers Vessels Terminals
DOAJ | 2022
|Berth allocation with service priority
Elsevier | 2002
|