{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,17]],"date-time":"2026-03-17T23:06:39Z","timestamp":1773788799176,"version":"3.50.1"},"reference-count":55,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2023,11,6]],"date-time":"2023-11-06T00:00:00Z","timestamp":1699228800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,11,6]],"date-time":"2023-11-06T00:00:00Z","timestamp":1699228800000},"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":"crossref","award":["Grant 61673258"],"award-info":[{"award-number":["Grant 61673258"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]},{"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":["J Supercomput"],"published-print":{"date-parts":[[2024,4]]},"DOI":"10.1007\/s11227-023-05706-1","type":"journal-article","created":{"date-parts":[[2023,11,6]],"date-time":"2023-11-06T08:01:53Z","timestamp":1699257713000},"page":"7171-7206","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Heterogeneous ant colony algorithm based on selective evolution mechanism and game strategy"],"prefix":"10.1007","volume":"80","author":[{"given":"Lisheng","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":[[2023,11,6]]},"reference":[{"key":"5706_CR1","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1016\/j.eswa.2017.01.053","volume":"77","author":"AES Ezugwu","year":"2017","unstructured":"Ezugwu AES, Adewumi AO, Fr\u00eencu ME (2017) Simulated annealing based symbiotic organisms search optimization algorithm for traveling salesman problem. Expert Syst Appl 77:189\u2013210. https:\/\/doi.org\/10.1016\/j.eswa.2017.01.053","journal-title":"Expert Syst Appl"},{"key":"5706_CR2","doi-asserted-by":"publisher","first-page":"164820","DOI":"10.1109\/ACCESS.2021.3133493","volume":"9","author":"BAS Emambocus","year":"2021","unstructured":"Emambocus BAS, Jasser MB, Hamzah M et al (2021) An Enhanced Swap Sequence-Based Particle Swarm Optimization Algorithm to Solve TSP. IEEE Access 9:164820\u2013164836. https:\/\/doi.org\/10.1109\/ACCESS.2021.3133493","journal-title":"IEEE Access"},{"key":"5706_CR3","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1162\/106454699568728","volume":"5","author":"M Dorigo","year":"1999","unstructured":"Dorigo M, Di Caro G, Gambardella LM (1999) Ant algorithms for discrete optimization. Artif Life 5:137\u2013172. https:\/\/doi.org\/10.1162\/106454699568728","journal-title":"Artif Life"},{"key":"5706_CR4","doi-asserted-by":"publisher","unstructured":"Liu S, Xiao Z, You X, Su R (2022) Multistrategy boosted multicolony whale virtual parallel optimization approaches. Knowledge-Based Syst 242:108341. https:\/\/doi.org\/10.1016\/j.knosys.2022.108341","DOI":"10.1016\/j.knosys.2022.108341"},{"key":"5706_CR5","doi-asserted-by":"publisher","first-page":"108126","DOI":"10.1016\/j.cie.2022.108126","volume":"168","author":"JJ Wang","year":"2022","unstructured":"Wang JJ, Wang J (2022) A cooperative memetic algorithm with feedback for the energy-aware distributed flow-shops with flexible assembly scheduling. Comput Ind Eng 168:108126. https:\/\/doi.org\/10.1016\/j.cie.2022.108126","journal-title":"Comput Ind Eng"},{"key":"5706_CR6","doi-asserted-by":"publisher","first-page":"5051","DOI":"10.1109\/TCYB.2020.3026571","volume":"52","author":"Z Pan","year":"2022","unstructured":"Pan Z, Lei D, Wang L (2022) A knowledge-based two-population optimization algorithm for distributed energy-efficient parallel machines scheduling. IEEE Trans Cybern 52:5051\u20135063. https:\/\/doi.org\/10.1109\/TCYB.2020.3026571","journal-title":"IEEE Trans Cybern"},{"key":"5706_CR7","doi-asserted-by":"publisher","first-page":"8588","DOI":"10.1109\/TII.2022.3220860","volume":"19","author":"F Zhao","year":"2022","unstructured":"Zhao F, Zhang H, Wang L (2022) A pareto-based discrete jaya algorithm for multiobjective carbon-efficient distributed blocking flow shop scheduling problem. IEEE Trans Ind Informatics 19:8588\u20138599. https:\/\/doi.org\/10.1109\/TII.2022.3220860","journal-title":"IEEE Trans Ind Informatics"},{"key":"5706_CR8","doi-asserted-by":"publisher","first-page":"3337","DOI":"10.1109\/TCYB.2022.3192112","volume":"53","author":"F Zhao","year":"2023","unstructured":"Zhao F, Di S, Wang L (2023) A hyperheuristic with q-learning for the multiobjective energy-efficient distributed blocking flow shop scheduling problem. IEEE Trans Cybern 53:3337\u20133350. https:\/\/doi.org\/10.1109\/TCYB.2022.3192112","journal-title":"IEEE Trans Cybern"},{"key":"5706_CR9","first-page":"8427","volume":"19","author":"F Zhao","year":"2023","unstructured":"Zhao F, Jiang T, Wang L (2023) Meta-Heuristic Algorithm for Energy-Efficient Distributed No-Wait Flow-Shop Scheduling With Sequence-Dependent Setup Time 19:8427\u20138440","journal-title":"Meta-Heuristic Algorithm for Energy-Efficient Distributed No-Wait Flow-Shop Scheduling With Sequence-Dependent Setup Time"},{"key":"5706_CR10","doi-asserted-by":"publisher","first-page":"6692","DOI":"10.1109\/TII.2022.3192881","volume":"19","author":"F Zhao","year":"2023","unstructured":"Zhao F, Xu Z, Wang L et al (2023) A population-based iterated greedy algorithm for distributed assembly no-wait flow-shop scheduling problem. IEEE Trans Ind Informatics 19:6692\u20136705. https:\/\/doi.org\/10.1109\/TII.2022.3192881","journal-title":"IEEE Trans Ind Informatics"},{"key":"5706_CR11","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 Part B Cybern 26:29\u201341. https:\/\/doi.org\/10.1109\/3477.484436","journal-title":"IEEE Trans Syst Man, Cybern Part B Cybern"},{"key":"5706_CR12","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:53\u201366. https:\/\/doi.org\/10.1109\/4235.585892","journal-title":"IEEE Trans Evol Comput"},{"key":"5706_CR13","doi-asserted-by":"publisher","first-page":"889","DOI":"10.1016\/S0167-739X(00)00043-1","volume":"16","author":"HH Hoos","year":"2000","unstructured":"Hoos HH, St\u00fctzle T (2000) MAX MIN ant system. Futur Gener Comput Syst 16:889\u2013914","journal-title":"Futur Gener Comput Syst"},{"key":"5706_CR14","doi-asserted-by":"publisher","first-page":"1743","DOI":"10.1109\/TCYB.2016.2556742","volume":"47","author":"M Mavrovouniotis","year":"2017","unstructured":"Mavrovouniotis M, Muller FM, Yang S (2017) Ant colony optimization with local search for dynamic traveling salesman problems. IEEE Trans Cybern 47:1743\u20131756. https:\/\/doi.org\/10.1109\/TCYB.2016.2556742","journal-title":"IEEE Trans Cybern"},{"key":"5706_CR15","doi-asserted-by":"publisher","first-page":"1447","DOI":"10.1007\/s00500-020-05230-x","volume":"25","author":"Y Wang","year":"2021","unstructured":"Wang Y, Geng C, Xu N (2021) Assembly sequence optimization based on hybrid symbiotic organisms search and ant colony optimization. Soft Comput 25:1447\u20131464. https:\/\/doi.org\/10.1007\/s00500-020-05230-x","journal-title":"Soft Comput"},{"key":"5706_CR16","doi-asserted-by":"publisher","first-page":"103649","DOI":"10.1016\/j.engappai.2020.103649","volume":"92","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 92:103649. https:\/\/doi.org\/10.1016\/j.engappai.2020.103649","journal-title":"Eng Appl Artif Intell"},{"key":"5706_CR17","doi-asserted-by":"publisher","DOI":"10.1109\/ITAIC54216.2022.9836572","author":"C Zong","year":"2022","unstructured":"Zong C, Yao X, Fu X (2022) Path planning of mobile robot based on improved ant colony algorithm. IEEE Jt Int Inf Technol Artif Intell Conf. https:\/\/doi.org\/10.1109\/ITAIC54216.2022.9836572","journal-title":"IEEE Jt Int Inf Technol Artif Intell Conf"},{"key":"5706_CR18","doi-asserted-by":"publisher","first-page":"1","DOI":"10.3389\/fpls.2023.1101828","volume":"14","author":"H Tian","year":"2023","unstructured":"Tian H, Mo Z, Ma C et al (2023) Design and validation of a multi-objective waypoint planning algorithm for UAV spraying in orchards based on improved ant colony algorithm. Front Plant Sci 14:1\u201314. https:\/\/doi.org\/10.3389\/fpls.2023.1101828","journal-title":"Front Plant Sci"},{"key":"5706_CR19","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2021.107439","volume":"107","author":"Y Wang","year":"2021","unstructured":"Wang Y, Han Z (2021) Ant colony optimization for traveling salesman problem based on parameters optimization. Appl Soft Comput 107:107439. https:\/\/doi.org\/10.1016\/j.asoc.2021.107439","journal-title":"Appl Soft Comput"},{"key":"5706_CR20","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2022.3230042","author":"P Stodola","year":"2022","unstructured":"Stodola P, Nohel J (2022) Adaptive ant colony optimization with node clustering for the multi-depot vehicle routing problem. IEEE Trans Evol Comput. https:\/\/doi.org\/10.1109\/TEVC.2022.3230042","journal-title":"IEEE Trans Evol Comput"},{"key":"5706_CR21","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2023.110540","author":"C Liu","year":"2023","unstructured":"Liu C, Wu L, Xiao W et al (2023) An improved heuristic mechanism ant colony optimization algorithm for solving path planning. Knowledge-Based Syst. https:\/\/doi.org\/10.1016\/j.knosys.2023.110540","journal-title":"Knowledge-Based Syst"},{"key":"5706_CR22","doi-asserted-by":"publisher","first-page":"2390","DOI":"10.1016\/j.ins.2010.02.017","volume":"180","author":"C Twomey","year":"2010","unstructured":"Twomey C, St\u00fctzle T, Dorigo M et al (2010) An analysis of communication policies for homogeneous multi-colony ACO algorithms. Inf Sci (Ny) 180:2390\u20132404. https:\/\/doi.org\/10.1016\/j.ins.2010.02.017","journal-title":"Inf Sci (Ny)"},{"key":"5706_CR23","doi-asserted-by":"publisher","first-page":"5644","DOI":"10.1007\/s10489-020-02099-z","volume":"51","author":"S Li","year":"2021","unstructured":"Li S, You X, Liu S (2021) Multiple ant colony optimization using both novel LSTM network and adaptive Tanimoto communication strategy. Appl Intell 51:5644\u20135664. https:\/\/doi.org\/10.1007\/s10489-020-02099-z","journal-title":"Appl Intell"},{"key":"5706_CR24","doi-asserted-by":"publisher","first-page":"61628","DOI":"10.1109\/ACCESS.2019.2915673","volume":"7","author":"H Zhu","year":"2019","unstructured":"Zhu H, You X, Liu S (2019) Multiple ant colony optimization based on pearson correlation coefficient. IEEE Access 7:61628\u201361638. https:\/\/doi.org\/10.1109\/ACCESS.2019.2915673","journal-title":"IEEE Access"},{"key":"5706_CR25","doi-asserted-by":"crossref","unstructured":"Xu M, You X, Liu S (2017) Dual Population Ant Colony Optimization Algorithm. IEEE Access 5:","DOI":"10.1109\/ACCESS.2017.2746569"},{"key":"5706_CR26","doi-asserted-by":"publisher","first-page":"154153","DOI":"10.1109\/ACCESS.2020.3011936","volume":"8","author":"L Meng","year":"2020","unstructured":"Meng L, You X, Liu S (2020) Multi-colony collaborative ant optimization algorithm based on cooperative game mechanism. IEEE Access 8:154153\u2013154165. https:\/\/doi.org\/10.1109\/ACCESS.2020.3011936","journal-title":"IEEE Access"},{"key":"5706_CR27","doi-asserted-by":"publisher","first-page":"4679","DOI":"10.1007\/s40747-022-00716-7","volume":"8","author":"Y Mo","year":"2022","unstructured":"Mo Y, You X, Liu S (2022) Multi-colony ant optimization with dynamic collaborative mechanism and cooperative game. Complex Intell Syst 8:4679\u20134696. https:\/\/doi.org\/10.1007\/s40747-022-00716-7","journal-title":"Complex Intell Syst"},{"key":"5706_CR28","doi-asserted-by":"publisher","DOI":"10.1007\/s00500-023-08689-6","author":"L Wu","year":"2023","unstructured":"Wu L, You X, Liu S (2023) Multi-ant colony optimization based on bidirectional induction mechanism and cooperative game. Soft Comput. https:\/\/doi.org\/10.1007\/s00500-023-08689-6","journal-title":"Soft Comput"},{"key":"5706_CR29","doi-asserted-by":"publisher","first-page":"1657","DOI":"10.1007\/s13369-021-06033-4","volume":"47","author":"Y Mo","year":"2022","unstructured":"Mo Y, You X, Liu S (2022) Multi-colony ant optimization based on pheromone fusion mechanism of cooperative game. Arab J Sci Eng 47:1657\u20131674. https:\/\/doi.org\/10.1007\/s13369-021-06033-4","journal-title":"Arab J Sci Eng"},{"key":"5706_CR30","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:3903\u20133920. https:\/\/doi.org\/10.1007\/s00500-022-06833-2","journal-title":"Soft Comput"},{"key":"5706_CR31","doi-asserted-by":"publisher","first-page":"6552","DOI":"10.1007\/s10489-021-02774-9","volume":"52","author":"D Chen","year":"2022","unstructured":"Chen D, You XM, Liu S (2022) Ant colony algorithm with Stackelberg game and multi-strategy fusion. Appl Intell 52:6552\u20136574. https:\/\/doi.org\/10.1007\/s10489-021-02774-9","journal-title":"Appl Intell"},{"key":"5706_CR32","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:10531\u201310546. https:\/\/doi.org\/10.1007\/s13369-022-06579-x","journal-title":"Arab J Sci Eng"},{"key":"5706_CR33","doi-asserted-by":"publisher","DOI":"10.1016\/j.engappai.2022.105139","author":"X Zhou","year":"2022","unstructured":"Zhou X, Ma H, Gu J et al (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"},{"key":"5706_CR34","doi-asserted-by":"publisher","first-page":"44","DOI":"10.2991\/ijcis.d.200117.001","volume":"13","author":"W Gao","year":"2020","unstructured":"Gao W (2020) New ant colony optimization algorithm for the traveling salesman problem. Int J Comput Intell Syst 13:44\u201355. https:\/\/doi.org\/10.2991\/ijcis.d.200117.001","journal-title":"Int J Comput Intell Syst"},{"key":"5706_CR35","doi-asserted-by":"publisher","DOI":"10.1155\/2021\/6642009","author":"P Du","year":"2021","unstructured":"Du P, Liu N, Zhang H, Lu J (2021) An improved ant colony optimization based on an adaptive heuristic factor for the traveling salesman problem. J Adv Transp. https:\/\/doi.org\/10.1155\/2021\/6642009","journal-title":"J Adv Transp"},{"key":"5706_CR36","doi-asserted-by":"publisher","first-page":"752","DOI":"10.1007\/s10489-020-01841-x","volume":"51","author":"H Pan","year":"2021","unstructured":"Pan H, You X, Liu S, Zhang D (2021) Pearson correlation coefficient-based pheromone refactoring mechanism for multi-colony ant colony optimization. Appl Intell 51:752\u2013774. https:\/\/doi.org\/10.1007\/s10489-020-01841-x","journal-title":"Appl Intell"},{"key":"5706_CR37","doi-asserted-by":"publisher","first-page":"157303","DOI":"10.1109\/ACCESS.2019.2949860","volume":"7","author":"D Zhang","year":"2019","unstructured":"Zhang D, You X, Liu S, Yang K (2019) Multi-colony ant colony optimization based on generalized jaccard similarity recommendation strategy. IEEE Access 7:157303\u2013157317. https:\/\/doi.org\/10.1109\/ACCESS.2019.2949860","journal-title":"IEEE Access"},{"key":"5706_CR38","doi-asserted-by":"publisher","first-page":"4387","DOI":"10.1007\/s00500-016-2071-8","volume":"21","author":"W Deng","year":"2017","unstructured":"Deng W, Zhao H, Zou L et al (2017) A novel collaborative optimization algorithm in solving complex optimization problems. Soft Comput 21:4387\u20134398. https:\/\/doi.org\/10.1007\/s00500-016-2071-8","journal-title":"Soft Comput"},{"key":"5706_CR39","doi-asserted-by":"publisher","first-page":"154471","DOI":"10.1109\/ACCESS.2020.3002817","volume":"8","author":"J Yu","year":"2020","unstructured":"Yu J, You X, Liu S (2020) Dynamic density clustering ant colony algorithm with filtering recommendation backtracking mechanism. IEEE Access 8:154471\u2013154484. https:\/\/doi.org\/10.1109\/ACCESS.2020.3002817","journal-title":"IEEE Access"},{"key":"5706_CR40","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. https:\/\/doi.org\/10.1007\/s00500-016-2432-3","journal-title":"Soft Comput"},{"key":"5706_CR41","doi-asserted-by":"publisher","first-page":"110219","DOI":"10.1016\/j.asoc.2023.110219","volume":"139","author":"GK Jati","year":"2023","unstructured":"Jati GK, Kuwanto G, Hashmi T, Widjaja H (2023) Discrete komodo algorithm for traveling salesman problem[Formula presented]. Appl Soft Comput 139:110219. https:\/\/doi.org\/10.1016\/j.asoc.2023.110219","journal-title":"Appl Soft Comput"},{"key":"5706_CR42","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2022.108746","volume":"121","author":"P Karakostas","year":"2022","unstructured":"Karakostas P, Sifaleras A (2022) A double-adaptive general variable neighborhood search algorithm for the solution of the traveling salesman problem. Appl Soft Comput 121:108746. https:\/\/doi.org\/10.1016\/j.asoc.2022.108746","journal-title":"Appl Soft Comput"},{"key":"5706_CR43","doi-asserted-by":"publisher","first-page":"107085","DOI":"10.1016\/j.asoc.2021.107085","volume":"102","author":"Y Huang","year":"2021","unstructured":"Huang Y, Shen XN, You X (2021) A discrete shuffled frog-leaping algorithm based on heuristic information for traveling salesman problem. Appl Soft Comput 102:107085. https:\/\/doi.org\/10.1016\/j.asoc.2021.107085","journal-title":"Appl Soft Comput"},{"key":"5706_CR44","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"},{"key":"5706_CR45","doi-asserted-by":"publisher","first-page":"2935","DOI":"10.1007\/s00521-017-2880-4","volume":"30","author":"MM Alipour","year":"2018","unstructured":"Alipour MM, Razavi SN, Feizi Derakhshi MR, Balafar MA (2018) A hybrid algorithm using a genetic algorithm and multiagent reinforcement learning heuristic to solve the traveling salesman problem. Neural Comput Appl 30:2935\u20132951. https:\/\/doi.org\/10.1007\/s00521-017-2880-4","journal-title":"Neural Comput Appl"},{"key":"5706_CR46","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. https:\/\/doi.org\/10.1007\/s00500-014-1279-8","journal-title":"Soft Comput"},{"key":"5706_CR47","doi-asserted-by":"publisher","first-page":"97142","DOI":"10.1109\/ACCESS.2022.3205756","volume":"10","author":"J Wang","year":"2022","unstructured":"Wang J, Zhang P, Zhang H et al (2022) A carnivorous plant algorithm with heuristic decoding method for traveling salesman problem. IEEE Access 10:97142\u201397164. https:\/\/doi.org\/10.1109\/ACCESS.2022.3205756","journal-title":"IEEE Access"},{"key":"5706_CR48","doi-asserted-by":"publisher","first-page":"108469","DOI":"10.1016\/j.asoc.2022.108469","volume":"118","author":"Z Zhang","year":"2022","unstructured":"Zhang Z, Han Y (2022) Discrete sparrow search algorithm for symmetric traveling salesman problem. Appl Soft Comput 118:108469\u201398. https:\/\/doi.org\/10.1016\/j.asoc.2022.108469","journal-title":"Appl Soft Comput"},{"key":"5706_CR49","doi-asserted-by":"publisher","first-page":"751","DOI":"10.23919\/JSEE.2020.000050","volume":"31","author":"Z Daoqing","year":"2020","unstructured":"Daoqing Z, Mingyan J (2020) Parallel discrete lion swarm optimization algorithm for solving traveling salesman problem. J Syst Eng Electron 31:751\u2013760","journal-title":"J Syst Eng Electron"},{"key":"5706_CR50","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2019.105950","volume":"86","author":"X Li","year":"2020","unstructured":"Li X, Hu Y, Li M, Zheng J (2020) Fault diagnostics between different type of components: a transfer learning approach. Appl Soft Comput J 86:105950. https:\/\/doi.org\/10.1016\/j.asoc.2019.105950","journal-title":"Appl Soft Comput J"},{"key":"5706_CR51","doi-asserted-by":"publisher","first-page":"201606","DOI":"10.1109\/ACCESS.2020.3035899","volume":"8","author":"C Wu","year":"2020","unstructured":"Wu C, Fu X (2020) An agglomerative greedy brain storm optimization algorithm for solving the TSP. IEEE Access 8:201606\u2013201621. https:\/\/doi.org\/10.1109\/ACCESS.2020.3035899","journal-title":"IEEE Access"},{"key":"5706_CR52","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 J 68:83\u201391. https:\/\/doi.org\/10.1016\/j.asoc.2018.03.048","journal-title":"Appl Soft Comput J"},{"key":"5706_CR53","doi-asserted-by":"publisher","first-page":"7627","DOI":"10.1007\/s00521-021-06883-x","volume":"34","author":"\u0130 \u0130lhan","year":"2022","unstructured":"\u0130lhan \u0130, G\u00f6kmen G (2022) A list-based simulated annealing algorithm with crossover operator for the traveling salesman problem. Neural Comput Appl 34:7627\u20137652. https:\/\/doi.org\/10.1007\/s00521-021-06883-x","journal-title":"Neural Comput Appl"},{"key":"5706_CR54","doi-asserted-by":"publisher","DOI":"10.1016\/j.jocs.2021.101454","volume":"55","author":"K Panwar","year":"2021","unstructured":"Panwar K, Deep K (2021) Transformation operators based grey wolf optimizer for travelling salesman problem. J Comput Sci 55:101454. https:\/\/doi.org\/10.1016\/j.jocs.2021.101454","journal-title":"J Comput Sci"},{"key":"5706_CR55","doi-asserted-by":"publisher","first-page":"82","DOI":"10.1016\/j.neucom.2018.09.039","volume":"321","author":"M Saadatmand-Tarzjan","year":"2018","unstructured":"Saadatmand-Tarzjan M (2018) On computational complexity of the constructive-optimizer neural network for the traveling salesman problem. Neurocomputing 321:82\u201391. https:\/\/doi.org\/10.1016\/j.neucom.2018.09.039","journal-title":"Neurocomputing"}],"container-title":["The Journal of Supercomputing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-023-05706-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11227-023-05706-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-023-05706-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,25]],"date-time":"2024-03-25T11:18:03Z","timestamp":1711365483000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11227-023-05706-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,11,6]]},"references-count":55,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2024,4]]}},"alternative-id":["5706"],"URL":"https:\/\/doi.org\/10.1007\/s11227-023-05706-1","relation":{},"ISSN":["0920-8542","1573-0484"],"issn-type":[{"value":"0920-8542","type":"print"},{"value":"1573-0484","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,11,6]]},"assertion":[{"value":"30 September 2023","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"6 November 2023","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 that they have no known competing financial interests or personal relationships that could have appeared to influence the work reported in this paper.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}},{"value":"Our work does not involve human and animal research.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethical approval"}}]}}