{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,23]],"date-time":"2025-11-23T13:31:55Z","timestamp":1763904715472,"version":"3.40.1"},"reference-count":59,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2025,2,1]],"date-time":"2025-02-01T00:00:00Z","timestamp":1738368000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,2,1]],"date-time":"2025-02-01T00:00:00Z","timestamp":1738368000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["Grant 61673258","Grant 61075115"],"award-info":[{"award-number":["Grant 61673258","Grant 61075115"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100007219","name":"Shanghai Natural Science Foundation","doi-asserted-by":"crossref","award":["Grant 19ZR1421600"],"award-info":[{"award-number":["Grant 19ZR1421600"]}],"id":[{"id":"10.13039\/100007219","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Soft Comput"],"published-print":{"date-parts":[[2025,2]]},"DOI":"10.1007\/s00500-025-10469-3","type":"journal-article","created":{"date-parts":[[2025,2,25]],"date-time":"2025-02-25T07:23:47Z","timestamp":1740468227000},"page":"2107-2128","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Multi-ant colony algorithm based on the Stackelberg game and incremental learning"],"prefix":"10.1007","volume":"29","author":[{"given":"Qihuan","family":"Wu","sequence":"first","affiliation":[]},{"given":"Xiaoming","family":"You","sequence":"additional","affiliation":[]},{"given":"Sheng","family":"Liu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,2,25]]},"reference":[{"key":"10469_CR1","doi-asserted-by":"publisher","DOI":"10.1016\/j.compeleceng.2021.107419","author":"MS Ajmal","year":"2021","unstructured":"Ajmal MS, Iqbal Z, Khan FZ, Ahmad M, Ahmad I, Gupta BB (2021) Hybrid ant genetic algorithm for efficient task scheduling in cloud data centers. Comput Electr Eng. https:\/\/doi.org\/10.1016\/j.compeleceng.2021.107419","journal-title":"Comput Electr Eng"},{"key":"10469_CR2","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2019.105887","author":"MAH Akhand","year":"2020","unstructured":"Akhand MAH, Ayon SI, Shahriyar SA, Siddique N, Adeli H (2020) Discrete spider monkey optimization for travelling salesman problem. Appl Soft Comput. https:\/\/doi.org\/10.1016\/j.asoc.2019.105887","journal-title":"Appl Soft Comput"},{"key":"10469_CR3","doi-asserted-by":"publisher","DOI":"10.1016\/j.engappai.2022.104715","author":"S Baltierra","year":"2022","unstructured":"Baltierra S, Valdebenito J, Mora M (2022) A proposal of edge detection in images with multiplicative noise using the ant colony system algorithm. Eng Appl Artif Intell. https:\/\/doi.org\/10.1016\/j.engappai.2022.104715","journal-title":"Eng Appl Artif Intell"},{"key":"10469_CR4","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2019.105659","author":"X Cai","year":"2019","unstructured":"Cai X, Gao L, Li F (2019) Sequential approximation optimization assisted particle swarm optimization for expensive problems. Appl Soft Comput. https:\/\/doi.org\/10.1016\/j.asoc.2019.105659","journal-title":"Appl Soft Comput"},{"issue":"4","key":"10469_CR5","doi-asserted-by":"publisher","first-page":"879","DOI":"10.1016\/j.jestch.2019.11.005","volume":"23","author":"AC Cinar","year":"2020","unstructured":"Cinar AC, Korkmaz S, Kiran MS (2020) A discrete tree-seed algorithm for solving symmetric traveling salesman problem. Eng Sci Technol Int J 23(4):879\u2013890. https:\/\/doi.org\/10.1016\/j.jestch.2019.11.005","journal-title":"Eng Sci Technol Int J"},{"issue":"1","key":"10469_CR6","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1109\/4235.585892","volume":"1","author":"M Dorigo","year":"1997","unstructured":"Dorigo M, Gambardella LM (1997) Ant colony system: a cooperative learning approach to the traveling salesman problem. IEEE Trans Evol Comput 1(1):53\u201366. https:\/\/doi.org\/10.1109\/4235.585892","journal-title":"IEEE Trans Evol Comput"},{"issue":"1","key":"10469_CR7","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1109\/3477.484436","volume":"26","author":"M Dorigo","year":"1996","unstructured":"Dorigo M, Maniezzo V, Colorni A (1996) Ant system: optimization by a colony of cooperating agents. IEEE Trans Syst Man Cybern B Cybern 26(1):29\u201341. https:\/\/doi.org\/10.1109\/3477.484436","journal-title":"IEEE Trans Syst Man Cybern B Cybern"},{"key":"10469_CR8","doi-asserted-by":"publisher","first-page":"377","DOI":"10.1016\/j.comcom.2023.09.015","volume":"212","author":"GP Dubey","year":"2023","unstructured":"Dubey GP, Stalin S, Alqahtani O, Alasiry A, Sharma M, Aleryani A, Shukla PK, Alouane MT-H (2023) Optimal path selection using reinforcement learning based ant colony optimization algorithm in IoT-Based wireless sensor networks with 5G technology. Comput Commun 212:377\u2013389. https:\/\/doi.org\/10.1016\/j.comcom.2023.09.015","journal-title":"Comput Commun"},{"key":"10469_CR9","doi-asserted-by":"publisher","DOI":"10.1016\/j.engappai.2020.103649","author":"S Ebadinezhad","year":"2020","unstructured":"Ebadinezhad S (2020) DEACO: Adopting dynamic evaporation strategy to enhance ACO algorithm for the traveling salesman problem. Eng Appl Artif Intell. https:\/\/doi.org\/10.1016\/j.engappai.2020.103649","journal-title":"Eng Appl Artif Intell"},{"key":"10469_CR10","doi-asserted-by":"publisher","first-page":"70","DOI":"10.1016\/j.eswa.2017.06.007","volume":"87","author":"AE-S Ezugwu","year":"2017","unstructured":"Ezugwu AE-S, Adewumi AO (2017) Discrete symbiotic organisms search algorithm for travelling salesman problem. Expert Syst Appl 87:70\u201378. https:\/\/doi.org\/10.1016\/j.eswa.2017.06.007","journal-title":"Expert Syst Appl"},{"issue":"5","key":"10469_CR11","doi-asserted-by":"publisher","first-page":"1669","DOI":"10.1007\/s00500-016-2432-3","volume":"22","author":"\u015e G\u00fclc\u00fc","year":"2016","unstructured":"G\u00fclc\u00fc \u015e, Mahi M, Baykan \u00d6K, Kodaz H (2016) A parallel cooperative hybrid method based on ant colony optimization and 3-Opt algorithm for solving traveling salesman problem. Soft Comput 22(5):1669\u20131685. https:\/\/doi.org\/10.1007\/s00500-016-2432-3","journal-title":"Soft Comput"},{"key":"10469_CR12","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1016\/j.asoc.2018.03.048","volume":"68","author":"S Hore","year":"2018","unstructured":"Hore S, Chatterjee A, Dewanji A (2018) Improving variable neighborhood search to solve the traveling salesman problem. Appl Soft Comput 68:83\u201391. https:\/\/doi.org\/10.1016\/j.asoc.2018.03.048","journal-title":"Appl Soft Comput"},{"key":"10469_CR13","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1109\/tgrs.2022.3180200","volume":"60","author":"W Huang","year":"2022","unstructured":"Huang W (2022) Seismic data interpolation by shannon entropy-based shaping. IEEE Trans Geosci Remote Sens 60:1\u201312. https:\/\/doi.org\/10.1109\/tgrs.2022.3180200","journal-title":"IEEE Trans Geosci Remote Sens"},{"key":"10469_CR14","doi-asserted-by":"publisher","unstructured":"James Kennedy RE (1995) Particle Swarm optimization proceedings of international conference on neural networks, 1942\u20131948. https:\/\/doi.org\/10.1109\/ICNN.1995.488968","DOI":"10.1109\/ICNN.1995.488968"},{"key":"10469_CR15","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2023.110219","author":"GK Jati","year":"2023","unstructured":"Jati GK, Kuwanto G, Hashmi T, Widjaja H (2023) Discrete komodo algorithm for traveling salesman problem. Appl Soft Comput. https:\/\/doi.org\/10.1016\/j.asoc.2023.110219","journal-title":"Appl Soft Comput"},{"key":"10469_CR16","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1016\/j.oceaneng.2015.04.028","volume":"102","author":"W-Y Jiang","year":"2015","unstructured":"Jiang W-Y, Lin Y, Chen M, Yu Y-Y (2015) A co-evolutionary improved multi-ant colony optimization for ship multiple and branch pipe route design. Ocean Eng 102:63\u201370. https:\/\/doi.org\/10.1016\/j.oceaneng.2015.04.028","journal-title":"Ocean Eng"},{"key":"10469_CR17","doi-asserted-by":"publisher","DOI":"10.1007\/s10489-024-05603-x","author":"M Jung","year":"2024","unstructured":"Jung M, Lee J, Kim J (2024) A lightweight CNN-transformer model for learning traveling salesman problems. Appl Intell. https:\/\/doi.org\/10.1007\/s10489-024-05603-x","journal-title":"Appl Intell"},{"issue":"2","key":"10469_CR18","doi-asserted-by":"publisher","first-page":"283","DOI":"10.1007\/s40304-021-00248-5","volume":"11","author":"V Kumar","year":"2022","unstructured":"Kumar V, Dangi B (2022) Quantile-based shannon entropy for record statistics. Commun Math Stat 11(2):283\u2013306. https:\/\/doi.org\/10.1007\/s40304-021-00248-5","journal-title":"Commun Math Stat"},{"key":"10469_CR19","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2022.108323","author":"M Kurdi","year":"2022","unstructured":"Kurdi M (2022) Ant colony optimization with a new exploratory heuristic information approach for open shop scheduling problem. Knowl-Based Syst. https:\/\/doi.org\/10.1016\/j.knosys.2022.108323","journal-title":"Knowl-Based Syst"},{"key":"10469_CR20","doi-asserted-by":"publisher","DOI":"10.3390\/math10060925","author":"S Li","year":"2022","unstructured":"Li S, Wei Y, Liu X, Zhu H, Yu Z (2022) A new fast ant colony optimization algorithm: the saltatory evolution ant colony optimization algorithm. Mathematics. https:\/\/doi.org\/10.3390\/math10060925","journal-title":"Mathematics"},{"key":"10469_CR21","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2023.110868","author":"G Li","year":"2023","unstructured":"Li G, Liu C, Wu L, Xiao W (2023a) A mixing algorithm of ACO and ABC for solving path planning of mobile robot. Appl Soft Comput. https:\/\/doi.org\/10.1016\/j.asoc.2023.110868","journal-title":"Appl Soft Comput"},{"issue":"5","key":"10469_CR22","doi-asserted-by":"publisher","first-page":"4009","DOI":"10.1007\/s00500-023-09373-5","volume":"28","author":"J Li","year":"2023","unstructured":"Li J, Yan J, Zhang H, Xiao K (2023b) Identification of feedback nonlinear systems with time delay based on chaotic decreasing weight sparrow search algorithm. Soft Comput 28(5):4009\u20134024. https:\/\/doi.org\/10.1007\/s00500-023-09373-5","journal-title":"Soft Comput"},{"key":"10469_CR23","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2022.109943","author":"W Li","year":"2023","unstructured":"Li W, Wang C, Huang Y, Cheung Y-M (2023c) Heuristic smoothing ant colony optimization with differential information for the traveling salesman problem. Appl Soft Comput. https:\/\/doi.org\/10.1016\/j.asoc.2022.109943","journal-title":"Appl Soft Comput"},{"key":"10469_CR24","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2023.110540","author":"C Liu","year":"2023","unstructured":"Liu C, Wu L, Xiao W, Li G, Xu D, Guo J, Li W (2023) An improved heuristic mechanism ant colony optimization algorithm for solving path planning. Knowl-Based Syst. https:\/\/doi.org\/10.1016\/j.knosys.2023.110540","journal-title":"Knowl-Based Syst"},{"issue":"8","key":"10469_CR25","doi-asserted-by":"publisher","first-page":"3903","DOI":"10.1007\/s00500-022-06833-2","volume":"26","author":"J Meng","year":"2022","unstructured":"Meng J, You X, Liu S (2022) Heterogeneous ant colony optimization based on adaptive interactive learning and non-zero-sum game. Soft Comput 26(8):3903\u20133920. https:\/\/doi.org\/10.1007\/s00500-022-06833-2","journal-title":"Soft Comput"},{"key":"10469_CR26","doi-asserted-by":"publisher","DOI":"10.1016\/j.cie.2021.107230","author":"C Miao","year":"2021","unstructured":"Miao C, Chen G, Yan C, Wu Y (2021) Path planning optimization of indoor mobile robot based on adaptive ant colony algorithm. Comput Ind Eng. https:\/\/doi.org\/10.1016\/j.cie.2021.107230","journal-title":"Comput Ind Eng"},{"key":"10469_CR27","doi-asserted-by":"publisher","unstructured":"Miller BL, Shaw MJ (1996). Genetic algorithms with dynamic niche sharing for multimodal function optimization. Proceedings of 1996 {IEEE} international conference on evolutionary computation, 786\u2013791. https:\/\/doi.org\/10.1109\/ICEC.1996.542701","DOI":"10.1109\/ICEC.1996.542701"},{"issue":"5","key":"10469_CR28","doi-asserted-by":"publisher","first-page":"3937","DOI":"10.1007\/s10462-021-10099-9","volume":"55","author":"Q Pan","year":"2021","unstructured":"Pan Q, Tang J, Wang H, Li H, Chen X, Lao S (2021) SFSADE: an improved self-adaptive differential evolution algorithm with a shuffled frog-leaping strategy. Artif Intell Rev 55(5):3937\u20133978. https:\/\/doi.org\/10.1007\/s10462-021-10099-9","journal-title":"Artif Intell Rev"},{"issue":"15","key":"10469_CR29","doi-asserted-by":"publisher","first-page":"17580","DOI":"10.1007\/s10489-022-03471-x","volume":"52","author":"Q Pan","year":"2022","unstructured":"Pan Q, Tang J, Lao S (2022) EDOA: an elastic deformation optimization algorithm. Appl Intell 52(15):17580\u201317599. https:\/\/doi.org\/10.1007\/s10489-022-03471-x","journal-title":"Appl Intell"},{"issue":"18","key":"10469_CR30","doi-asserted-by":"publisher","first-page":"13433","DOI":"10.1007\/s00521-023-08391-6","volume":"35","author":"Q Pan","year":"2023","unstructured":"Pan Q, Tang J, Zhan J, Li H (2023) Bacteria phototaxis optimizer. Neural Comput Appl 35(18):13433\u201313464. https:\/\/doi.org\/10.1007\/s00521-023-08391-6","journal-title":"Neural Comput Appl"},{"key":"10469_CR31","doi-asserted-by":"publisher","DOI":"10.1016\/j.jocs.2021.101454","author":"K Panwar","year":"2021","unstructured":"Panwar K, Deep K (2021) Transformation operators based grey wolf optimizer for travelling salesman problem. J Comput Sci. https:\/\/doi.org\/10.1016\/j.jocs.2021.101454","journal-title":"J Comput Sci"},{"key":"10469_CR32","doi-asserted-by":"publisher","DOI":"10.1016\/j.patcog.2021.108345","author":"MG Rahman","year":"2022","unstructured":"Rahman MG, Islam MZ (2022) Adaptive decision forest: an incremental machine learning framework. Pattern Recognit. https:\/\/doi.org\/10.1016\/j.patcog.2021.108345","journal-title":"Pattern Recognit"},{"issue":"5","key":"10469_CR33","doi-asserted-by":"publisher","first-page":"3775","DOI":"10.1007\/s00500-020-05406-5","volume":"25","author":"N Rokbani","year":"2020","unstructured":"Rokbani N, Kumar R, Abraham A, Alimi AM, Long HV, Priyadarshini I, Son LH (2020) Bi-heuristic ant colony optimization-based approaches for traveling salesman problem. Soft Comput 25(5):3775\u20133794. https:\/\/doi.org\/10.1007\/s00500-020-05406-5","journal-title":"Soft Comput"},{"issue":"153","key":"10469_CR34","doi-asserted-by":"publisher","first-page":"317","DOI":"10.1007\/978-3-031-20738-9_36","volume":"2022","author":"P Rungwachira","year":"2023","unstructured":"Rungwachira P, Thammano A (2023) Hybrid sweep algorithm and modified ant system with threshold for travelling salesman problem. Adv Nat Comput Fuzzy Syst Knowl Discov Icnc-Fskd 2022(153):317\u2013326. https:\/\/doi.org\/10.1007\/978-3-031-20738-9_36","journal-title":"Adv Nat Comput Fuzzy Syst Knowl Discov Icnc-Fskd"},{"issue":"1","key":"10469_CR35","doi-asserted-by":"publisher","first-page":"32","DOI":"10.1016\/j.ejor.2018.06.003","volume":"272","author":"Y Salii","year":"2019","unstructured":"Salii Y (2019) Revisiting dynamic programming for precedence-constrained traveling salesman problem and its time-dependent generalization. Eur J Oper Res 272(1):32\u201342. https:\/\/doi.org\/10.1016\/j.ejor.2018.06.003","journal-title":"Eur J Oper Res"},{"issue":"4","key":"10469_CR36","doi-asserted-by":"publisher","first-page":"3379","DOI":"10.1109\/tase.2021.3119353","volume":"19","author":"W Shao","year":"2022","unstructured":"Shao W, Shao Z, Pi D (2022) An ant colony optimization behavior-based MOEA\/D for distributed heterogeneous hybrid flow shop scheduling problem under nonidentical time-of-use electricity tariffs. IEEE Trans Autom Sci Eng 19(4):3379\u20133394. https:\/\/doi.org\/10.1109\/tase.2021.3119353","journal-title":"IEEE Trans Autom Sci Eng"},{"key":"10469_CR37","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2020.104950","author":"BCH Silva","year":"2020","unstructured":"Silva BCH, Fernandes IFC, Goldbarg MC, Goldbarg EFG (2020) Quota travelling salesman problem with passengers, incomplete ride and collection time optimization by ant-based algorithms. Comput Oper Res. https:\/\/doi.org\/10.1016\/j.cor.2020.104950","journal-title":"Comput Oper Res"},{"key":"10469_CR38","doi-asserted-by":"publisher","first-page":"703","DOI":"10.1016\/j.ecolind.2016.03.043","volume":"67","author":"WL Strong","year":"2016","unstructured":"Strong WL (2016) Biased richness and evenness relationships within Shannon-Wiener index values. Ecol Ind 67:703\u2013713. https:\/\/doi.org\/10.1016\/j.ecolind.2016.03.043","journal-title":"Ecol Ind"},{"issue":"8","key":"10469_CR39","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) Ant system. Futur Gener Comput Syst 16(8):889\u2013914. https:\/\/doi.org\/10.1016\/s0167-739x(00)00043-1","journal-title":"Futur Gener Comput Syst"},{"key":"10469_CR40","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1016\/j.inffus.2023.03.013","volume":"96","author":"M Tang","year":"2023","unstructured":"Tang M, Liao H, Wu X (2023) A Stackelberg game model for large-scale group decision making based on cooperative incentives. Inf Fusion 96:103\u2013116. https:\/\/doi.org\/10.1016\/j.inffus.2023.03.013","journal-title":"Inf Fusion"},{"key":"10469_CR41","doi-asserted-by":"publisher","DOI":"10.1109\/taes.2024.3351110","author":"J Tang","year":"2024","unstructured":"Tang J, Pan Q, Chen Z, Liu G, Yang G, Zhu F, Lao S (2024) An improved artificial electric field algorithm for robot path planning. IEEE Transa Aerosp Electron Syst. https:\/\/doi.org\/10.1109\/taes.2024.3351110","journal-title":"IEEE Transa Aerosp Electron Syst"},{"key":"10469_CR42","doi-asserted-by":"publisher","DOI":"10.1016\/j.compeleceng.2021.107327","author":"HK Tripathy","year":"2021","unstructured":"Tripathy HK, Mishra S, Thakkar HK, Rai D (2021) CARE: a collision-aware mobile robot navigation in grid environment using improved breadth first search. Comput Electri Eng. https:\/\/doi.org\/10.1016\/j.compeleceng.2021.107327","journal-title":"Comput Electri Eng"},{"key":"10469_CR43","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2020.106720","author":"AF Tuani","year":"2020","unstructured":"Tuani AF, Keedwell E, Collett M (2020) Heterogenous adaptive ant colony optimization with 3-opt local search for the travelling salesman problem. Appl Soft Comput. https:\/\/doi.org\/10.1016\/j.asoc.2020.106720","journal-title":"Appl Soft Comput"},{"key":"10469_CR44","doi-asserted-by":"publisher","DOI":"10.1016\/j.aei.2023.101991","author":"H Wang","year":"2023","unstructured":"Wang H, Yi W (2023) A Stackelberg game model for construction waste transportation. Adv Eng Inform. https:\/\/doi.org\/10.1016\/j.aei.2023.101991","journal-title":"Adv Eng Inform"},{"key":"10469_CR45","doi-asserted-by":"publisher","DOI":"10.1016\/j.swevo.2020.100675","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. https:\/\/doi.org\/10.1016\/j.swevo.2020.100675","journal-title":"Swarm Evolut Comput"},{"key":"10469_CR46","doi-asserted-by":"publisher","first-page":"153456","DOI":"10.1109\/access.2021.3128433","volume":"9","author":"C Wu","year":"2021","unstructured":"Wu C, Fu X, Pei J, Dong Z (2021) A novel sparrow search algorithm for the traveling salesman problem. IEEE Access 9:153456\u2013153471. https:\/\/doi.org\/10.1109\/access.2021.3128433","journal-title":"IEEE Access"},{"issue":"9","key":"10469_CR47","doi-asserted-by":"publisher","first-page":"5057","DOI":"10.1109\/tnnls.2021.3068828","volume":"33","author":"Y Wu","year":"2022","unstructured":"Wu Y, Song W, Cao Z, Zhang J, Lim A (2022) Learning improvement heuristics for solving routing problems. IEEE Trans Neural Netw Learn Syst 33(9):5057\u20135069. https:\/\/doi.org\/10.1109\/tnnls.2021.3068828","journal-title":"IEEE Trans Neural Netw Learn Syst"},{"key":"10469_CR48","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2022.119410","author":"L Wu","year":"2023","unstructured":"Wu L, Huang X, Cui J, Liu C, Xiao W (2023) Modified adaptive ant colony optimization algorithm and its application for solving path planning of mobile robot. Expert Syst Appl. https:\/\/doi.org\/10.1016\/j.eswa.2022.119410","journal-title":"Expert Syst Appl"},{"issue":"3","key":"10469_CR49","doi-asserted-by":"publisher","first-page":"1583","DOI":"10.1109\/tits.2020.2972389","volume":"22","author":"X Xu","year":"2021","unstructured":"Xu X, Li J, Zhou M (2021) Delaunay-triangulation-based variable neighborhood search to solve large-scale general colored traveling salesman problems. IEEE Trans Intell Transp Syst 22(3):1583\u20131593. https:\/\/doi.org\/10.1109\/tits.2020.2972389","journal-title":"IEEE Trans Intell Transp Syst"},{"issue":"12","key":"10469_CR50","doi-asserted-by":"publisher","first-page":"4529","DOI":"10.1007\/s10489-020-01799-w","volume":"50","author":"K Yang","year":"2020","unstructured":"Yang K, You X, Liu S, Pan H (2020) A novel ant colony optimization based on game for traveling salesman problem. Appl Intell 50(12):4529\u20134542. https:\/\/doi.org\/10.1007\/s10489-020-01799-w","journal-title":"Appl Intell"},{"key":"10469_CR51","doi-asserted-by":"publisher","first-page":"589","DOI":"10.1016\/j.neunet.2023.02.014","volume":"161","author":"H Yang","year":"2023","unstructured":"Yang H, Zhao M, Yuan L, Yu Y, Li Z, Gu M (2023) Memory-efficient transformer-based network model for traveling salesman problem. Neural Netw 161:589\u2013597. https:\/\/doi.org\/10.1016\/j.neunet.2023.02.014","journal-title":"Neural Netw"},{"key":"10469_CR52","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1155\/2021\/6668345","volume":"2021","author":"M Yousefikhoshbakht","year":"2021","unstructured":"Yousefikhoshbakht M, Volchenkov D (2021) Solving the traveling salesman problem: a modified metaheuristic algorithm. Complexity 2021:1\u201313. https:\/\/doi.org\/10.1155\/2021\/6668345","journal-title":"Complexity"},{"issue":"1","key":"10469_CR53","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1016\/j.compchemeng.2009.09.006","volume":"34","author":"Q Yuan","year":"2010","unstructured":"Yuan Q, Qian F (2010) A hybrid genetic algorithm for twice continuously differentiable NLP problems. Comput Chem Eng 34(1):36\u201341. https:\/\/doi.org\/10.1016\/j.compchemeng.2009.09.006","journal-title":"Comput Chem Eng"},{"issue":"1","key":"10469_CR54","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1007\/s00521-018-3803-8","volume":"32","author":"Y Zhang","year":"2018","unstructured":"Zhang Y, Rong F, Wang Z (2018) Research on cold chain logistic service pricing\u2014based on tripartite Stackelberg game. Neural Comput Appl 32(1):213\u2013222. https:\/\/doi.org\/10.1007\/s00521-018-3803-8","journal-title":"Neural Comput Appl"},{"key":"10469_CR55","doi-asserted-by":"publisher","DOI":"10.1142\/s0219691320500848","author":"W Zhang","year":"2020","unstructured":"Zhang W, Wang C, Lin W, Lin J (2020) Continuous-domain ant colony optimization algorithm based on reinforcement learning. Int J Wavel Multiresolut Inf Process. https:\/\/doi.org\/10.1142\/s0219691320500848","journal-title":"Int J Wavel Multiresolut Inf Process"},{"key":"10469_CR56","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1016\/j.ijar.2022.11.013","volume":"153","author":"Z Zhang","year":"2023","unstructured":"Zhang Z, Xu X, Yue F, Ba Y (2023) Robot path planning based on concept lattice. Int J Approx Reason 153:87\u2013103. https:\/\/doi.org\/10.1016\/j.ijar.2022.11.013","journal-title":"Int J Approx Reason"},{"key":"10469_CR57","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2022.117151","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. https:\/\/doi.org\/10.1016\/j.eswa.2022.117151","journal-title":"Expert Syst Appl"},{"issue":"8","key":"10469_CR58","doi-asserted-by":"publisher","first-page":"10531","DOI":"10.1007\/s13369-022-06579-x","volume":"47","author":"J Zhao","year":"2022","unstructured":"Zhao J, You X, Duan Q, Liu S (2022) Multiple ant colony algorithm combining community relationship network. Arab J Sci Eng 47(8):10531\u201310546. https:\/\/doi.org\/10.1007\/s13369-022-06579-x","journal-title":"Arab J Sci Eng"},{"key":"10469_CR59","doi-asserted-by":"publisher","DOI":"10.1016\/j.engappai.2022.105139","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. https:\/\/doi.org\/10.1016\/j.engappai.2022.105139","journal-title":"Eng Appl Artif Intell"}],"container-title":["Soft Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-025-10469-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00500-025-10469-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-025-10469-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,17]],"date-time":"2025-03-17T06:35:58Z","timestamp":1742193358000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00500-025-10469-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,2]]},"references-count":59,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2025,2]]}},"alternative-id":["10469"],"URL":"https:\/\/doi.org\/10.1007\/s00500-025-10469-3","relation":{},"ISSN":["1432-7643","1433-7479"],"issn-type":[{"type":"print","value":"1432-7643"},{"type":"electronic","value":"1433-7479"}],"subject":[],"published":{"date-parts":[[2025,2]]},"assertion":[{"value":"6 November 2024","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"25 February 2025","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"All the authors declare that they have no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}},{"value":"This article does not contain any studies with human participants or animals performed by any of the authors.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethical approval"}}]}}