Skip to main content
Springer Nature Link
Log in

Swpmmas: an optimized parallel max-min ant system algorithm based on the SW26010-pro processor

  • Published:
The Journal of Supercomputing Aims and scope Submit manuscript

Abstract

The max-min ant system (MMAS) algorithm has found extensive application in tackling combinatorial optimization challenges such as the traveling salesman problem (TSP), production scheduling, and quadratic assignment. Nevertheless, as the scale of the problem increases, the MMAS algorithm gradually encounters performance limitations. To address the performance constraints of MMAS, we propose a parallel max-min ant system (PMMAS) algorithm, where a master subpopulation coordinates multiple subpopulations in parallel search. Furthermore, to facilitate the parallel acceleration of computationally intensive tasks in PMMAS using the CPE array of the SW26010-Pro processor, the selection weight calculation equation in the traditional MMAS algorithm was improved. This improvement led to the introduction of the Sunway parallel max-min ant system (SWPMMAS) algorithm, which implements parallelism using MPI and Athread. The revised selection weight calculation equation is also applicable to the traditional MMAS algorithm and enhances its running speed. Finally, the SWPMMAS algorithm was evaluated using various TSP instances, with city counts ranging from 51 to 11,849. The results demonstrate that the SWPMMAS algorithm provides excellent solutions. For TSP instances with more than 10,000 cities, the SWPMMAS algorithm achieves over 13\(\times\) speedup compared to the PMMAS algorithm running on the Sunway architecture and 5.4\(\times\) speedup compared to the PMMAS algorithm running on a commercial Shanhe supercomputer. Moreover, testing indicates that the SWPMMAS algorithm exhibits outstanding scalability.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Algorithm 1
Fig. 6
Fig. 7
Fig. 8
Fig. 9
Algorithm 2
Algorithm 3
Fig. 10
Fig. 11
Fig. 12
Fig. 13
Fig. 14
Fig. 15

Similar content being viewed by others

Data availability

The data used to support the findings of this study are available from the corresponding author upon request.

References

  1. Stützle T, Hoos HH (2000) Max-min ant system. Futur Gener Comput Syst 16(8):889–914

    Article  Google Scholar 

  2. Dorigo M, Birattari M, Stutzle T (2006) Ant colony optimization. IEEE Comput Intell Mag 1(4):28–39

    Article  Google Scholar 

  3. Jia Y-H, Mei Y, Zhang M (2021) A bilevel ant colony optimization algorithm for capacitated electric vehicle routing problem. IEEE Trans Cybern 52(10):10855–10868

    Article  Google Scholar 

  4. Shafiq M, Ali ZA, Israr A, Alkhammash EH, Hadjouni M, Jussila JJ (2022) Convergence analysis of path planning of multi-uavs using max-min ant colony optimization approach. Sensors 22(14):5395

    Article  Google Scholar 

  5. Wang Y, Wang L, Chen G, Cai Z, Zhou Y, Xing L (2020) An improved ant colony optimization algorithm to the periodic vehicle routing problem with time window and service choice. Swarm Evolut Comput 55:100675

    Article  Google Scholar 

  6. Kılıçaslan E, Demir HI, Kökçam AH, Phanden RK, Erden C (2023) Ant colony optimization application in bottleneck station scheduling. Adv Eng Inf 56:101969

    Article  Google Scholar 

  7. Kashef S, Elshaer R (2021) A review of implementing ant system algorithms on scheduling problems. Egyptian Int J Eng Sci Technol 36(2):43–52

    Google Scholar 

  8. Akoue H-J, Eloundou PN, Essiane SN, Ele P, Nneme LN, Diboma BS, Mayi OTS (2021) A novel hybrid algorithm of max-min ant system with quadratic programming to solve the unit commitment problem. J Eur Syst Autom 54(5):699–712

    Google Scholar 

  9. Mouhoub M, Wang Z (2008) Improving the ant colony optimization algorithm for the quadratic assignment problem. In: 2008 IEEE congress on evolutionary computation (IEEE World Congress on Computational Intelligence), pp 250–257. IEEE

  10. Ariyasingha I, Fernando T (2019) A new multi-objective ant colony optimisation algorithm for solving the quadratic assignment problem. Vidyodaya J Sci 22(1):1–11

    Article  Google Scholar 

  11. Montemayor JJM, Crisostomo RV (2019) Feature selection in classification using binary max-min ant system with differential evolution. In: 2019 IEEE congress on evolutionary computation (CEC), pp 2559–2566. IEEE

  12. Holzinger A, Plass M, Kickmeier-Rust M, Holzinger K, Crişan GC, Pintea C-M, Palade V (2019) Interactive machine learning: experimental evidence for the human in the algorithmic loop: A case study on ant colony optimization. Appl Intell 49:2401–2414

    Article  Google Scholar 

  13. Zhou X, Ma H, Gu J, Chen H, Deng W (2022) Parameter adaptation-based ant colony optimization with dynamic hybrid mechanism. Eng Appl Artif Intell 114:105139

    Article  Google Scholar 

  14. Olivas F, Valdez F, Castillo O, Gonzalez CI, Martinez G, Melin P (2017) Ant colony optimization with dynamic parameter adaptation based on interval type-2 fuzzy logic systems. Appl Soft Comput 53:74–87

    Article  Google Scholar 

  15. Mavrovouniotis M, Müller FM, Yang S (2016) Ant colony optimization with local search for dynamic traveling salesman problems. IEEE Trans Cybernet 47(7):1743–1756

    Article  Google Scholar 

  16. Zhao H, Zhang C (2022) An ant colony optimization algorithm with evolutionary experience-guided pheromone updating strategies for multi-objective optimization. Expert Syst Appl 201:117151

    Article  Google Scholar 

  17. Shunmugapriya P, Kanmani S (2017) A hybrid algorithm using ant and bee colony optimization for feature selection and classification (ac-abc hybrid). Swarm Evolut Comput 36:27–36

    Article  Google Scholar 

  18. Chen L, Sun H-Y, Wang S (2012) A parallel ant colony algorithm on massively parallel processors and its convergence analysis for the travelling salesman problem. Inf Sci 199:31–42

    Article  MathSciNet  Google Scholar 

  19. Skinderowicz R (2016) The gpu-based parallel ant colony system. J Parallel Distrib Comput 98:48–60

    Article  Google Scholar 

  20. Zhou Y, He F, Hou N, Qiu Y (2018) Parallel ant colony optimization on multi-core simd cpus. Future Gener Comput Syst 79:473–487

    Article  Google Scholar 

  21. Jarrah A, Bataineh ASA, Almomany A (2022) The optimisation of travelling salesman problem based on parallel ant colony algorithm. Int J Comput Appl Technol 69(4):309–321

    Article  Google Scholar 

  22. Li J, Hu X, Pang Z, Qian K (2009) A parallel ant colony optimization algorithm based on fine-grained model with gpu-acceleration. Int J Innov Comput Inform Control 5(11):3707–3716

    Google Scholar 

  23. Hadian A, Shahrivari S, Minaei-Bidgoli B (2012) Fine-grained parallel ant colony system for shared-memory architectures. Int J Comput Appl 53(8):8–13

    Google Scholar 

  24. Menezes BA, Kuchen H, Neto HAA, Lima Neto FB (2019) Parallelization strategies for gpu-based ant colony optimization solving the traveling salesman problem. In: 2019 IEEE congress on evolutionary computation (CEC), pp 3094–3101. IEEE

  25. Ellabib I, Calamai P, Basir O (2007) Exchange strategies for multiple ant colony system. Inf Sci 177(5):1248–1264

    Article  Google Scholar 

  26. Pedemonte M, Nesmachnow S, Cancela H (2011) A survey on parallel ant colony optimization. Appl Soft Comput 11(8):5181–5197

    Article  Google Scholar 

  27. Zhao R, Zheng K, Liu Y, Wang S, Liu Y, Sheng H, Zhou Q (2017) Hybrid parallel genetic algorithm based on sunway many-core processors. J Comput Appl 37(9):2518

    Google Scholar 

  28. Liu Y, Zhao R, Zheng K, Wang S, Liu Y, Shen H, Zhou Q (2017) A hybrid parallel genetic algorithm with dynamic migration strategy based on sunway many-core processor. In: 2017 IEEE 19th international conference on high performance computing and communications workshops (HPCCWS), pp 9–15. IEEE

  29. Liu X, Sun J, Zheng L, Wang S, Liu Y, Wei T (2020) Parallelization and optimization of nsga-ii on sunway taihulight system. IEEE Trans Parallel Distrib Syst 32(4):975–987

    Article  Google Scholar 

  30. Xiao Z, Liu X, Xu J, Sun Q, Gan L (2021) Highly scalable parallel genetic algorithm on sunway many-core processors. Future Gener Comput Syst 114:679–691

    Article  Google Scholar 

  31. Shang K, Xuezhong Q, Lin G (2021) Parallel sansde for many-core sunway processor. J Front Comput Sci Technol 15(10)

  32. Helsgaun K (2017) An extension of the lin-kernighan-helsgaun tsp solver for constrained traveling salesman and vehicle routing problems. Roskilde: Roskilde Univ 12:966–980

    Google Scholar 

  33. Library of sample instances for traveling salesman problem : http://comopt.ifi.uni-heidelberg.de/software/TSPLIB95/

  34. Yong W (2015) Hybrid max-min ant system with four vertices and three lines inequality for traveling salesman problem. Soft Comput 19:585–596

    Article  Google Scholar 

  35. Gülcü Ş, Mahi M, Baykan ÖK, Kodaz H (2018) A parallel cooperative hybrid method based on ant colony optimization and 3-opt algorithm for solving traveling salesman problem. Soft Comput 22:1669–1685

    Article  Google Scholar 

  36. Zhang Y, Shen Y, Wang Q, Song C, Dai N, He B (2024) A novel hybrid swarm intelligence algorithm for solving tsp and desired-path-based online obstacle avoidance strategy for auv. Robot Auton Syst 177:104678

    Article  Google Scholar 

  37. Hao T, Yingnian W, Jiaxing Z, Jing Z (2023) Study on a hybrid algorithm combining enhanced ant colony optimization and double improved simulated annealing via clustering in the traveling salesman problem (tsp). Peer J Comput Sci 9:1609

    Article  Google Scholar 

Download references

Funding

This research was partly supported by the Pilot Project for Integrated Innovation of Science, Education, and Industry of Qilu University of Technology (Shandong Academy of Sciences) (2024GH24).

Author information

Authors and Affiliations

  1. Key Laboratory of Computing Power Network and Information Security, Ministry of Education, Shandong Computer Science Center (National Supercomputer Center in Jinan), Qilu University of Technology (Shandong Academy of Sciences), Jinan, China

    Min Tian, Chaoshuai Xu, Xiaoming Wu, Jingshan Pan, Ying Guo, Wei Du & Zhenguo Wei

  2. Jinan Key Laboratory of High Performance Computing, Jinan Institute of Supercomputer Technology, Jinan, China

    Jingshan Pan

  3. Shandong Provincial Key Laboratory of Computer Networks, Shandong Fundamental Research Center for Computer Science, Jinan, China

    Min Tian, Chaoshuai Xu, Xiaoming Wu, Ying Guo, Wei Du & Zhenguo Wei

Authors
  1. Min Tian
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Chaoshuai Xu
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Xiaoming Wu
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Jingshan Pan
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. Ying Guo
    View author publications

    You can also search for this author in PubMed Google Scholar

  6. Wei Du
    View author publications

    You can also search for this author in PubMed Google Scholar

  7. Zhenguo Wei
    View author publications

    You can also search for this author in PubMed Google Scholar

Contributions

Min Tian conceived and designed the algorithm, while Chaoshuai Xu implemented and tested it. Both Min Tian and Chaoshuai Xu contributed to writing the main manuscript text, and the remaining authors prepared figures 1-14. All authors reviewed the manuscript.

Corresponding author

Correspondence to Chaoshuai Xu.

Ethics declarations

Conflict of interest

The authors declare no conflict of interest as defined by Springer, or other interests that might be perceived to influence the results and/or discussion reported in this paper.

Ethical approval

In this paper, the declaration is not applicable.

Additional information

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Springer Nature or its licensor (e.g. a society or other partner) holds exclusive rights to this article under a publishing agreement with the author(s) or other rightsholder(s); author self-archiving of the accepted manuscript version of this article is solely governed by the terms of such publishing agreement and applicable law.

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Tian, M., Xu, C., Wu, X. et al. Swpmmas: an optimized parallel max-min ant system algorithm based on the SW26010-pro processor. J Supercomput 81, 47 (2025). https://doi.org/10.1007/s11227-024-06581-0

Download citation

  • Accepted:

  • Published:

  • DOI: https://doi.org/10.1007/s11227-024-06581-0

Keywords

Search

Navigation