A Bee Colony Optimization Algorithm for Traveling Salesman Problem

  title={A Bee Colony Optimization Algorithm for Traveling Salesman Problem},
  author={Li-Pei Wong and Malcolm Yoke-Hean Low and Chin Soon Chong},
  journal={2008 Second Asia International Conference on Modelling & Simulation (AMS)},
A bee colony optimization (BCO) algorithm for traveling salesman problem (TSP) is presented in this paper. The BCO model is constructed algorithmically based on the collective intelligence shown in bee foraging behaviour. Experimental results comparing the proposed BCO model with some existing approaches on a set of benchmark problems are presented. 
Highly Cited
This paper has 90 citations. REVIEW CITATIONS


Publications citing this paper.
Showing 1-10 of 61 extracted citations

90 Citations

Citations per Year
Semantic Scholar estimates that this publication has 90 citations based on the available data.

See our FAQ for additional information.


Publications referenced by this paper.
Showing 1-10 of 23 references

Vanlaarhoven, "A quantitative analysis of the simulated annealing algorithm - A case study for the traveling salesman problem,

  • E.H.L. Aarts, J.H.M. Korst, M P.J.
  • Journal of Statistical Physics,
  • 1988
Highly Influential
2 Excerpts

Similar Papers

Loading similar papers…