Multi-objective and prioritized berth allocation in container ports
Research output: Journal Publications and Reviews (RGC: 21, 22, 62) › 21_Publication in refereed journal › peer-review
Author(s)
Detail(s)
Original language | English |
---|---|
Pages (from-to) | 63-103 |
Journal / Publication | Annals of Operations Research |
Volume | 180 |
Issue number | 1 |
Online published | 13 Dec 2008 |
Publication status | Published - Nov 2010 |
Externally published | Yes |
Link(s)
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.
Research Area(s)
- Berth allocation problem, Combinatorial problems, Evolutionary algorithms, Multi-objective optimization
Citation Format(s)
Multi-objective and prioritized berth allocation in container ports. / Cheong, C.Y.; Tan, K.C.; Liu, D.K. et al.
In: Annals of Operations Research, Vol. 180, No. 1, 11.2010, p. 63-103.Research output: Journal Publications and Reviews (RGC: 21, 22, 62) › 21_Publication in refereed journal › peer-review