A multi-objective multi-colony ant algorithm for solving the berth allocation problem

Studies in Computational Intelligence

Volumn 116, Issue , 2008, Pages 333-350

  Cheong, Chun Yew ^a   Tan, Kay Chen ^a  

^a NATIONAL UNIVERSITY OF SINGAPORE   (Singapore)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 44649109639     PISSN: 1860949X     EISSN: None     Source Type: Book Series    
DOI: 10.1007/978-3-540-78297-1_16     Document Type: Article

References (17)

1. A. Imai, X. Sun, E. Nishimura, and S. Papadimitriou, Berth allocation in a container port: Using a continuous location space approach, Transportation Research Part B: Methodological, 39(3), 199-221, 2005.
2. A. Imai, E. Nishimura, and S. Papadimitriou, The dynamic berth allocation problem for a container port, Transportation Research Part B: Methodological, 35(4), 401-417, 2001.
3. A. Imai, E. Nishimura, and S. Papadimitriou, Berth allocation with service priority, Transportation Research Part B: Methodological, 37(5), 437-457, 2003.
4. A. Imai, E. Nishimura, M. Hattori, and S. Papadimitriou, Berth allocation at indented berths for mega-containerships, European Journal of Operational Research, 179(2), 579-593, 2007.
5. Y. Guan, W.-Q. Xiao, R. K. Cheung, and C.-L. Li, A multiprocessor task scheduling model for berth allocation: Heuristic and worst case analysis, Operations Research Letters, 30, 343-350, 2002.
6. K. H. Kim and K. C. Moon, Berth scheduling by simulated annealing, Transportation Research Part B: Methodological, 37(6), 541-560, 2003.
7. Y.-M. Park and K. H. Kim, A scheduling method for berth and quay cranes, OR Spectrum, 25, 1-23, 2003.
8. C.-L. Li, X. Cai, and C.-Y. Lee, Scheduling with multiple-job-on-one-processor pattern, IIE Transactions, 30, 433-445, 1998.
9. A. Lim, The berth planning problem, Operations Research Letters, 22(2-3), 105-110, 1998.
10. K. K. Lai and K. Shih, A study of container berth allocation, Journal of Advanced Transportation, 26, 45-60, 1992.
11. A. Imai, K. Nagaiwa, and W. T. Chan, Efficient planning of berth allocation for container terminals in Asia, Journal of Advanced Transportation, 31, 75-94, 1997.
12. E. Nishimura, A. Imai, and S. Papadimitriou, Berth allocation planning in the public berth system by genetic algorithms, European Journal of Operational Research, 131(2), 282-292, 2001.
13. M. Dorigo, V. Maniezzo, and A. Colorni, Ant system: Optimization by a colony of cooperating agents, IEEE Transactions on Systems, Man, and Cybernetics - Part B: Cybernetics, 26(1), 1996.
14. M. Dorigo and L. M. Gambardella, Ant colony system: A cooperative learning approach to the traveling salesman problem, IEEE Transactions on Evolutionary Computation, 1, 53-66, 1997.
15. C. M. Fonseca, Multiobjective genetic algorithms with application to control engineering problems, Dept. Automatic Control and Systems Eng., University of Sheffield, Sheffield, UK, Ph.D. Thesis, 1995.
16. M. Middendorf, F. Reischle, and H. Schmeck, Information exchange in multi colony ant algorithms, in Proceedings of the Workshop on Bio-Inspired Solutions to Parallel Processing Problems, Cancun, Mexico, Springer Lecture Notes in Computer Science, vol. 1800, pp. 645-652, 2000.
17. L. M. Gambardella and M. Dorigo, Ant-Q: A reinforcement learning approach to the traveling salesman problem, in Proceedings of the 12th International Conference on Machine Learning, pp. 252-260, 1995.