A Dynamic Berth Allocation Problem with Priority Considerations under Stochastic Nature

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