A multi-objective evolutionary algorithm for berth allocation in a container port

Please use this identifier to cite or link to this item: https://doi.org/10.1109/CEC.2007.4424569

Title:	A multi-objective evolutionary algorithm for berth allocation in a container port
Authors:	Cheong, C.Y. Lin, C.J. Tan, K.C. Liu, D.K.
Issue Date:	2007
Citation:	Cheong, C.Y., Lin, C.J., Tan, K.C., Liu, D.K. (2007). A multi-objective evolutionary algorithm for berth allocation in a container port. 2007 IEEE Congress on Evolutionary Computation, CEC 2007 : 927-934. ScholarBank@NUS Repository. https://doi.org/10.1109/CEC.2007.4424569
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 make span, number of crossings, and waiting time. These objectives represent the interests of both port and ship operators. 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 a novel solution decoding scheme which is specifically designed to optimize the use of berth space. The MOEA is also able to function in a dynamic context which is of more relevance to a real-world situation. © 2007 IEEE.
Source Title:	2007 IEEE Congress on Evolutionary Computation, CEC 2007
URI:	http://scholarbank.nus.edu.sg/handle/10635/83375
ISBN:	1424413400
DOI:	10.1109/CEC.2007.4424569
Appears in Collections:	Staff Publications

There are no files associated with this item.

Check