Please use this identifier to cite or link to this item:
|Title:||Multi-objective and prioritized berth allocation in container ports||Authors:||Cheong, C.Y.
|Keywords:||Berth allocation problem
|Issue Date:||2010||Citation:||Cheong, C.Y., Tan, K.C., Liu, D.K., Lin, C.J. (2010). Multi-objective and prioritized berth allocation in container ports. Annals of Operations Research 180 (1) : 63-103. ScholarBank@NUS Repository. https://doi.org/10.1007/s10479-008-0493-0||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. © 2008 Springer Science+Business Media, LLC.||Source Title:||Annals of Operations Research||URI:||http://scholarbank.nus.edu.sg/handle/10635/82732||ISSN:||02545330||DOI:||10.1007/s10479-008-0493-0|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.