Please use this identifier to cite or link to this item:
|Title:||A multi-objective multi-colony ant algorithm for solving the berth allocation problem|
|Source:||Cheong, C.Y.,Tan, K.C. (2008). A multi-objective multi-colony ant algorithm for solving the berth allocation problem. Studies in Computational Intelligence 116 : 333-350. ScholarBank@NUS Repository. https://doi.org/10.1007/978-3-540-78297-1_16|
|Abstract:||This paper considers the allocation of a fixed number of berths to a number of ships arriving at the port within the planning horizon for container handling by determining the berthing time and location, in terms of berth index, for each ship. The solution to this berth allocation problem (BAP) involves the optimization of complete schedules with minimum service time and delay in the departure of ships, subject to a number of temporal and spatial constraints. To solve such a multi-objective and multi-modal combinatorial optimization problem, this paper presents a multi-objective multi-colony ant algorithm (MOMCAA) which uses an island model with heterogeneous colonies. Each colony may be different from the other colonies in terms of the combination of pheromone matrix and visibility heuristic used. In contrast to conventional ant colony optimization (ACO) algorithms where each ant in the colony searches for a single solution, the MOMCAA uses an ant group to search for each candidate solution. Each ant in the group is responsible for the schedule of a particular berth in the solution. © 2008 Springer-Verlag Berlin Heidelberg.|
|Source Title:||Studies in Computational Intelligence|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Dec 13, 2017
checked on Dec 8, 2017
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.