Berth scheduling is a critical function at marine container terminals and determining the best berth schedule depends on several factors including the type and function of the port, size of the port, location, nearby competition, and type of contractual agreement between the terminal and the carriers. In this paper we formulate the berth scheduling problem as a bi-objective mixed-integer problem with the objective to maximize customer satisfaction and reliability of the berth schedule under the assumption that vessel handling times are stochastic parameters following a discrete and known probability distribution. A combination of an exact algorithm, a Genetic Algorithms based heuristic and a simulation post-Pareto analysis is proposed as the solution approach to the resulting problem. Based on a number of experiments it is concluded that the proposed berth scheduling policy outperforms the berth scheduling policy where reliability is not considered.
A Simulation Based Approach to Optimize Berth Throughput Under Uncertainty at Marine Container Terminals
2011-03-01
Conference paper
No indication
English
Berth allocation recovery for container transshipment terminals
Taylor & Francis Verlag | 2020
|A lexicographic optimization approach for berth schedule recovery problem in container terminals
British Library Online Contents | 2016
|A lexicographic optimization approach for berth schedule recovery problem in container terminals
DOAJ | 2016
|Developing Higher Berth Productivity: Comparison of Eastern Adriatic Container Terminals
DOAJ | 2019
|