Solving the berth allocation problem with service priority via multi-objective optimization
Cheong, C.Y. Tan, K.C. Liu, D.K.
Cheong, C.Y.
Liu, D.K.
Citations
Altmetric:
Alternative Title
Abstract
This paper studies a multi-objective instance of the berth allocation problem (BAP). The BAP involves the determination of exact berthing times and positions of incoming ships in a container port so as to minimize concurrently the three objectives of makespan of the port, total waiting time of the ships, and degree of deviation from a predetermined service priority schedule. These objectives represent the interests of both port and ship operators. Unlike most existing approaches in the literature which are singleobjective- based, a multi-objective evolutionary algorithm (MOEA) that incorporates the concept of Pareto optimality is proposed for solving the multi-objective BAP. The multiobjective approach reveals several interesting characteristics of the BAP.
Keywords
Source Title
2009 IEEE Symposium on Computational Intelligence in Scheduling, CI-Sched 2009 - Proceedings
Publisher
Series/Report No.
Collections
Rights
Date
2009
DOI
10.1109/SCIS.2009.4927021
Type
Conference Paper