Meta-heuristic Hybrid Algorithmic Approach for Solving Combinatorial Optimization Problem (TSP)

Conference paper
Part of the Communications in Computer and Information Science book series (CCIS, volume 1159)


Solving and optimizing combinatorial problems require high computational power because of their exponential growth and requirement of high processing power. During this study, a hybrid algorithm (Genetic Ant Colony Optimization Algorithm) is proposed in comparison with standard algorithm (Ant Colony Optimization Algorithm). Further the parameters for Ant Colony Optimization Algorithm are instinctively tuned to different levels of all heuristics to obtain suboptimal level, then multiple crossovers and mutation operators are used alongside those selected parameters while generating results with hybrid algorithm. The main emphasis of the proposed algorithm is the selection and tuning of parameters, which is extremely influential in this case. The algorithm has been tested on six benchmarks of TSPLIB. The results were compared with standard ACO algorithm, the hybrid algorithm outperformed the standard ACO algorithm.


Ant Colony Algorithm (ACO) Genetic Algorithm (GA) Traveling Salesman Problem (TSP) Heuristics Meta-heuristics Optimization 



This work is supported by the National Natural Science Foundation of China (61922072, 61876169, 61673404, 61976237).


  1. 1.
    Ilavarasi, K., Joseph, K.: Variants of travelling salesman problem: a survey. In: International Conference on Information Communication and Embedded Systems, ICICES 2014 (2014)Google Scholar
  2. 2.
    David, A., William, C.: The Traveling Salesman Problem: A Computational Study. Princeton Series in Applied Mathematics, pp. 1–5, 12–17. Princeton University Press, Princeton (2007)Google Scholar
  3. 3.
    Malik, M., Iqbal, A.: Heuristic approaches to solve traveling salesman. TELKOMNIKA Indones. J. Electr. Eng. 15(2), 390–396 (2015) Google Scholar
  4. 4.
    CO@W: History of the TSP. The Traveling Salesman Problem. Georgia Tech, October 2009.
  5. 5.
    Amanur, R.: The Traveling Salesman problem, Indiana State University USA, 11 April 2012Google Scholar
  6. 6.
    Sureja, N., Chawda, B.: Random travelling salesman problem using SA. Int. J. Emerg. Technol. Adv. Eng. 2(3), 621–624 (2012)Google Scholar
  7. 7.
    Wang, S., Zhao, A.: An improved hybrid genetic algorithm for traveling salesman problem. In: IEEE Proceedings of the International Conference on Computational Intelligence and Software Engineering (2009)Google Scholar
  8. 8.
    Nagata, Y., Kobayashi, S.: A powerful genetic algorithm using edge assembly crossover for the traveling salesman problem. INFORMS J. Comput. 25(2), 346–363 (2013)MathSciNetCrossRefGoogle Scholar
  9. 9.
    Tian, P., Yang, Z.: An improved simulated annealing algorithm with genetic characteristics and the traveling salesman problem. J. Inf. Optimiz. Sci. 14(3), 241–255 (2013)MathSciNetzbMATHGoogle Scholar
  10. 10.
    Birattari, M., Pellegrini, P., Dorigo, M.: On the invariance of ant colony optimization. IEEE Trans. Evol. Comput. 11(6), 732–742 (2008)CrossRefGoogle Scholar
  11. 11.
    Lizárraga, E., Castillo, O., Soria, J.: A method to solve the traveling salesman problem using ant colony optimization variants with ant set partitioning. Stud. Comput. Intell. 451(1), 237–246 (2013)Google Scholar
  12. 12.
    Ho, J., Shih, H., Liao, B., Chu, S.: A ladder diffusion algorithm using ant colony optimization for wireless sensor networks. Inf. Sci. 192(6), 204–212 (2012)CrossRefGoogle Scholar
  13. 13.
    Xiao, J., Ao, X., Tang, Y.: Solving software project scheduling problems with ant colony optimization. Comput. Oper. Res. 40(1), 33–46 (2013)MathSciNetCrossRefGoogle Scholar
  14. 14.
    Nothegger, C., Mayer, A., Chwatal, A., Raidl, G.: Solving the post enrolment course timetabling problem by ant colony optimization. Ann. Oper. Res. 194(1), 325–339 (2012)MathSciNetCrossRefGoogle Scholar
  15. 15.
    Yoo, K., Han, S.: A modified ant colony optimization algorithm for dynamic topology optimization. Comput. Struct. 123(4), 68–78 (2013) CrossRefGoogle Scholar
  16. 16.
    Yang, X., Wang, J.: Application of improved ant colony optimization algorithm on traveling salesman problem. In: IEEE 2017 International Conference on Robotics and Automation Sciences (ICRAS) (2017)Google Scholar
  17. 17.
    Muhammad, K., Gao, S.: Comparative analysis of meta-heuristic algorithms for solving optimization problems. In: Advances in Intelligent Systems Research, volume 163, Proceedings of the 2018 8th International on Management, Education and Information, MEICI 2018 (2018)Google Scholar
  18. 18.
    Deng, Y., Liu, Y., Zhou, D.: An improved genetic algorithm with initial population strategy for symmetric TSP. Math. Probl. Eng. 2015(3), 1–6 (2015)Google Scholar
  19. 19.
    Luo, Y., Lu, B., Liu, F.: Neighbor field method for population initialization of TSP. J. Chongqing Univ. 32(11), 1311–1315 (2009)Google Scholar
  20. 20.
    Hassanat, A., Alkafaween, E.: On enhancing genetic algorithms using new crossovers. Int. J. Comput. Appl. Technol. 55(3), 202–212 (2017)CrossRefGoogle Scholar
  21. 21.
    Noraini, M., John, G.: Genetic algorithm performance with different selection strategies in solving TSP. In: Proceedings of the World Congress on Engineering, WCE 2011, vol. 2, pp. 1134–1139 (2011)Google Scholar
  22. 22.
    Serpell, M., Smith, J.: Self-adaptation of mutation operator and probability for permutation representations in genetic algorithms. Evol. Comput. 18(3), 491–514 (2010)CrossRefGoogle Scholar
  23. 23.
    Liu, J., Li, W.: Greedy permuting method for genetic algorithm on travelling salesman problem. In: IEEE 8th International Conference on Electronics Information and Emergency Communication (ICEIEC) (2018)Google Scholar

Copyright information

© Springer Nature Singapore Pte Ltd. 2020

Authors and Affiliations

  1. 1.School of Electrical EngineeringZhengzhou UniversityZhengzhouChina
  2. 2.School of Computer Science and EngineeringJiangsu University of Science and TechnologyJiangsuChina
  3. 3.School of Computer Science and TechnologyBeijing Institute of TechnologyBeijingChina

Personalised recommendations