Please use this identifier to cite or link to this item:
|Title:||Solving the berth allocation problem with service priority via multi-objective optimization|
|Citation:||Cheong, C.Y., Tan, K.C., Liu, D.K. (2009). Solving the berth allocation problem with service priority via multi-objective optimization. 2009 IEEE Symposium on Computational Intelligence in Scheduling, CI-Sched 2009 - Proceedings : 95-102. ScholarBank@NUS Repository. https://doi.org/10.1109/SCIS.2009.4927021|
|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.|
|Source Title:||2009 IEEE Symposium on Computational Intelligence in Scheduling, CI-Sched 2009 - Proceedings|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Nov 17, 2018
WEB OF SCIENCETM
checked on Nov 7, 2018
checked on Oct 13, 2018
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.