Abstract
In this paper, a new discrete artificial bee colony algorithm is used to solve the symmetric traveling salesman problem (TSP). The concept of Swap Operator has been introduced to the original artificial bee colony (ABC) algorithm which can help the bees to generate a better candidate tour by greedy selection. By taken six typical TSP instances as examples, the proposed algorithm is compared with particle swarm optimization (PSO) algorithm to validate its performance. In the experimental study, we also analysis the important parameters in the artificial bee colony algorithm and their influence have been verified. © 2012 Springer-Verlag.
Author supplied keywords
Cite
CITATION STYLE
Li, L., Cheng, Y., Tan, L., & Niu, B. (2011). A discrete artificial bee colony algorithm for TSP problem. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6840 LNBI, pp. 566–573). https://doi.org/10.1007/978-3-642-24553-4_75
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
