This paper investigates the dynamic ship berth allocation problem for a container handling port, focusing on vessel waiting time at the anchorage due to the unavailability of the berth and quay cranes. A mixed integer linear programming model considering the fuel cost associated with waiting time and operational time of the docked vessel is developed. The hiring of the quay cranes to load/unload the containers from the ship and arrangement of the vessels in different berths is taken into account. Fuel consumed by the vessels while performing their respective port operations is incorporated in the model for addressing the sustainability aspects in berth allocation problem. A chemical reaction optimization algorithm is proposed to solve the problem in a large-scale realistic environment and compared with the results with block-based genetic algorithm, genetic algorithm and particle swarm optimization. The computational experiment illustrates and validates the proposed model on a real case scenario of the port located in India. The case shows that the developed model achieves better utilization of port resources and available berths.
A hybrid dynamic berth allocation planning problem with fuel costs considerations for container terminal port using chemical reaction optimization approach
Ann Oper Res
Annals of Operations Research ; 290 , 1-2 ; 783-811
01.07.2020
29 pages
Aufsatz (Zeitschrift)
Elektronische Ressource
Englisch
The dynamic berth allocation problem for a container port
Online Contents | 2001
|Container Terminal Berth Planning
Transportation Research Record | 2009
|Berth allocation in a container port: using a continuous location space approach
Online Contents | 2005
|