{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,2]],"date-time":"2026-04-02T15:24:56Z","timestamp":1775143496850,"version":"3.50.1"},"reference-count":48,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2022,12,15]],"date-time":"2022-12-15T00:00:00Z","timestamp":1671062400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2022,12,15]],"date-time":"2022-12-15T00:00:00Z","timestamp":1671062400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"name":"National Key Research and Development Program of China","award":["2018AAA0100100"],"award-info":[{"award-number":["2018AAA0100100"]}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["62173345"],"award-info":[{"award-number":["62173345"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Major Scientific and Technological Projects of China National Petroleum Corporation","award":["ZD2019-183-008"],"award-info":[{"award-number":["ZD2019-183-008"]}]},{"DOI":"10.13039\/501100012226","name":"Fundamental Research Funds for the Central Universities","doi-asserted-by":"publisher","award":["20CX05002A"],"award-info":[{"award-number":["20CX05002A"]}],"id":[{"id":"10.13039\/501100012226","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100012226","name":"Fundamental Research Funds for the Central Universities","doi-asserted-by":"publisher","award":["20CX05012A"],"award-info":[{"award-number":["20CX05012A"]}],"id":[{"id":"10.13039\/501100012226","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Joint fund of Science and Technology Department of Liaoning Province","award":["2021030195-JH3\/103"],"award-info":[{"award-number":["2021030195-JH3\/103"]}]},{"DOI":"10.13039\/501100011259","name":"State Key Laboratory of Robotics","doi-asserted-by":"crossref","award":["2021-KF-22-07"],"award-info":[{"award-number":["2021-KF-22-07"]}],"id":[{"id":"10.13039\/501100011259","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Complex Intell. Syst."],"published-print":{"date-parts":[[2023,8]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>The ant colony optimization (ACO) is one efficient approach for solving the travelling salesman problem (TSP). Here, we propose a hybrid algorithm based on state-adaptive slime mold model and fractional-order ant system (SSMFAS) to address the TSP. The state-adaptive slime mold (SM) model with two targeted auxiliary strategies emphasizes some critical connections and balances the exploration and exploitation ability of SSMFAS. The consideration of fractional-order calculus in the ant system (AS) takes full advantage of the neighboring information. The pheromone update rule of AS is modified to dynamically integrate the flux information of SM. To understand the search behavior of the proposed algorithm, some mathematical proofs of convergence analysis are given. The experimental results validate the efficiency of the hybridization and demonstrate that the proposed algorithm has the competitive ability of finding the better solutions on TSP instances compared with some state-of-the-art algorithms.<\/jats:p>","DOI":"10.1007\/s40747-022-00932-1","type":"journal-article","created":{"date-parts":[[2022,12,15]],"date-time":"2022-12-15T07:02:51Z","timestamp":1671087771000},"page":"3951-3970","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":54,"title":["A hybrid algorithm based on state-adaptive slime mold model and fractional-order ant system for the travelling salesman problem"],"prefix":"10.1007","volume":"9","author":[{"given":"Xiaoling","family":"Gong","sequence":"first","affiliation":[]},{"given":"Ziheng","family":"Rong","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4316-932X","authenticated-orcid":false,"given":"Jian","family":"Wang","sequence":"additional","affiliation":[]},{"given":"Kai","family":"Zhang","sequence":"additional","affiliation":[]},{"given":"Shengxiang","family":"Yang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,12,15]]},"reference":[{"key":"932_CR1","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1007\/978-1-4684-2001-2_9","volume-title":"Reducibility among combinatorial problems","author":"RM Karp","year":"1972","unstructured":"Karp RM (1972) Reducibility among combinatorial problems. Springer, Boston, MA, pp 85\u2013103. https:\/\/doi.org\/10.1007\/978-1-4684-2001-2_9"},{"key":"932_CR2","volume-title":"Computers and intractability: a guide to the theory of NP-completeness","author":"MR Garey","year":"1979","unstructured":"Garey MR, Johnson DS (1979) Computers and intractability: a guide to the theory of NP-completeness. W. H. Freeman & Co., USA"},{"key":"932_CR3","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/0-306-48213-4_1","volume-title":"The traveling salesman problem: applications, formulations and variations","author":"AP Punnen","year":"2007","unstructured":"Punnen AP (2007) The traveling salesman problem: applications, formulations and variations. Springer, Boston, MA, pp 1\u201328. https:\/\/doi.org\/10.1007\/0-306-48213-4_1"},{"key":"932_CR4","unstructured":"Dorigo M (1992) Optimization, learning and natural algorithms. PhD thesis, Politecnico Di Milano, Italy"},{"key":"932_CR5","doi-asserted-by":"publisher","first-page":"250","DOI":"10.1007\/0-306-48056-5_9","volume-title":"The ant colony optimization metaheuristic: algorithms, applications, and advances","author":"M Dorigo","year":"2003","unstructured":"Dorigo M, St\u00fctzle T (2003) The ant colony optimization metaheuristic: algorithms, applications, and advances. Springer, Boston, MA, pp 250\u2013285. https:\/\/doi.org\/10.1007\/0-306-48056-5_9"},{"key":"932_CR6","doi-asserted-by":"publisher","unstructured":"Wang K-P, Huang L, Zhou C-G, Pang W (2003) Particle swarm optimization for traveling salesman problem. In: Proceedings of the 2003 international conference on machine learning and cybernetics (IEEE Cat. No.03EX693), vol. 3, pp. 1583\u201315853. https:\/\/doi.org\/10.1109\/ICMLC.2003.1259748","DOI":"10.1109\/ICMLC.2003.1259748"},{"issue":"3","key":"932_CR7","doi-asserted-by":"publisher","first-page":"432","DOI":"10.1016\/j.cor.2009.03.004","volume":"37","author":"Y Marinakis","year":"2010","unstructured":"Marinakis Y, Marinaki M (2010) A hybrid multi-swarm particle swarm optimization algorithm for the probabilistic traveling salesman problem. Comput Oper Res 37(3):432\u2013442. https:\/\/doi.org\/10.1016\/j.cor.2009.03.004","journal-title":"Comput Oper Res"},{"key":"932_CR8","doi-asserted-by":"publisher","first-page":"70","DOI":"10.1016\/j.ins.2017.08.067","volume":"421","author":"Y Zhong","year":"2017","unstructured":"Zhong Y, Lin J, Wang L, Zhang H (2017) Hybrid discrete artificial bee colony algorithm with threshold acceptance criterion for traveling salesman problem. Inf Sci 421:70\u201384. https:\/\/doi.org\/10.1016\/j.ins.2017.08.067","journal-title":"Inf Sci"},{"key":"932_CR9","doi-asserted-by":"publisher","first-page":"12","DOI":"10.1016\/j.knosys.2018.05.002","volume":"156","author":"D Pandit","year":"2018","unstructured":"Pandit D, Zhang L, Chattopadhyay S, Lim CP, Liu C (2018) A scattering and repulsive swarm intelligence algorithm for solving global optimization problems. Knowl-Based Syst 156:12\u201342. https:\/\/doi.org\/10.1016\/j.knosys.2018.05.002","journal-title":"Knowl-Based Syst"},{"key":"932_CR10","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2021.107199","volume":"227","author":"SKR Kanna","year":"2021","unstructured":"Kanna SKR, Sivakumar K, Lingaraj N (2021) Development of deer hunting linked earthworm optimization algorithm for solving large scale traveling salesman problem. Knowl-Based Syst 227:107199. https:\/\/doi.org\/10.1016\/j.knosys.2021.107199","journal-title":"Knowl-Based Syst"},{"key":"932_CR11","doi-asserted-by":"publisher","DOI":"10.1093\/oso\/9780195131581.001.0001","volume-title":"Swarm intelligence: from natural to artificial systems","author":"E Bonabeau","year":"1999","unstructured":"Bonabeau E, Dorigo M, Theraulaz G (1999) Swarm intelligence: from natural to artificial systems. Oxford University Press, USA"},{"key":"932_CR12","doi-asserted-by":"publisher","unstructured":"Stutzle T, Hoos H (1997) Max-min ant system and local search for the traveling salesman problem. In: Proceedings of 1997 IEEE international conference on evolutionary computation (ICEC \u201997), pp. 309\u2013314. https:\/\/doi.org\/10.1109\/ICEC.1997.592327","DOI":"10.1109\/ICEC.1997.592327"},{"key":"932_CR13","unstructured":"Bullnheimer B, Hartl RF, Strau\u00df C (1997) A new rank based version of the ant system. a computational study. Working Papers SFB \u201cAdaptive information systems and modelling in economics and management science\u201d\u00a01, SFB Adaptive Information Systems and Modelling in Economics and Management Science, WU Vienna University of Economics and Business, Vienna. https:\/\/epub.wu.ac.at\/616\/"},{"issue":"4","key":"932_CR14","doi-asserted-by":"publisher","first-page":"358","DOI":"10.1109\/TEVC.2002.802444","volume":"6","author":"T Stutzle","year":"2002","unstructured":"Stutzle T, Dorigo M (2002) A short convergence proof for a class of ant colony optimization algorithms. IEEE Trans Evol Comput 6(4):358\u2013365. https:\/\/doi.org\/10.1109\/TEVC.2002.802444","journal-title":"IEEE Trans Evol Comput"},{"key":"932_CR15","doi-asserted-by":"publisher","unstructured":"Gong X, Rong Z, Gao T, Pu Y, Wang J (2019) An improved ant colony optimization algorithm based on fractional order memory for traveling salesman problems. In: 2019 IEEE symposium series on computational intelligence (SSCI), pp. 1516\u20131522. https:\/\/doi.org\/10.1109\/SSCI44817.2019.9003009","DOI":"10.1109\/SSCI44817.2019.9003009"},{"key":"932_CR16","doi-asserted-by":"publisher","DOI":"10.1016\/j.swevo.2021.101014","volume":"69","author":"Y-F Pu","year":"2022","unstructured":"Pu Y-F, Siarry P, Zhu W-Y, Wang J, Zhang N (2022) Fractional-order ant colony algorithm: a fractional long term memory based cooperative learning approach. Swarm Evol Comput 69:101014. https:\/\/doi.org\/10.1016\/j.swevo.2021.101014","journal-title":"Swarm Evol Comput"},{"key":"932_CR17","doi-asserted-by":"publisher","first-page":"1669","DOI":"10.1007\/s00500-016-2432-3","volume":"22","author":"S Gulcu","year":"2018","unstructured":"Gulcu S, Mahi M, Baykan O, 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":"932_CR18","doi-asserted-by":"publisher","unstructured":"Mahi M, \u00d6mer Kaan Baykan Kodaz H (2015) A new hybrid method based on particle swarm optimization, ant colony optimization and 3-opt algorithms for traveling salesman problem. Appl Soft Comput 30:484\u2013490. https:\/\/doi.org\/10.1016\/j.asoc.2015.01.068","DOI":"10.1016\/j.asoc.2015.01.068"},{"key":"932_CR19","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevLett.99.068104","volume":"99","author":"T Nakagaki","year":"2007","unstructured":"Nakagaki T, Iima M, Ueda T, Nishiura Y, Saigusa T, Tero A, Kobayashi R, Showalter K (2007) Minimum-risk path finding by an adaptive amoebal network. Phys Rev Lett 99:068104. https:\/\/doi.org\/10.1103\/PhysRevLett.99.068104","journal-title":"Phys Rev Lett"},{"issue":"2","key":"932_CR20","doi-asserted-by":"publisher","first-page":"242","DOI":"10.1016\/S1672-6529(13)60220-6","volume":"10","author":"A Adamatzky","year":"2013","unstructured":"Adamatzky A, Martinez GJ (2013) Bio-imitation of Mexican migration routes to the USA with slime mould on 3D terrains. J Bionic Eng 10(2):242\u2013250. https:\/\/doi.org\/10.1016\/S1672-6529(13)60220-6","journal-title":"J Bionic Eng"},{"key":"932_CR21","doi-asserted-by":"publisher","first-page":"470","DOI":"10.1038\/35035159","volume":"407","author":"T Nakagaki","year":"2000","unstructured":"Nakagaki T, Yamada H, Toth A (2000) Maze-solving by an amoeboid organism. Nature 407:470\u2013470. https:\/\/doi.org\/10.1038\/35035159","journal-title":"Nature"},{"issue":"5964","key":"932_CR22","doi-asserted-by":"publisher","first-page":"439","DOI":"10.1126\/science.1177894","volume":"327","author":"A Tero","year":"2010","unstructured":"Tero A, Takagi S, Saigusa T, Ito K, Bebber DP, Fricker MD, Yumiki K, Kobayashi R, Nakagaki T (2010) Rules for biologically inspired adaptive network design. Science 327(5964):439\u2013442. https:\/\/doi.org\/10.1126\/science.1177894","journal-title":"Science"},{"key":"932_CR23","doi-asserted-by":"publisher","first-page":"1195","DOI":"10.1007\/s11047-011-9255-z","volume":"10","author":"A Adamatzky","year":"2011","unstructured":"Adamatzky A, Martinez GJ, Chapa-Vergara SV, Asomoza-Palacio R, Stephens CR (2011) Approximating Mexican highways with slime mould. Nat Comput 10:1195\u20131214. https:\/\/doi.org\/10.1007\/s11047-011-9255-z","journal-title":"Nat Comput"},{"key":"932_CR24","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1007\/s11047-014-9459-0","volume":"15","author":"M-AI Tsompanas","year":"2016","unstructured":"Tsompanas M-AI, Sirakoulis GC, Adamatzky AI (2016) Physarum in silicon: the Greek motorways study. Nat Comput 15:279\u2013295. https:\/\/doi.org\/10.1007\/s11047-014-9459-0","journal-title":"Nat Comput"},{"issue":"4","key":"932_CR25","doi-asserted-by":"publisher","first-page":"553","DOI":"10.1016\/j.jtbi.2006.07.015","volume":"244","author":"A Tero","year":"2007","unstructured":"Tero A, Kobayashi R, Nakagaki T (2007) A mathematical model for adaptive transport network in path finding by true slime mold. J Theor Biol 244(4):553\u2013564. https:\/\/doi.org\/10.1016\/j.jtbi.2006.07.015","journal-title":"J Theor Biol"},{"issue":"19","key":"932_CR26","doi-asserted-by":"publisher","first-page":"9959","DOI":"10.1016\/j.amc.2013.04.023","volume":"219","author":"X Zhang","year":"2013","unstructured":"Zhang X, Huang S, Hu Y, Zhang Y, Mahadevan S, Deng Y (2013) Solving 0\u20131 knapsack problems based on amoeboid organism algorithm. Appl Math Comput 219(19):9959\u20139970. https:\/\/doi.org\/10.1016\/j.amc.2013.04.023","journal-title":"Appl Math Comput"},{"key":"932_CR27","doi-asserted-by":"publisher","first-page":"2168","DOI":"10.1109\/TCYB.2018.2872808","volume":"50","author":"C Gao","year":"2020","unstructured":"Gao C, Zhang X, Yue Z, Wei D (2020) An accelerated physarum solver for network optimization. IEEE Trans Cybern 50:2168\u20132267. https:\/\/doi.org\/10.1109\/TCYB.2018.2872808","journal-title":"IEEE Trans Cybern"},{"key":"932_CR28","doi-asserted-by":"publisher","first-page":"340","DOI":"10.1016\/j.apm.2017.07.032","volume":"55","author":"S Xu","year":"2018","unstructured":"Xu S, Jiang W, Deng X, Shou Y (2018) A modified physarum-inspired model for the user equilibrium traffic assignment problem. Appl Math Model 55:340\u2013353. https:\/\/doi.org\/10.1016\/j.apm.2017.07.032","journal-title":"Appl Math Model"},{"key":"932_CR29","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1016\/j.asoc.2017.07.043","volume":"61","author":"C Gao","year":"2017","unstructured":"Gao C, Chen S, Li X, Huang J, Zhang Z (2017) A physarum-inspired optimization algorithm for load-shedding problem. Appl Soft Comput 61:239\u2013255. https:\/\/doi.org\/10.1016\/j.asoc.2017.07.043","journal-title":"Appl Soft Comput"},{"key":"932_CR30","doi-asserted-by":"publisher","first-page":"519","DOI":"10.1007\/978-3-319-26662-6_26","volume-title":"Slime mould inspired applications on graph-optimization problems","author":"X Zhang","year":"2016","unstructured":"Zhang X, Gao C, Deng Y, Zhang Z (2016) Slime mould inspired applications on graph-optimization problems. Springer, Cham, pp 519\u2013562. https:\/\/doi.org\/10.1007\/978-3-319-26662-6_26"},{"issue":"1","key":"932_CR31","doi-asserted-by":"publisher","first-page":"244","DOI":"10.1080\/00207543.2016.1203075","volume":"55","author":"X Zhang","year":"2017","unstructured":"Zhang X, Chan FTS, Adamatzky A, Mahadevan S, Yang H, Zhang Z, Deng Y (2017) An intelligent physarum solver for supply chain network design under profit maximization and oligopolistic competition. Int J Prod Res 55(1):244\u2013263. https:\/\/doi.org\/10.1080\/00207543.2016.1203075","journal-title":"Int J Prod Res"},{"key":"932_CR32","doi-asserted-by":"publisher","first-page":"202508","DOI":"10.1109\/ACCESS.2020.3035584","volume":"8","author":"M Liu","year":"2020","unstructured":"Liu M, Li Y, Li A, Huo Q, Zhang N, Qu N, Zhu M, Chen L (2020) A slime mold-ant colony fusion algorithm for solving traveling salesman problem. IEEE Access 8:202508\u2013202521. https:\/\/doi.org\/10.1109\/ACCESS.2020.3035584","journal-title":"IEEE Access"},{"key":"932_CR33","doi-asserted-by":"publisher","unstructured":"Cai J, Perfect E, Cheng C-L, Hu X (2014) Generalized modeling of spontaneous imbibition based on Hagen-Poiseuille flow in tortuous capillaries with variably shaped apertures. Langmuir 30(18):5142\u20135151. https:\/\/doi.org\/10.1021\/la5007204","DOI":"10.1021\/la5007204"},{"key":"932_CR34","doi-asserted-by":"crossref","unstructured":"Tanyi EK, Burton BT, Narimanov EE, Noginov MA (2016) Thermal radiation of er doped crystals: studying the range of applicability of the kirchhoff\u2019s law. In: Conference on Lasers and Electro-Optics, pp. 2\u201330. Optica Publishing Group, USA. http:\/\/opg.optica.org\/abstract.cfm?URI=CLEO_SI-2016-JW2A.30","DOI":"10.1364\/CLEO_AT.2016.JW2A.30"},{"key":"932_CR35","doi-asserted-by":"publisher","first-page":"386","DOI":"10.1016\/j.neunet.2021.06.021","volume":"143","author":"H Zhang","year":"2021","unstructured":"Zhang H, Pu Y-F, Xie X, Zhang B, Wang J, Huang T (2021) A global neural network learning machine: coupled integer and fractional calculus operator with an adaptive learning scheme. Neural Netw 143:386\u2013399. https:\/\/doi.org\/10.1016\/j.neunet.2021.06.021","journal-title":"Neural Netw"},{"key":"932_CR36","unstructured":"Oldham KB, Spanier J (eds) (1974) The fractional calculus theory and applications of differentiation and integration to arbitrary order. Academic Press, USA"},{"key":"932_CR37","unstructured":"Samko SG, Kilbas A, Marichev O (eds) (1993) Fractional Integrals and Derivatives: Theory and Applications. Gordon and Breach Science Publishers, USA"},{"key":"932_CR38","unstructured":"Podlubny I (ed) (1998) Fractional differential equations: an introduction to fractional derivatives, fractional differential equations, to methods of their solution and some of their applications. Academic Press, USA"},{"issue":"24","key":"932_CR39","doi-asserted-by":"publisher","first-page":"6287","DOI":"10.1088\/1751-8113\/40\/24\/003","volume":"40","author":"OP Agrawal","year":"2007","unstructured":"Agrawal OP (2007) Fractional variational calculus in terms of Riesz fractional derivatives. J Phys Math Theor 40(24):6287\u20136303","journal-title":"J Phys Math Theor"},{"key":"932_CR40","doi-asserted-by":"crossref","unstructured":"Qian T, Zhang Z, Gao C, Wu Y, Liu Y (2013) An ant colony system based on the physarum network. In: Tan Y, Shi Y, Mo H (eds) Advances in swarm intelligence. Springer, Berlin, Heidelberg, pp 297\u2013305","DOI":"10.1007\/978-3-642-38703-6_35"},{"key":"932_CR41","doi-asserted-by":"publisher","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 97(part B):106720. https:\/\/doi.org\/10.1016\/j.asoc.2020.106720","DOI":"10.1016\/j.asoc.2020.106720"},{"key":"932_CR42","volume-title":"Statistical methods and scientific inference","author":"RA Fisher","year":"1956","unstructured":"Fisher RA (1956) Statistical methods and scientific inference. Oliver and Boyd, London"},{"issue":"6","key":"932_CR43","doi-asserted-by":"publisher","first-page":"80","DOI":"10.2307\/3001968","volume":"1","author":"F Wilcoxon","year":"1945","unstructured":"Wilcoxon F (1945) Individual comparisons by ranking methods. Biometrics 1(6):80\u201383. https:\/\/doi.org\/10.2307\/3001968","journal-title":"Biometrics"},{"key":"932_CR44","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2021.107275","volume":"105","author":"M Gunduz","year":"2021","unstructured":"Gunduz M, Aslan M (2021) Djaya: a discrete jaya algorithm for solving traveling salesman problem. Appl Soft Comput 105:107275. https:\/\/doi.org\/10.1016\/j.asoc.2021.107275","journal-title":"Appl Soft Comput"},{"key":"932_CR45","unstructured":"da Costa PRdO, Rhuggenaath J, Zhang Y, Akcay A (2020) Learning 2-opt heuristics for the traveling salesman problem via deep reinforcement learning. In: Pan SJ, Sugiyama M (eds.) Proceedings of The 12th Asian Conference on Machine Learning. Proceedings of Machine Learning Research, vol. 129, pp. 465\u2013480. PMLR. https:\/\/proceedings.mlr.press\/v129\/costa20a.html"},{"key":"932_CR46","unstructured":"Perron L, Furnon V OR-Tools. https:\/\/developers.google.com\/optimization\/"},{"issue":"1","key":"932_CR47","doi-asserted-by":"publisher","first-page":"106","DOI":"10.1016\/S0377-2217(99)00284-2","volume":"126","author":"K Helsgaun","year":"2000","unstructured":"Helsgaun K (2000) An effective implementation of the Lin-Kernighan traveling salesman heuristic. Eur J Oper Res 126(1):106\u2013130. https:\/\/doi.org\/10.1016\/S0377-2217(99)00284-2","journal-title":"Eur J Oper Res"},{"key":"932_CR48","unstructured":"Bello I, Pham H, Le QV, Norouzi M, Bengio S (2017) Neural combinatorial optimization with reinforcement learning. arXiv:1611.09940"}],"container-title":["Complex &amp; Intelligent Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s40747-022-00932-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s40747-022-00932-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s40747-022-00932-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,7,27]],"date-time":"2023-07-27T13:18:12Z","timestamp":1690463892000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s40747-022-00932-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,12,15]]},"references-count":48,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2023,8]]}},"alternative-id":["932"],"URL":"https:\/\/doi.org\/10.1007\/s40747-022-00932-1","relation":{},"ISSN":["2199-4536","2198-6053"],"issn-type":[{"value":"2199-4536","type":"print"},{"value":"2198-6053","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,12,15]]},"assertion":[{"value":"27 April 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"14 November 2022","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"15 December 2022","order":3,"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"}}]}}