{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,12]],"date-time":"2026-01-12T21:19:45Z","timestamp":1768252785516,"version":"3.49.0"},"reference-count":57,"publisher":"Springer Science and Business Media LLC","issue":"8","license":[{"start":{"date-parts":[[2021,10,27]],"date-time":"2021-10-27T00:00:00Z","timestamp":1635292800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,10,27]],"date-time":"2021-10-27T00:00:00Z","timestamp":1635292800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61673258"],"award-info":[{"award-number":["61673258"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61075115"],"award-info":[{"award-number":["61075115"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100007219","name":"Natural Science Foundation of Shanghai","doi-asserted-by":"publisher","award":["19ZR1421600"],"award-info":[{"award-number":["19ZR1421600"]}],"id":[{"id":"10.13039\/100007219","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Appl Intell"],"published-print":{"date-parts":[[2022,6]]},"DOI":"10.1007\/s10489-021-02839-9","type":"journal-article","created":{"date-parts":[[2021,10,27]],"date-time":"2021-10-27T08:02:57Z","timestamp":1635321777000},"page":"8386-8411","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["Multi-ant colony optimization algorithm based on hybrid recommendation mechanism"],"prefix":"10.1007","volume":"52","author":[{"given":"Yifan","family":"Liu","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3879-6329","authenticated-orcid":false,"given":"Xiaoming","family":"You","sequence":"additional","affiliation":[]},{"given":"Sheng","family":"Liu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,10,27]]},"reference":[{"key":"2839_CR1","doi-asserted-by":"publisher","first-page":"1174","DOI":"10.1016\/j.ejor.2006.06.047","volume":"185","author":"AV Donati","year":"2008","unstructured":"Donati AV, Montemanni R, Casagrande N et al (2008) Time dependent vehicle routing problem with a multi ant colony system. Eur J Oper Res 185:1174\u20131191. https:\/\/doi.org\/10.1016\/j.ejor.2006.06.047","journal-title":"Eur J Oper Res"},{"key":"2839_CR2","doi-asserted-by":"publisher","first-page":"134","DOI":"10.1016\/j.future.2020.03.051","volume":"109","author":"N Yi","year":"2020","unstructured":"Yi N, Xu J, Yan L, Huang L (2020) Task optimization and scheduling of distributed cyber-physical system based on improved ant colony algorithm. Futur Gener Comput Syst Int J ESCIENCE 109:134\u2013148. https:\/\/doi.org\/10.1016\/j.future.2020.03.051","journal-title":"Futur Gener Comput Syst Int J ESCIENCE"},{"key":"2839_CR3","doi-asserted-by":"publisher","first-page":"161094","DOI":"10.1109\/ACCESS.2019.2949249","volume":"7","author":"W Yue","year":"2019","unstructured":"Yue W, Xi Y, Guan X (2019) A new searching approach using improved multi-ant colony scheme for multi-uavs in unknown environments. IEEE Access 7:161094\u2013161102. https:\/\/doi.org\/10.1109\/ACCESS.2019.2949249","journal-title":"IEEE Access"},{"key":"2839_CR4","doi-asserted-by":"publisher","DOI":"10.1016\/j.adhoc.2020.102396","volume":"113","author":"AS Sharma","year":"2021","unstructured":"Sharma AS, Kim DS (2021) Energy efficient multipath ant colony based routing algorithm for mobile ad hoc networks. Ad Hoc Netw 113:102396. https:\/\/doi.org\/10.1016\/j.adhoc.2020.102396","journal-title":"Ad Hoc Netw"},{"key":"2839_CR5","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1109\/3477.484436","volume":"26","author":"M Dorigo","year":"1996","unstructured":"Dorigo M, Maniezzo V, et al (1996) Ant system: optimization by a colony of cooperating agents. Syst Man, Cybern Part B Cybern IEEE Trans 26:29\u201341","journal-title":"Syst Man, Cybern Part B Cybern IEEE Trans"},{"key":"2839_CR6","first-page":"53","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 Ec 1:53\u201366","journal-title":"IEEE Trans Ec"},{"key":"2839_CR7","doi-asserted-by":"crossref","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","DOI":"10.1109\/ICEC.1997.592327"},{"key":"2839_CR8","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1016\/j.oceaneng.2015.04.028","volume":"102","author":"WY Jiang","year":"2015","unstructured":"Jiang WY, Lin Y, Chen M, Yu YY (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":"2839_CR9","doi-asserted-by":"publisher","first-page":"142","DOI":"10.1016\/j.ins.2017.12.047","volume":"433\u2013434","author":"J Ning","year":"2018","unstructured":"Ning J, Zhang Q, Zhang C, Zhang B (2018) A best-path-updating information-guided ant colony optimization algorithm. Inf Sci (Ny) 433\u2013434:142\u2013162. https:\/\/doi.org\/10.1016\/j.ins.2017.12.047","journal-title":"Inf Sci (Ny)"},{"key":"2839_CR10","doi-asserted-by":"publisher","first-page":"107439","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":"2839_CR11","doi-asserted-by":"publisher","first-page":"256","DOI":"10.1016\/j.asoc.2017.06.049","volume":"60","author":"Y Yan","year":"2017","unstructured":"Yan Y, Sohn H, Reyes G (2017) A modified ant system to achieve better balance between intensification and diversification for the traveling salesman problem. Appl Soft Comput J 60:256\u2013267. https:\/\/doi.org\/10.1016\/j.asoc.2017.06.049","journal-title":"Appl Soft Comput J"},{"key":"2839_CR12","doi-asserted-by":"publisher","first-page":"106720","DOI":"10.1016\/j.asoc.2020.106720","volume":"97","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 97:106720. https:\/\/doi.org\/10.1016\/j.asoc.2020.106720","journal-title":"Appl Soft Comput"},{"key":"2839_CR13","doi-asserted-by":"crossref","unstructured":"Yueshun H, Ping D (2012) A study of a new multi-ant colony optimization algorithm BT\u2014advances in information technology and industry applications. In: Zeng D (ed). Springer Berlin Heidelberg, Berlin, Heidelberg, pp 155\u2013161","DOI":"10.1007\/978-3-642-26001-8_21"},{"key":"2839_CR14","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":"2839_CR15","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 Evol Comput 36:27\u201336. https:\/\/doi.org\/10.1016\/j.swevo.2017.04.002","journal-title":"Swarm Evol Comput"},{"key":"2839_CR16","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2019.112867","author":"C Jiang","year":"2020","unstructured":"Jiang C, Wan Z, Peng Z (2020) A new efficient hybrid algorithm for large scale multiple traveling salesman problems. Expert Syst Appl. https:\/\/doi.org\/10.1016\/j.eswa.2019.112867","journal-title":"Expert Syst Appl"},{"key":"2839_CR17","doi-asserted-by":"publisher","DOI":"10.1016\/j.swevo.2020.100675","author":"Y Wang","year":"2020","unstructured":"Wang Y, Wang L, Chen G et al (2020) An improved ant colony optimization algorithm to the periodic vehicle routing problem with time window and service choice. Swarm Evol Comput. https:\/\/doi.org\/10.1016\/j.swevo.2020.100675","journal-title":"Swarm Evol Comput"},{"key":"2839_CR18","doi-asserted-by":"publisher","first-page":"13461","DOI":"10.1007\/s00500-020-04760-8","volume":"24","author":"MA Awadallah","year":"2020","unstructured":"Awadallah MA, Al-Betar MA, Bolaji AL et al (2020) Island artificial bee colony for global optimization. Soft Comput 24:13461\u201313487. https:\/\/doi.org\/10.1007\/s00500-020-04760-8","journal-title":"Soft Comput"},{"key":"2839_CR19","doi-asserted-by":"publisher","first-page":"156","DOI":"10.1111\/j.1540-5915.1977.tb01074.x","volume":"8","author":"F Glover","year":"2010","unstructured":"Glover F (2010) Heuristics for integer programming using surrogate constraints. Decis Sci 8:156\u2013166","journal-title":"Decis Sci"},{"key":"2839_CR20","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":"2839_CR21","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1016\/0004-3702(95)00040-2","volume":"84","author":"R Greiner","year":"1996","unstructured":"Greiner R (1996) PALO: a probabilistic hill-climbing algorithm. Artif Intell 84:177\u2013208","journal-title":"Artif Intell"},{"key":"2839_CR22","doi-asserted-by":"publisher","first-page":"111739","DOI":"10.1016\/j.compstruct.2019.111739","volume":"233","author":"ZZ Wang","year":"2020","unstructured":"Wang ZZ, Sobey A (2020) A comparative review between Genetic Algorithm use in composite optimisation and the state-of-the-art in evolutionary computation. Compos Struct 233:111739. https:\/\/doi.org\/10.1016\/j.compstruct.2019.111739","journal-title":"Compos Struct"},{"key":"2839_CR23","doi-asserted-by":"crossref","unstructured":"Schwefel H-P (1977) Evolutionsstrategien f\u00fcr die numerische Optimierung BT - Numerische Optimierung von Computer-Modellen mittels der Evolutionsstrategie: Mit einer vergleichenden Einf\u00fchrung in die Hill-Climbing- und Zufallsstrategie. In: Schwefel H-P (ed). Birkh\u00e4user Basel, Basel, pp 123\u2013176","DOI":"10.1007\/978-3-0348-5927-1_5"},{"key":"2839_CR24","doi-asserted-by":"publisher","first-page":"82","DOI":"10.1109\/4235.771163","volume":"3","author":"X Yao","year":"1999","unstructured":"Yao X, Liu Y, Lin G (1999) Evolutionary programming made faster. IEEE Trans Evol Comput 3:82\u2013102. https:\/\/doi.org\/10.1109\/4235.771163","journal-title":"IEEE Trans Evol Comput"},{"key":"2839_CR25","doi-asserted-by":"crossref","unstructured":"Oliveira SMD, Bezerra L, St\u00fctzle T, et al (2021) A computational study on ant colony optimization for the traveling salesman problem with dynamic demands. Comput Oper Res 105359","DOI":"10.1016\/j.cor.2021.105359"},{"key":"2839_CR26","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1016\/j.swevo.2018.02.017","volume":"42","author":"Y Zhong","year":"2018","unstructured":"Zhong Y, Lin J, Wang L, Zhang H (2018) Discrete comprehensive learning particle swarm optimization algorithm with Metropolis acceptance criterion for traveling salesman problem. Swarm Evol Comput 42:77\u201388. https:\/\/doi.org\/10.1016\/j.swevo.2018.02.017","journal-title":"Swarm Evol Comput"},{"key":"2839_CR27","doi-asserted-by":"publisher","first-page":"459","DOI":"10.1007\/s10898-007-9149-x","volume":"39","author":"D Karaboga","year":"2007","unstructured":"Karaboga D, Basturk B (2007) A powerful and efficient algorithm for numerical function optimization: artificial bee colony (ABC) algorithm. J Glob Optim 39:459\u2013471","journal-title":"J Glob Optim"},{"key":"2839_CR28","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1016\/j.knosys.2011.07.001","volume":"26","author":"W-T Pan","year":"2012","unstructured":"Pan W-T (2012) A new fruit fly optimization algorithm: taking the financial distress model as an example. Knowledge-Based Syst 26:69\u201374. https:\/\/doi.org\/10.1016\/j.knosys.2011.07.001","journal-title":"Knowledge-Based Syst"},{"key":"2839_CR29","doi-asserted-by":"publisher","first-page":"1213","DOI":"10.1016\/j.cnsns.2013.08.027","volume":"19","author":"A Askarzadeh","year":"2014","unstructured":"Askarzadeh A (2014) Bird mating optimizer: an optimization algorithm inspired by bird mating strategies. Commun Nonlinear Sci Numer Simul 19:1213\u20131228. https:\/\/doi.org\/10.1016\/j.cnsns.2013.08.027","journal-title":"Commun Nonlinear Sci Numer Simul"},{"key":"2839_CR30","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1016\/j.advengsoft.2016.01.008","volume":"95","author":"S Mirjalili","year":"2016","unstructured":"Mirjalili S, Lewis A (2016) The whale optimization algorithm. Adv Eng Softw 95:51\u201367. https:\/\/doi.org\/10.1016\/j.advengsoft.2016.01.008","journal-title":"Adv Eng Softw"},{"key":"2839_CR31","unstructured":"Xin-She Y (2010) A new metaheuristic bat-inspired algorithm, nature inspired cooperative strategies for optimization (NISCO 2010)"},{"key":"2839_CR32","doi-asserted-by":"publisher","first-page":"1853","DOI":"10.1007\/s00521-015-1978-9","volume":"27","author":"Y Saji","year":"2016","unstructured":"Saji Y, Riffi ME (2016) A novel discrete bat algorithm for solving the travelling salesman problem. Neural Comput Appl 27:1853\u20131866. https:\/\/doi.org\/10.1007\/s00521-015-1978-9","journal-title":"Neural Comput Appl"},{"key":"2839_CR33","doi-asserted-by":"publisher","unstructured":"Hatamlou A (2013) Black hole: A new heuristic optimization\napproach for data clustering. Inf Sci (Ny) 222:175\u2013184.\nhttps:\/\/doi.org\/10.1016\/j.ins.2012.08.023","DOI":"10.1016\/j.ins.2012.08.023"},{"key":"2839_CR34","doi-asserted-by":"publisher","first-page":"8167","DOI":"10.1007\/s00500-017-2760-y","volume":"22","author":"A Hatamlou","year":"2018","unstructured":"Hatamlou A (2018) Solving travelling salesman problem using black hole algorithm. SOFT Comput 22:8167\u20138175. https:\/\/doi.org\/10.1007\/s00500-017-2760-y","journal-title":"SOFT Comput"},{"key":"2839_CR35","doi-asserted-by":"publisher","first-page":"105887","DOI":"10.1016\/j.asoc.2019.105887","volume":"86","author":"MAH Akhand","year":"2020","unstructured":"Akhand MAH, Ayon SI, Shahriyar SA et al (2020) Discrete spider monkey optimization for travelling salesman problem. Appl Soft Comput J 86:105887. https:\/\/doi.org\/10.1016\/j.asoc.2019.105887","journal-title":"Appl Soft Comput J"},{"key":"2839_CR36","first-page":"303","volume":"6728","author":"YH Shi","year":"2011","unstructured":"Shi YH (2011) Brain Storm Optimization Algorithm. Adv SWARMIntell PT I 6728:303\u2013309","journal-title":"Adv SWARMIntell PT I"},{"key":"2839_CR37","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":"2839_CR38","doi-asserted-by":"publisher","first-page":"46","DOI":"10.1016\/j.advengsoft.2013.12.007","volume":"69","author":"S Mirjalili","year":"2014","unstructured":"Mirjalili S, Mirjalili SM, Lewis A (2014) Grey WolfOptimizer. Adv Eng Softw 69:46\u201361. https:\/\/doi.org\/10.1016\/j.advengsoft.2013.12.007","journal-title":"Grey WolfOptimizer. Adv Eng Softw"},{"key":"2839_CR39","doi-asserted-by":"publisher","first-page":"107298","DOI":"10.1016\/j.asoc.2021.107298","volume":"105","author":"K Panwar","year":"2021","unstructured":"Panwar K, Deep K (2021) Discrete Grey Wolf Optimizer for symmetric travelling salesman problem. Appl Soft Comput 105:107298. https:\/\/doi.org\/10.1016\/j.asoc.2021.107298","journal-title":"Appl Soft Comput"},{"key":"2839_CR40","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.swevo.2016.12.005","volume":"33","author":"M Mavrovouniotis","year":"2017","unstructured":"Mavrovouniotis M, Li C, Yang S (2017) A survey of swarm intelligence for dynamic optimization: algorithms and applications. Swarm Evol Comput 33:1\u201317. https:\/\/doi.org\/10.1016\/j.swevo.2016.12.005","journal-title":"Swarm Evol Comput"},{"key":"2839_CR41","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":"2839_CR42","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":"2839_CR43","doi-asserted-by":"publisher","first-page":"107199","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. Knowledge-Based Syst 227:107199. https:\/\/doi.org\/10.1016\/j.knosys.2021.107199","journal-title":"Knowledge-Based Syst"},{"key":"2839_CR44","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":"2839_CR45","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":"2839_CR46","doi-asserted-by":"publisher","first-page":"5469","DOI":"10.1007\/s00500-018-3199-5","volume":"23","author":"V Tongur","year":"2019","unstructured":"Tongur V, \u00dclker E (2019) PSO-based improved multi-flocks migrating birds optimization (IMFMBO) algorithm for solution of discrete problems. Soft Comput 23:5469\u20135484. https:\/\/doi.org\/10.1007\/s00500-018-3199-5","journal-title":"Soft Comput"},{"key":"2839_CR47","doi-asserted-by":"publisher","first-page":"622","DOI":"10.1016\/j.swevo.2018.08.004","volume":"44","author":"SS Choong","year":"2019","unstructured":"Choong SS, Wong LP, Lim CP (2019) An artificial bee colony algorithm with a modified choice function for the traveling salesman problem. Swarm Evol Comput 44:622\u2013635. https:\/\/doi.org\/10.1016\/j.swevo.2018.08.004","journal-title":"Swarm Evol Comput"},{"key":"2839_CR48","doi-asserted-by":"publisher","first-page":"158160","DOI":"10.1109\/ACCESS.2019.2950214","volume":"7","author":"H Zhang","year":"2019","unstructured":"Zhang H, You X (2019) Multi-population ant colony optimization algorithm based on congestion factor and co-evolution mechanism. IEEE Access 7:158160\u2013158169. https:\/\/doi.org\/10.1109\/ACCESS.2019.2950214","journal-title":"IEEE Access"},{"key":"2839_CR49","doi-asserted-by":"publisher","DOI":"10.3390\/s19081837","author":"F Dahan","year":"2019","unstructured":"Dahan F, El Hindi K, Mathkour H, Alsalman H (2019) Dynamic flying ant colony optimization (DFACO) for solving the traveling salesman problem. Sensors (Switzerland). https:\/\/doi.org\/10.3390\/s19081837","journal-title":"Sensors (Switzerland)"},{"key":"2839_CR50","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":"2839_CR51","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":"2839_CR52","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 (Ny) 421:70\u201384. https:\/\/doi.org\/10.1016\/j.ins.2017.08.067","journal-title":"Inf Sci (Ny)"},{"key":"2839_CR53","doi-asserted-by":"publisher","first-page":"937","DOI":"10.1016\/j.asoc.2016.08.036","volume":"49","author":"Y Lin","year":"2016","unstructured":"Lin Y, Bian Z, Liu X (2016) Developing a dynamic neighborhood structure for an adaptive hybrid simulated annealing\u2014tabu search algorithm to solve the symmetrical traveling salesman problem. Appl Soft Comput J 49:937\u2013952. https:\/\/doi.org\/10.1016\/j.asoc.2016.08.036","journal-title":"Appl Soft Comput J"},{"key":"2839_CR54","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":"2839_CR55","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1016\/j.engappai.2015.10.006","volume":"48","author":"E Osaba","year":"2016","unstructured":"Osaba E, Yang XS, Diaz F et al (2016) An improved discrete bat algorithm for symmetric and asymmetric traveling salesman problems. Eng Appl Artif Intell 48:59\u201371. https:\/\/doi.org\/10.1016\/j.engappai.2015.10.006","journal-title":"Eng Appl Artif Intell"},{"key":"2839_CR56","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":"2839_CR57","doi-asserted-by":"publisher","first-page":"484","DOI":"10.1016\/j.asoc.2015.01.068","volume":"30","author":"M Mahi","year":"2015","unstructured":"Mahi M, Baykan \u00d6K, 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 J 30:484\u2013490. https:\/\/doi.org\/10.1016\/j.asoc.2015.01.068","journal-title":"Appl Soft Comput J"}],"container-title":["Applied Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10489-021-02839-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10489-021-02839-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10489-021-02839-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,5,30]],"date-time":"2022-05-30T09:07:55Z","timestamp":1653901675000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10489-021-02839-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,10,27]]},"references-count":57,"journal-issue":{"issue":"8","published-print":{"date-parts":[[2022,6]]}},"alternative-id":["2839"],"URL":"https:\/\/doi.org\/10.1007\/s10489-021-02839-9","relation":{},"ISSN":["0924-669X","1573-7497"],"issn-type":[{"value":"0924-669X","type":"print"},{"value":"1573-7497","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,10,27]]},"assertion":[{"value":"11 September 2021","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"27 October 2021","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 have declared no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}