A combinatorial Artificial Bee Colony algorithm for traveling salesman problem

Traveling Salesman Problem is an important optimization issue of many fields such as transportation, logistics and semiconductor industries and it is about finding a Hamiltonian path with minimum cost. To solve this problem, many researchers have proposed different approaches including metaheuristic methods. Artificial Bee Colony algorithm is a well known swarm based optimization technique. In this paper we propose a new Artificial Bee Colony algorithm called Combinatorial ABC for Traveling Salesman Problem. Simulation results show that this Artificial Bee Colony algorithm can be used for combinatorial optimization problems.

[1]  Dervis Karaboga,et al.  AN IDEA BASED ON HONEY BEE SWARM FOR NUMERICAL OPTIMIZATION , 2005 .

[2]  Bruce L. Golden,et al.  Solving the traveling salesman problem with annealing-based heuristics: a computational study , 2002, IEEE Trans. Syst. Man Cybern. Part A.

[3]  Francisco Herrera,et al.  Analysis of the efficacy of a Two-Stage methodology for ant colony optimization: Case of study with TSP and QAP , 2010, Expert Syst. Appl..

[4]  Mehmet Fatih Tasgetiren,et al.  A discrete artificial bee colony algorithm for the lot-streaming flow shop scheduling problem , 2011, Inf. Sci..

[5]  Costin Badica,et al.  Effectiveness of solving traveling salesman problem using Ant Colony Optimization on distributed multi-agent middleware , 2010, Proceedings of the International Multiconference on Computer Science and Information Technology.

[6]  Dervis Karaboga,et al.  Artificial bee colony algorithm , 2010, Scholarpedia.

[7]  Ning Yang,et al.  An Angle-Based Crossover Tabu Search for the Traveling Salesman Problem , 2007, Third International Conference on Natural Computation (ICNC 2007).

[8]  G. Laporte.  The traveling salesman problem: An overview of exact and approximate algorithms , 1992 .

[9]  Jun Zhang,et al.  A novel discrete particle swarm optimization to solve traveling salesman problem , 2007, 2007 IEEE Congress on Evolutionary Computation.

[10]  Novruz Allahverdi,et al.  Development a new mutation operator to solve the Traveling Salesman Problem by aid of Genetic Algorithms , 2011, Expert Syst. Appl..

[11]  Jyh-Da Wei,et al.  A new approach to the traveling salesman problem using genetic algorithms with priority encoding , 2004, Proceedings of the 2004 Congress on Evolutionary Computation (IEEE Cat. No.04TH8753).

[12]  Yuanxiang Li,et al.  Solving traveling salesman problem by using a local evolutionary algorithm , 2005, 2005 IEEE International Conference on Granular Computing.

[13]  Dervis Karaboga,et al.  A powerful and efficient algorithm for numerical function optimization: artificial bee colony (ABC) algorithm , 2007, J. Glob. Optim..

[14]  Luca Maria Gambardella,et al.  Ant colony system: a cooperative learning approach to the traveling salesman problem , 1997, IEEE Trans. Evol. Comput..

[15]  Yang Yi,et al.  Improved ant colony optimization algorithm for the traveling salesman problems , 2010 .

[16]  Li Liao,et al.  Chaotic Particle Swarm Optimization Algorithm for Traveling Salesman Problem , 2007, 2007 IEEE International Conference on Automation and Logistics.

[17]  Li-Pei Wong,et al.  A Bee Colony Optimization Algorithm for Traveling Salesman Problem , 2008, 2008 Second Asia International Conference on Modelling & Simulation (AMS).

[18]  Bernd Freisleben,et al.  A genetic local search algorithm for solving symmetric and asymmetric traveling salesman problems , 1996, Proceedings of IEEE International Conference on Evolutionary Computation.

[19]  S. X. Yang,et al.  An improved self-organizing map approach to traveling salesman problem , 2003, IEEE International Conference on Robotics, Intelligent Systems and Signal Processing, 2003. Proceedings. 2003.

[20]  Gary G. Yen,et al.  A hybrid evolutionary algorithm for traveling salesman problem , 2004, Proceedings of the 2004 Congress on Evolutionary Computation (IEEE Cat. No.04TH8753).

[21]  Li-Pei Wong,et al.  Bee Colony Optimization with local search for traveling salesman problem , 2008, INDIN 2008.

[22]  Zuren Feng,et al.  A novel Max-Min ant system algorithm for traveling salesman problem , 2009, 2009 IEEE International Conference on Intelligent Computing and Intelligent Systems.

[23]  Sung-Bae Cho,et al.  A Hybrid Cultural Algorithm with Local Search for Traveling Salesman Problem , 2009, 2009 IEEE International Symposium on Computational Intelligence in Robotics and Automation - (CIRA).

[24]  Alok Singh,et al.  An artificial bee colony algorithm for the leaf-constrained minimum spanning tree problem , 2009, Appl. Soft Comput..

[25]  Yi He,et al.  A parallel adaptive tabu search approach for traveling salesman problems , 2005, 2005 International Conference on Natural Language Processing and Knowledge Engineering.

[26]  D. Karaboga,et al.  On the performance of artificial bee colony (ABC) algorithm , 2008, Appl. Soft Comput..