loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
2008 Second Asia International Conference on Modelling & Simulation
A Bee Colony Optimization Algorithm for Traveling Salesman Problem
May 13-May 15
ISBN: 978-0-7695-3136-6
ASCII Text
x 
 
Li-Pei Wong, Malcolm Yoke Hean Low, Chin Soon Chong, "A Bee Colony Optimization Algorithm for Traveling Salesman Problem," Asia International Conference on Modelling & Simulation, pp. 818-823, 2008 Second Asia International Conference on Modelling & Simulation, 2008.
 
 
BibTex
x
 
@article{ 10.1109/AMS.2008.27,
author = {Li-Pei Wong and Malcolm Yoke Hean Low and Chin Soon Chong},
title = {A Bee Colony Optimization Algorithm for Traveling Salesman Problem},
journal ={Asia International Conference on Modelling & Simulation},
volume = {0},
year = {2008},
isbn = {978-0-7695-3136-6},
pages = {818-823},
doi = {http://doi.ieeecomputersociety.org/10.1109/AMS.2008.27},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
}
 
 
RefWorks Procite/RefMan/Endnote
x 
 
TY - CONF
JO - Asia International Conference on Modelling & Simulation
TI - A Bee Colony Optimization Algorithm for Traveling Salesman Problem
SN - 978-0-7695-3136-6
SP818
EP823
A1 - Li-Pei Wong,
A1 - Malcolm Yoke Hean Low,
A1 - Chin Soon Chong,
PY - 2008
KW - Bee Colony Optimization
KW - Traveling Salesman Problem
KW - Computational Intelligence
KW - Combinatorial Optimization
VL - 0
JA - Asia International Conference on Modelling & Simulation
ER -
 
A Bee Colony Optimization (BCO) algorithm for Traveling Salesman Problem (TSP) is presented in this paper. TSP is a problem of finding a shortest closed tour which visits all the cities in a given set. The BCO model is constructed algorithmically based on the collective intelligence shown in bee foraging behaviour. This method uses a natural metaphor in making it as a optimization algorithm. Bees of an artificial colony are able to construct consecutively feasible tours by using information expressed in waggle dances. Experimental results comparing the proposed BCO model with some existing approaches on a set of benchmark problems are presented.
Index Terms:
Bee Colony Optimization, Traveling Salesman Problem, Computational Intelligence, Combinatorial Optimization
Citation:
Li-Pei Wong, Malcolm Yoke Hean Low, Chin Soon Chong, "A Bee Colony Optimization Algorithm for Traveling Salesman Problem," ams, pp.818-823, 2008 Second Asia International Conference on Modelling & Simulation, 2008
Usage of this product signifies your acceptance of the Terms of Use.