DocumentCode
1589230
Title
A Bee Colony Optimization Algorithm for Traveling Salesman Problem
Author
Wong, Li-Pei ; Low, Malcolm Yoke Hean ; Chong, Chin Soon
Author_Institution
Sch. of Comput. Eng., Nanyang Technol. Univ., Singapore
fYear
2008
Firstpage
818
Lastpage
823
Abstract
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.
Keywords
optimisation; travelling salesman problems; bee colony optimization algorithm; collective intelligence; traveling salesman problem; Approximation algorithms; Asia; Cities and towns; Computational modeling; Computer aided manufacturing; Computer simulation; Costs; Iterative algorithms; Pulp manufacturing; Traveling salesman problems; Bee Colony Optimization; Combinatorial Optimization; Computational Intelligence; Traveling Salesman Problem;
fLanguage
English
Publisher
ieee
Conference_Titel
Modeling & Simulation, 2008. AICMS 08. Second Asia International Conference on
Conference_Location
Kuala Lumpur
Print_ISBN
978-0-7695-3136-6
Electronic_ISBN
978-0-7695-3136-6
Type
conf
DOI
10.1109/AMS.2008.27
Filename
4530581
Link To Document