Abstract This paper considers a berth allocation problem (BAP) which requires the determination of exact berthing times and positions of incoming ships in a container port. The problem is solved by optimizing the berth schedule so as to minimize concurrently the three objectives of makespan, waiting time, and degree of deviation from a predetermined priority schedule. These objectives represent the interests of both port and ship operators. Unlike most existing approaches in the literature which are single-objective-based, a multi-objective evolutionary algorithm (MOEA) that incorporates the concept of Pareto optimality is proposed for solving the multi-objective BAP. The MOEA is equipped with three primary features which are specifically designed to target the optimization of the three objectives. The features include a local search heuristic, a hybrid solution decoding scheme, and an optimal berth insertion procedure. The effects that each of these features has on the quality of berth schedules are studied.
Multi-objective and prioritized berth allocation in container ports
Annals of Operations Research ; 180 , 1 ; 63-103
2008-12-13
41 pages
Article (Journal)
Electronic Resource
English
A Multi-Objective Approach in the Berth Allocation Planning
British Library Conference Proceedings | 1994
|Berth allocation recovery for container transshipment terminals
Taylor & Francis Verlag | 2020
|The dynamic berth allocation problem for a container port
Online Contents | 2001
|