Bee Colony Optimization - Jobshop Scheduling, Travelling Salesman Problem
Posted on Thursday, January 12, 2006 at 12:23 AM by Malcolm
Bee Colony Optimization
The bee colony optimization algorithm is inspired by the behaviour of a honey bee colony in nectar collection. This biologically inspired approach is currently being employed to solve continuous optimization problems, training neural networks, mechanical and electronical componenets design optimization, combinatorial optimization problems such as job shop scheduling, the internet server optimization problem, the travelling salesman problem, etc.For more information, please refer to:
- Wikipedia: Bee Colony Optimization
-
Li Pei Wong, Chi Yung Puan, Malcolm Yoke Hean Low and Chin Soon Chong.
"Bee Colony Optimization Algorithm with Big Valley Landscape
Exploitation for Job Shop Scheduling Problems". In Proceedings of the
Winter Simulation Conference. 2008 (to appear).
(download
pdf)
-
Li Pei Wong, Malcolm Yoke Hean Low and Chin Soon Chong. "Bee Colony
Optimization with Local Search for Traveling Salesman Problem". In
Proceedings of the 6th IEEE International Conference on Industrial
Informatics (INDIN08), pp. 1019-1025, July 13-16, 2008, Daejeon, Korea.
(download
pdf)
-
Chin Soon Chong, Malcolm Yoke Hean Low, Appa Iyer Sivakumar, Kheng
Leng Gay. "Using A Bee Colony Algorithm for Neighbourhood Search in
Job Shop Scheduling Problems". In Proceedings of the 2007 European
Conference on Modelling and Simulation, pp. 459-465, June 4-6, 2007,
Prague, Czech Republic. (download
pdf)
-
Chong Chin Soon, Malcolm Yoke Hean Low, Appa Iyer Sivakumar and Kheng
Leng Gay. "A Bee Colony Optimization Algorithm to Job Shop
Scheduling". In Proceedings of the 2006 Winter Simulation Conference,
pp. 1954-1961, December 3-6, 2006, Monterey, CA USA. (download
pdf)
Edited on: Friday, September 05, 2008 10:07 AM
