Jump to content

Bee colony optimization: Difference between revisions

From Wikipedia, the free encyclopedia
Content deleted Content added
Wonglipei (talk | contribs)
Wonglipei (talk | contribs)
Line 17: Line 17:


== Publications (Selected) ==
== Publications (Selected) ==
*Nakrani, S. and C. Tovey, "''On Honey Bees and Dynamic Allocation in an Internet Server Colony''". Adaptive Behaviour, 2004. 12(3-4):pp.223-240.
*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.


== External Links/Sources ==
== External Links/Sources ==

Revision as of 11:04, 12 February 2007

The bee colony optimization algorithm is inspired by the behaviour of honey bee colony in nectar collection. This biologically inspired approach is currently being employed to solve some combinatorial optimization problems such as job shop scheduling, internet server optimization problem and etc.


Overview

See Also

Publications (Selected)

  • Nakrani, S. and C. Tovey, "On Honey Bees and Dynamic Allocation in an Internet Server Colony". Adaptive Behaviour, 2004. 12(3-4):pp.223-240.
  • 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.

External Links/Sources