Comparative Study of Artificial Bee Colony Algorithms with Heuristic Swap Operators for Traveling Salesman Problem

  • Zhonghua Li
  • Zijing Zhou
  • Xuedong Sun
  • Dongliang Guo
Part of the Lecture Notes in Computer Science book series (LNCS, volume 7996)


Because the traveling salesman problem (TSP) is one type of classical NP-hard problems, it is not easy to find the optimal tour in polynomial time. Some conventional deterministic methods and exhaustive algorithms are applied to small-scale TSP; whereas, heuristic algorithms are more advantageous for the large-scale TSP. Inspired by the behavior of honey bee swarm, Artificial Bee Colony (ABC) algorithms have been developed as potential optimization approaches and performed well in solving scientific researches and engineering applications. This paper proposes two efficient ABC algorithms with heuristic swap operators (i.e., ABC-HS1 and ABC-HS2) for TSP, which are used to search its better tour solutions. A series of numerical experiments are arranged between the proposed two ABC algorithms and the other three ABC algorithms for TSP. Experimental results demonstrate that ABC-HS1 and ABC-HS2 are both effective and efficient optimization methods.


Artificial Bee Colony Algorithm Heuristic Swap Operator Optimization Traveling Salesman Problem 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Aicardi, M., Giglio, D., Minciardi, R.: Determination of Optimal Control Strategies for TSP by Dynamic Programming. In: 47th IEEE Conference on Decision and Control, pp. 2160–2167. IEEE Press, Piscataway (2008)Google Scholar
  2. 2.
    Lopez, M.R., Tunon, M.I.C.: Design and Use of the CPAN Branch & Bound for the Solu-tion of the Travelling Salesman Problem (TSP). In: 15th International Conference on Electronics, Communications and Computers, pp. 262–267. IEEE Press, United States (2005)Google Scholar
  3. 3.
    Kahng, A.B., Reda, S.: Match Twice and Stitch: A New TSP Tour Construction Heuristic. Operations Research Letters 32(6), 499–509 (2004)MathSciNetzbMATHCrossRefGoogle Scholar
  4. 4.
    Albayrak, M., Allahverdi, N.: Development A New Mutation Operator to Solve the Traveling Salesman Problem by Aid of Genetic Algorithms. Expert Systems with Applications 38(3), 1313–1320 (2011)CrossRefGoogle Scholar
  5. 5.
    Geng, X., Chen, Z., Yang, W., Shi, D., Zhao, K.: Solving the Traveling Salesman Problem Based on an Adaptive Simulated Annealing Algorithm with Greedy Search. Applied Soft Computing 11(4), 3680–3689 (2011)CrossRefGoogle Scholar
  6. 6.
    Zhao, J., Liu, Q., Wang, W., Wei, Z., Shi, P.: A Parallel Immune Algorithm for Traveling Salesman Problem and Its Application on Cold Rolling Scheduling. Information Sciences 181(7), 1212–1223 (2011)CrossRefGoogle Scholar
  7. 7.
    Saadatmand-Tarzjan, M., Khademi, M., Akbarzadeh-T, M., Abrishami, M.H.: A Novel Constructive-Optimizer Neural Network for the Traveling Salesman Problem. IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics 37(4), 754–770 (2007)CrossRefGoogle Scholar
  8. 8.
    Lu, J., Fang, N., Shao, D., Liu, C.: An Improved Immune-Genetic Algorithm for the Traveling Salesman Problem. In: 3rd International Conference on Natural Computation, pp. 297–301. IEEE Press, Piscataway (2007)Google Scholar
  9. 9.
    Vahdati, G., Ghouchani, S.Y., Yaghoobi, M.: A Hybrid Search Algorithm with Hopfield Neural Network and Genetic algorithm for Solving Traveling Salesman Problem. In: 2nd International Conference on Computer and Automation Engineering, pp. 435–439. IEEE Press, Piscataway (2010)Google Scholar
  10. 10.
    Banharnsakun, A., Achalakul, T., Sirinaovakul, B.: ABC-GSX: A Hybrid Method for Solving the Traveling Salesman Problem. In: 2nd World Congress on Nature and Biologically Inspired Computing, pp. 7–12. IEEE Press, Piscataway (2010)Google Scholar
  11. 11.
    Kıran, M.S., İşcan, H., Gündüz, M.: The Analysis of Discrete Artificial Bee Colony Algorithm with Neighborhood Operator on Traveling Salesman Problem. In: Neural Computing & Applications, pp. 1–13. Springer, London (2012) (in press)Google Scholar
  12. 12.
    Karaboga, D., Gorkemli, B.: A Combinatorial Artificial Bee Colony Algorithm for Traveling Salesman Problem. In: 2011 International Symposium on Innovations in Intelligent Systems and Applications, pp. 50–53. IEEE Press, Piscataway (2011)CrossRefGoogle Scholar
  13. 13.
    Li, G., Niu, P., Xiao, X.: Development and Investigation of Efficient Artificial Bee Colony Algorithm for Numerical Function Optimization. Applied Soft Computing 12(1), 320–332 (2012)CrossRefGoogle Scholar
  14. 14.
    Su, Z., Wang, P., Shen, J., Li, Y., Zhang, Y., Hu, E.: Automatic Fuzzy Partitioning Approach Using Variable String Length Artificial Bee Colony (VABC) Algorithm. Applied Soft Computing 12(11), 3421–3441 (2012)CrossRefGoogle Scholar
  15. 15.
    Kashan, M.H., Nahavandi, N., Kashan, A.H.: DisABC: A New Artificial Bee Colony Algorithm for Binary Optimization. Applied Soft Computing 12(1), 342–352 (2012)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2013

Authors and Affiliations

  • Zhonghua Li
    • 1
  • Zijing Zhou
    • 1
    • 2
  • Xuedong Sun
    • 3
  • Dongliang Guo
    • 1
  1. 1.School of Information Science and TechnologySun Yat-sen UniversityGuangzhouChina
  2. 2.Department of Information TechnologyChina Guangfa BankGuangzhouChina
  3. 3.School of SoftwareSun Yat-sen UniversityGuangzhouChina

Personalised recommendations