{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,4]],"date-time":"2026-06-04T03:04:32Z","timestamp":1780542272480,"version":"3.54.1"},"reference-count":37,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2024,10,21]],"date-time":"2024-10-21T00:00:00Z","timestamp":1729468800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,10,21]],"date-time":"2024-10-21T00:00:00Z","timestamp":1729468800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"name":"Pilot Project for Integrated Innovation of Science, Education and Industry of Qilu University of Technology","award":["2024GH24"],"award-info":[{"award-number":["2024GH24"]}]},{"name":"Pilot Project for Integrated Innovation of Science, Education and Industry of Qilu University of Technology","award":["2024GH24"],"award-info":[{"award-number":["2024GH24"]}]},{"name":"Pilot Project for Integrated Innovation of Science, Education and Industry of Qilu University of Technology","award":["2024GH24"],"award-info":[{"award-number":["2024GH24"]}]},{"name":"Pilot Project for Integrated Innovation of Science, Education and Industry of Qilu University of Technology","award":["2024GH24"],"award-info":[{"award-number":["2024GH24"]}]},{"name":"Pilot Project for Integrated Innovation of Science, Education and Industry of Qilu University of Technology","award":["2024GH24"],"award-info":[{"award-number":["2024GH24"]}]},{"name":"Pilot Project for Integrated Innovation of Science, Education and Industry of Qilu University of Technology","award":["2024GH24"],"award-info":[{"award-number":["2024GH24"]}]},{"name":"Pilot Project for Integrated Innovation of Science, Education and Industry of Qilu University of Technology","award":["2024GH24"],"award-info":[{"award-number":["2024GH24"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Supercomput"],"published-print":{"date-parts":[[2025,1]]},"DOI":"10.1007\/s11227-024-06581-0","type":"journal-article","created":{"date-parts":[[2024,10,21]],"date-time":"2024-10-21T20:02:08Z","timestamp":1729540928000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Swpmmas: an optimized parallel max-min ant system algorithm based on the SW26010-pro processor"],"prefix":"10.1007","volume":"81","author":[{"given":"Min","family":"Tian","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Chaoshuai","family":"Xu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Xiaoming","family":"Wu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jingshan","family":"Pan","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ying","family":"Guo","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Wei","family":"Du","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Zhenguo","family":"Wei","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2024,10,21]]},"reference":[{"issue":"8","key":"6581_CR1","doi-asserted-by":"publisher","first-page":"889","DOI":"10.1016\/S0167-739X(00)00043-1","volume":"16","author":"T St\u00fctzle","year":"2000","unstructured":"St\u00fctzle T, Hoos HH (2000) Max-min ant system. Futur Gener Comput Syst 16(8):889\u2013914","journal-title":"Futur Gener Comput Syst"},{"issue":"4","key":"6581_CR2","doi-asserted-by":"publisher","first-page":"28","DOI":"10.1109\/MCI.2006.329691","volume":"1","author":"M Dorigo","year":"2006","unstructured":"Dorigo M, Birattari M, Stutzle T (2006) Ant colony optimization. IEEE Comput Intell Mag 1(4):28\u201339","journal-title":"IEEE Comput Intell Mag"},{"issue":"10","key":"6581_CR3","doi-asserted-by":"publisher","first-page":"10855","DOI":"10.1109\/TCYB.2021.3069942","volume":"52","author":"Y-H Jia","year":"2021","unstructured":"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\u201310868","journal-title":"IEEE Trans Cybern"},{"issue":"14","key":"6581_CR4","doi-asserted-by":"publisher","first-page":"5395","DOI":"10.3390\/s22145395","volume":"22","author":"M Shafiq","year":"2022","unstructured":"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","journal-title":"Sensors"},{"key":"6581_CR5","doi-asserted-by":"publisher","first-page":"100675","DOI":"10.1016\/j.swevo.2020.100675","volume":"55","author":"Y Wang","year":"2020","unstructured":"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","journal-title":"Swarm Evolut Comput"},{"key":"6581_CR6","doi-asserted-by":"publisher","first-page":"101969","DOI":"10.1016\/j.aei.2023.101969","volume":"56","author":"E K\u0131l\u0131\u00e7aslan","year":"2023","unstructured":"K\u0131l\u0131\u00e7aslan E, Demir HI, K\u00f6k\u00e7am AH, Phanden RK, Erden C (2023) Ant colony optimization application in bottleneck station scheduling. Adv Eng Inf 56:101969","journal-title":"Adv Eng Inf"},{"issue":"2","key":"6581_CR7","first-page":"43","volume":"36","author":"S Kashef","year":"2021","unstructured":"Kashef S, Elshaer R (2021) A review of implementing ant system algorithms on scheduling problems. Egyptian Int J Eng Sci Technol 36(2):43\u201352","journal-title":"Egyptian Int J Eng Sci Technol"},{"issue":"5","key":"6581_CR8","first-page":"699","volume":"54","author":"H-J Akoue","year":"2021","unstructured":"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\u2013712","journal-title":"J Eur Syst Autom"},{"key":"6581_CR9","doi-asserted-by":"crossref","unstructured":"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\u2013257. IEEE","DOI":"10.1109\/CEC.2008.4630807"},{"issue":"1","key":"6581_CR10","doi-asserted-by":"publisher","first-page":"1","DOI":"10.4038\/vjs.v22i1.6060","volume":"22","author":"I Ariyasingha","year":"2019","unstructured":"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\u201311","journal-title":"Vidyodaya J Sci"},{"key":"6581_CR11","doi-asserted-by":"crossref","unstructured":"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\u20132566. IEEE","DOI":"10.1109\/CEC.2019.8790062"},{"key":"6581_CR12","doi-asserted-by":"publisher","first-page":"2401","DOI":"10.1007\/s10489-018-1361-5","volume":"49","author":"A Holzinger","year":"2019","unstructured":"Holzinger A, Plass M, Kickmeier-Rust M, Holzinger K, Cri\u015fan 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\u20132414","journal-title":"Appl Intell"},{"key":"6581_CR13","doi-asserted-by":"publisher","first-page":"105139","DOI":"10.1016\/j.engappai.2022.105139","volume":"114","author":"X Zhou","year":"2022","unstructured":"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","journal-title":"Eng Appl Artif Intell"},{"key":"6581_CR14","doi-asserted-by":"publisher","first-page":"74","DOI":"10.1016\/j.asoc.2016.12.015","volume":"53","author":"F Olivas","year":"2017","unstructured":"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\u201387","journal-title":"Appl Soft Comput"},{"issue":"7","key":"6581_CR15","doi-asserted-by":"publisher","first-page":"1743","DOI":"10.1109\/TCYB.2016.2556742","volume":"47","author":"M Mavrovouniotis","year":"2016","unstructured":"Mavrovouniotis M, M\u00fcller FM, Yang S (2016) Ant colony optimization with local search for dynamic traveling salesman problems. IEEE Trans Cybernet 47(7):1743\u20131756","journal-title":"IEEE Trans Cybernet"},{"key":"6581_CR16","doi-asserted-by":"publisher","first-page":"117151","DOI":"10.1016\/j.eswa.2022.117151","volume":"201","author":"H Zhao","year":"2022","unstructured":"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","journal-title":"Expert Syst Appl"},{"key":"6581_CR17","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1016\/j.swevo.2017.04.002","volume":"36","author":"P Shunmugapriya","year":"2017","unstructured":"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\u201336","journal-title":"Swarm Evolut Comput"},{"key":"6581_CR18","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1016\/j.ins.2012.02.055","volume":"199","author":"L Chen","year":"2012","unstructured":"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\u201342","journal-title":"Inf Sci"},{"key":"6581_CR19","doi-asserted-by":"publisher","first-page":"48","DOI":"10.1016\/j.jpdc.2016.04.014","volume":"98","author":"R Skinderowicz","year":"2016","unstructured":"Skinderowicz R (2016) The gpu-based parallel ant colony system. J Parallel Distrib Comput 98:48\u201360","journal-title":"J Parallel Distrib Comput"},{"key":"6581_CR20","doi-asserted-by":"publisher","first-page":"473","DOI":"10.1016\/j.future.2017.09.073","volume":"79","author":"Y Zhou","year":"2018","unstructured":"Zhou Y, He F, Hou N, Qiu Y (2018) Parallel ant colony optimization on multi-core simd cpus. Future Gener Comput Syst 79:473\u2013487","journal-title":"Future Gener Comput Syst"},{"issue":"4","key":"6581_CR21","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1504\/IJCAT.2022.129382","volume":"69","author":"A Jarrah","year":"2022","unstructured":"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\u2013321","journal-title":"Int J Comput Appl Technol"},{"issue":"11","key":"6581_CR22","first-page":"3707","volume":"5","author":"J Li","year":"2009","unstructured":"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\u20133716","journal-title":"Int J Innov Comput Inform Control"},{"issue":"8","key":"6581_CR23","first-page":"8","volume":"53","author":"A Hadian","year":"2012","unstructured":"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\u201313","journal-title":"Int J Comput Appl"},{"key":"6581_CR24","doi-asserted-by":"crossref","unstructured":"Menezes BA, Kuchen H, Neto HAA, Lima\u00a0Neto 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\u20133101. IEEE","DOI":"10.1109\/CEC.2019.8790073"},{"issue":"5","key":"6581_CR25","doi-asserted-by":"publisher","first-page":"1248","DOI":"10.1016\/j.ins.2006.09.016","volume":"177","author":"I Ellabib","year":"2007","unstructured":"Ellabib I, Calamai P, Basir O (2007) Exchange strategies for multiple ant colony system. Inf Sci 177(5):1248\u20131264","journal-title":"Inf Sci"},{"issue":"8","key":"6581_CR26","doi-asserted-by":"publisher","first-page":"5181","DOI":"10.1016\/j.asoc.2011.05.042","volume":"11","author":"M Pedemonte","year":"2011","unstructured":"Pedemonte M, Nesmachnow S, Cancela H (2011) A survey on parallel ant colony optimization. Appl Soft Comput 11(8):5181\u20135197","journal-title":"Appl Soft Comput"},{"issue":"9","key":"6581_CR27","first-page":"2518","volume":"37","author":"R Zhao","year":"2017","unstructured":"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","journal-title":"J Comput Appl"},{"key":"6581_CR28","doi-asserted-by":"crossref","unstructured":"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\u201315. IEEE","DOI":"10.1109\/HPCCWS.2017.00008"},{"issue":"4","key":"6581_CR29","doi-asserted-by":"publisher","first-page":"975","DOI":"10.1109\/TPDS.2020.3037082","volume":"32","author":"X Liu","year":"2020","unstructured":"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\u2013987","journal-title":"IEEE Trans Parallel Distrib Syst"},{"key":"6581_CR30","doi-asserted-by":"publisher","first-page":"679","DOI":"10.1016\/j.future.2020.08.028","volume":"114","author":"Z Xiao","year":"2021","unstructured":"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\u2013691","journal-title":"Future Gener Comput Syst"},{"key":"6581_CR31","unstructured":"Shang K, Xuezhong Q, Lin G (2021) Parallel sansde for many-core sunway processor. J Front Comput Sci Technol 15(10)"},{"key":"6581_CR32","first-page":"966","volume":"12","author":"K Helsgaun","year":"2017","unstructured":"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\u2013980","journal-title":"Roskilde: Roskilde Univ"},{"key":"6581_CR33","unstructured":"Library of sample instances for traveling salesman problem : http:\/\/comopt.ifi.uni-heidelberg.de\/software\/TSPLIB95\/"},{"key":"6581_CR34","doi-asserted-by":"publisher","first-page":"585","DOI":"10.1007\/s00500-014-1279-8","volume":"19","author":"W Yong","year":"2015","unstructured":"Yong W (2015) Hybrid max-min ant system with four vertices and three lines inequality for traveling salesman problem. Soft Comput 19:585\u2013596","journal-title":"Soft Comput"},{"key":"6581_CR35","doi-asserted-by":"publisher","first-page":"1669","DOI":"10.1007\/s00500-016-2432-3","volume":"22","author":"\u015e G\u00fclc\u00fc","year":"2018","unstructured":"G\u00fclc\u00fc \u015e, Mahi M, Baykan \u00d6K, 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\u20131685","journal-title":"Soft Comput"},{"key":"6581_CR36","doi-asserted-by":"publisher","first-page":"104678","DOI":"10.1016\/j.robot.2024.104678","volume":"177","author":"Y Zhang","year":"2024","unstructured":"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","journal-title":"Robot Auton Syst"},{"key":"6581_CR37","doi-asserted-by":"publisher","first-page":"1609","DOI":"10.7717\/peerj-cs.1609","volume":"9","author":"T Hao","year":"2023","unstructured":"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","journal-title":"Peer J Comput Sci"}],"container-title":["The Journal of Supercomputing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-024-06581-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11227-024-06581-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-024-06581-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,11,30]],"date-time":"2024-11-30T00:20:09Z","timestamp":1732926009000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11227-024-06581-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,10,21]]},"references-count":37,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2025,1]]}},"alternative-id":["6581"],"URL":"https:\/\/doi.org\/10.1007\/s11227-024-06581-0","relation":{},"ISSN":["0920-8542","1573-0484"],"issn-type":[{"value":"0920-8542","type":"print"},{"value":"1573-0484","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,10,21]]},"assertion":[{"value":"21 August 2024","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"21 October 2024","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"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.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}},{"value":"In this paper, the declaration is not applicable.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethical approval"}}],"article-number":"47"}}