Advertisement

CAAS: a novel collective action-based ant system algorithm for solving TSP problem

  • Sicong Li
  • Saihua Cai
  • Li Li
  • Ruizhi SunEmail author
  • Gang Yuan
Methodologies and Application
  • 19 Downloads

Abstract

To solve some problems of ant system algorithm, such as the slow speed of convergence and falling into the phenomenon of “ant colony group loss” easily, we introduce the collective action into the traditional ant system algorithm. Based on the collective action, we propose a novel collective action-based ant system algorithm, namely CAAS, for solving the traveling salesman problem. In the CAAS algorithm, a collective action “optimal solution approval” is defined for ant colony and each ant of the ant colony is assigned a threshold, and then each ant decides whether to join into the collective action according to its own threshold in the iteration process. When all ants approved the same solution, the iteration is stopped and output the final optimal solution. At last, we conduct extensive experiments on six public datasets to verify the performance of the proposed CAAS algorithm. The experimental results show that the CAAS algorithm can get a better solution under a less iteration.

Keywords

Traveling salesman problem Ant system Ant colony optimization Collective action 

Notes

Compliance with ethical standards

Conflict of interest

The authors declare that they have no conflict of interest.

Ethical approval

This article does not contain any studies with human participants or animals performed by any of the authors.

Informed consent

Informed consent was obtained from all individual participants included in the study.

References

  1. Ahmed ZH (2010) Genetic algorithm for the traveling salesman problem using sequential constructive crossover operator. Int J Biom Bioinform 3(6):96–105Google Scholar
  2. Carrabs F, Cerulli R, Speranza MG (2013) A branch-and-bound algorithm for the double TSP with two stacks. Networks 61(1):58–75MathSciNetCrossRefGoogle Scholar
  3. Dorigo M, Gambardella LM (1997) Ant colony system: a cooperative learning approach to the traveling salesman problem. IEEE Trans Evolut Comput 1(1):53–66CrossRefGoogle Scholar
  4. Dorigo M, Maniezzo V, Colorni A (1991) Ant system: an autocatalytic optimizing process technical report 91-016. Clustering 3(12):340Google Scholar
  5. Dorigo M, Maniezzo V, Colorni A (1996) Ant system: optimization by a colony of cooperating agents. IEEE Trans Syst Man Cybernet Part B: Cybernet 26(1):29–41CrossRefGoogle Scholar
  6. El-Naggar KM, Alrashidi MR, Alhajri MF, AI-Othman AK (2012) Simulated annealing algorithm for photovoltaic parameters identification. Sol Energy 86(1):266–274CrossRefGoogle Scholar
  7. Eusuff M, Lansey K, Pasha F (2006) Shuffled frog-leaping algorithm: a memetic meta-heuristic for discrete optimization. Eng Optim 38(2):129–154MathSciNetCrossRefGoogle Scholar
  8. Fan JH, Wei XL, Wang TX, Lan T, Subramaniam S (2017) Deadline-aware task scheduling in a tiered IoT infrastructure. In: 2017 IEEE global telecommunications conferenceGoogle Scholar
  9. Fei T, Zhang LY, Li Y, Yang YL, Wang F (2014) The artificial fish swarm algorithm to solve traveling salesman problem. Int Conf Comput Sci Inf Technol (CSAIT) 255:679–685Google Scholar
  10. Granovetter M (1978) Threshold models of collective behavior. Am J Sociol 83(6):1420–1443CrossRefGoogle Scholar
  11. Guan BX, Zhao YH, Sun WJ (2018) Ant colony optimization with an automatic adjustment mechanism for detecting epistatic interactions. Comput Biol Chem 77:354–362CrossRefGoogle Scholar
  12. He JQ, Sun XJ, Li W, Chen J (2017) A new pheromone update strategy for ant colony optimization. J Intell Fuzzy Syst 32(5):3355–3364CrossRefGoogle Scholar
  13. Held M, Karp RM (1962) A dynamic programming approach to sequencing problems. J Soc Ind Appl Math 10(1):196–210MathSciNetCrossRefGoogle Scholar
  14. Hsu CC, Wang WY, Chien YH, Hou RY (2018) FPGA implementation of improved ant colony optimization algorithm based on pheromone diffusion mechanism for path planning. J Marine Sci Technol Taiwan 26(2):170–179Google Scholar
  15. Ji WD, Wang KQ (2012) An improved particle swarm optimization algorithm. In: 2011 international conference on computer science and network technology, pp 585–589Google Scholar
  16. Li DY, Wang XY, Huang PH (2018) A Max-Min ant colony algorithm for fractal dimension of complex networks. Int J Comput Math 95(10):1927–1936MathSciNetCrossRefGoogle Scholar
  17. Lim YF, Hong PY, Ramli R, Khalid R (2013) Modified reactive tabu search for the symmetric traveling salesman problems. In: 2013 international conference on mathematical sciences and statistics vol 1557, pp 505–509Google Scholar
  18. Liu YX, Gao C, Zhang ZL, Lu YX, Chen S, Liang MX, Tao L (2017) Solving NP-hard problems with physarum-based ant colony system. IEEE-ACM Trans Comput Biol Bioinform 14(1):108–120CrossRefGoogle Scholar
  19. Luan J, Yao Z, Zhao FT, Song X (2019) A novel method to solve supplier selection problem: hybrid algorithm of genetic algorithm and ant colony optimization. Math Comput Simul 156:294–309MathSciNetCrossRefGoogle Scholar
  20. Mohajerani A, Gharavian D (2016) An ant colony optimization based routing algorithm for extending network lifetime in wireless sensor networks. Wirel Netw 22(8):2637–2647CrossRefGoogle Scholar
  21. Saenphon T, Phimoltares S, Lursinsap C (2014) Combining new fast opposite gradient search with ant colony optimization for solving travelling salesman problem. Eng Appl Artif Intell 35:324–334CrossRefGoogle Scholar
  22. Sayed S, Nassef M, Badr A, Farag I (2019) A nested genetic algorithm for feature selection in high-dimensional cancer microarray datasets. Expert Syst Appl 121:233–243CrossRefGoogle Scholar
  23. Shao Q, Xu CC, Zhu Y (2019) Multi-helicopter search and rescue route planning based on strategy optimization algorithm. Int J Pattern Recognit Artif Intell 33(1):1950002CrossRefGoogle Scholar
  24. Song CH, Lee K, Lee WD (2003) Extended simulated annealing for augmented TSP and multi-salesmen TSP. In: 2003 international joint conference on neural networks vol 3, pp 2340–2343Google Scholar
  25. Stutzle T, Hoos H (1997) MAX-MIN ant system and local search for the traveling salesman problem. In: 1997 IEEE international conference on evolutionary computation, pp 309–314Google Scholar
  26. Wang L, Xia XH, Cao JH, Liu X, Liu JW (2018) Improved ant colony-genetic algorithm for information transmission path optimization in remanufacturing service system. Chin J Mech Eng 31(1):107CrossRefGoogle Scholar
  27. Xu P, He G, Li Z, Zhang Z (2018) An efficient load balancing algorithm for virtual machine allocation based on ant colony optimization. Int J Distrib Sens Netw 14(12):1–9CrossRefGoogle Scholar
  28. Yao BZ, Chen C, Song XL, Yang XL (2019) Fresh seafood delivery routing problem using an improved ant colony optimization. Ann Cper Res 273(1-2):163–186MathSciNetCrossRefGoogle Scholar
  29. Zhang ZL, Gao C, Liu YX, Qian T (2014) A universal optimization strategy for ant colony optimization algorithms based on the Physarum-inspired mathematical model. Bioinspiration Biomim 9(3):036006CrossRefGoogle Scholar
  30. Zhang JY, Fan XX, Li M, Zhou SS, Liu JM (2018) Ant system with negative for the hospital ward color planning. Wirel Pers Commun 102(2):1589–1601CrossRefGoogle Scholar

Copyright information

© Springer-Verlag GmbH Germany, part of Springer Nature 2019

Authors and Affiliations

  • Sicong Li
    • 1
  • Saihua Cai
    • 1
  • Li Li
    • 1
  • Ruizhi Sun
    • 1
    • 2
    Email author
  • Gang Yuan
    • 1
  1. 1.College of Information and Electrical EngineeringChina Agricultural UniversityBeijingChina
  2. 2.Scientific Research Base for Integrated Technologies of Precision Agriculture (Animal Husbandry), The Ministry of AgricultureBeijingChina

Personalised recommendations