{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,4]],"date-time":"2026-05-04T14:02:41Z","timestamp":1777903361875,"version":"3.51.4"},"reference-count":65,"publisher":"Springer Science and Business Media LLC","issue":"5-6","license":[{"start":{"date-parts":[[2024,7,2]],"date-time":"2024-07-02T00:00:00Z","timestamp":1719878400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,7,2]],"date-time":"2024-07-02T00:00:00Z","timestamp":1719878400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Evol. Intel."],"published-print":{"date-parts":[[2024,10]]},"DOI":"10.1007\/s12065-024-00960-5","type":"journal-article","created":{"date-parts":[[2024,7,2]],"date-time":"2024-07-02T16:02:13Z","timestamp":1719936133000},"page":"3833-3848","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Discrete Marine Predators Algorithm for Symmetric Travelling Salesman Problem"],"prefix":"10.1007","volume":"17","author":[{"given":"Manish","family":"Kumar","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Karuna","family":"Panwar","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kusum","family":"Deep","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,7,2]]},"reference":[{"key":"960_CR1","doi-asserted-by":"crossref","first-page":"535","DOI":"10.2307\/2582681","volume":"37","author":"EL Lawler","year":"1986","unstructured":"Lawler EL, Lenstra JK, Kan AR, Shmoys DB (1986) The traveling salesman problem: a guided tour of combinatorial optimization. J Oper Res Soc 37:535","journal-title":"J Oper Res Soc"},{"key":"960_CR2","doi-asserted-by":"crossref","first-page":"286","DOI":"10.1287\/opre.44.2.286","volume":"44","author":"DJ Bertsimas","year":"1996","unstructured":"Bertsimas DJ, Simchi-Levi D (1996) A new generation of vehicle routing research: robust algorithms, addressing uncertainty. Oper Res 44:286\u2013304","journal-title":"Oper Res"},{"key":"960_CR3","doi-asserted-by":"crossref","first-page":"339","DOI":"10.1016\/S0166-218X(01)00345-6","volume":"123","author":"Y Crama","year":"2002","unstructured":"Crama Y, Van De Klundert J, Spieksma FC (2002) Production planning problems in printed circuit board assembly. Discret Appl Math 123:339\u2013361","journal-title":"Discret Appl Math"},{"key":"960_CR4","doi-asserted-by":"crossref","first-page":"748","DOI":"10.1016\/j.ejor.2008.10.012","volume":"198","author":"T-S Chang","year":"2009","unstructured":"Chang T-S, Wan Y-W, Ooi WT (2009) A stochastic dynamic traveling salesman problem with hard time windows. Eur J Oper Res 198:748\u2013759","journal-title":"Eur J Oper Res"},{"key":"960_CR5","doi-asserted-by":"crossref","first-page":"444","DOI":"10.1016\/j.ejor.2020.01.053","volume":"285","author":"P Baniasadi","year":"2020","unstructured":"Baniasadi P, Foumani M, Smith-Miles K, Ejov V (2020) A transformation technique for the clustered generalized traveling salesman problem with applications to logistics. Eur J Oper Res 285:444\u2013457","journal-title":"Eur J Oper Res"},{"key":"960_CR6","doi-asserted-by":"crossref","DOI":"10.1016\/j.cosrev.2021.100369","volume":"40","author":"O Cheikhrouhou","year":"2021","unstructured":"Cheikhrouhou O, Khoufi I (2021) A comprehensive survey on the multiple traveling salesman problem: applications, approaches and taxonomy. Comput Sci Rev 40:100369","journal-title":"Comput Sci Rev"},{"key":"960_CR7","doi-asserted-by":"crossref","unstructured":"Yang R, Fan C (2024) A hierarchical framework for solving the constrained multiple depot traveling salesman problem. IEEE Robot Autom Lett","DOI":"10.1109\/LRA.2024.3389817"},{"key":"960_CR8","doi-asserted-by":"crossref","unstructured":"Pop PC, Cosma O, Sabo C, Sitar CP (2023) A comprehensive survey on the generalized traveling salesman problem. Eur J Oper Res","DOI":"10.1016\/j.ejor.2023.07.022"},{"key":"960_CR9","doi-asserted-by":"crossref","DOI":"10.1016\/j.engappai.2024.108193","volume":"133","author":"V Pandiri","year":"2024","unstructured":"Pandiri V, Singh A (2024) Solution of the family traveling salesman problem using a hyper-heuristic approach. Eng Appl Artif Intell 133:108193","journal-title":"Eng Appl Artif Intell"},{"key":"960_CR10","doi-asserted-by":"crossref","first-page":"16072","DOI":"10.1109\/TITS.2022.3147924","volume":"23","author":"Y Zhou","year":"2022","unstructured":"Zhou Y, Xu W, Fu Z-H, Zhou M (2022) Multi-neighborhood simulated annealing-based iterated local search for colored traveling salesman problems. IEEE Trans Intell Transp Syst 23:16072\u201316082","journal-title":"IEEE Trans Intell Transp Syst"},{"key":"960_CR11","doi-asserted-by":"crossref","unstructured":"Bock S, Bomsdorf S, Boysen N, Schneider M (2024) A survey on the traveling salesman problem and its variants in a warehousing context. Eur J Oper Res","DOI":"10.1016\/j.ejor.2024.04.014"},{"key":"960_CR12","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1007\/BF01582116","volume":"16","author":"M Gr\u00f6tschel","year":"1979","unstructured":"Gr\u00f6tschel M, Padberg MW (1979) On the symmetric travelling salesman problem i: inequalities. Math Program 16:265\u2013280","journal-title":"Math Program"},{"key":"960_CR13","doi-asserted-by":"crossref","first-page":"1017","DOI":"10.1057\/jors.1980.188","volume":"31","author":"G Laporte","year":"1980","unstructured":"Laporte G, Nobert Y (1980) A cutting planes algorithm for the m-salesmen problem. J Oper Res Soc 31:1017\u20131023","journal-title":"J Oper Res Soc"},{"key":"960_CR14","doi-asserted-by":"crossref","unstructured":"Taktak R (2024) A branch-and-cut algorithm for the Multiple Steiner TSP with order constraints. Ann Oper Res 1\u201329","DOI":"10.1007\/s10479-024-06003-7"},{"key":"960_CR15","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1016\/0377-2217(92)90138-Y","volume":"59","author":"G Laporte","year":"1992","unstructured":"Laporte G (1992) The traveling salesman problem: an overview of exact and approximate algorithms. Eur J Oper Res 59:231\u2013247","journal-title":"Eur J Oper Res"},{"key":"960_CR16","doi-asserted-by":"crossref","unstructured":"Rajwar K, Deep K, Das S (2023) An exhaustive review of the metaheuristic algorithms for search and optimization: taxonomy, applications, and open challenges. Artif Intell Rev 1\u201371","DOI":"10.1007\/s10462-023-10470-y"},{"key":"960_CR17","doi-asserted-by":"crossref","unstructured":"Kumar Y, Deep K (2024) Positioning of new mobile tower using circle packing problem. Evol Intell 1\u201328","DOI":"10.1007\/s12065-024-00931-w"},{"key":"960_CR18","doi-asserted-by":"crossref","unstructured":"Kumar Y, Deep K, Nagar AK (2024) Installation of smog-free towers using novel real coded genetic algorithm. IEEE Access","DOI":"10.2139\/ssrn.4596902"},{"key":"960_CR19","doi-asserted-by":"crossref","DOI":"10.1016\/j.eswa.2023.122332","volume":"240","author":"K Rajwar","year":"2024","unstructured":"Rajwar K, Deep K (2024) Uncovering structural bias in population-based optimization algorithms: a theoretical and simulation-based analysis of the generalized signature test. Expert Syst Appl 240:122332","journal-title":"Expert Syst Appl"},{"key":"960_CR20","doi-asserted-by":"crossref","unstructured":"Akhand M, Akter S, Rashid M (2014) Velocity tentative particle swarm optimization to solve TSP. In: 2013 International conference on electrical information and communication technology (EICT). IEEE, pp 1\u20136","DOI":"10.1109\/EICT.2014.6777868"},{"key":"960_CR21","doi-asserted-by":"crossref","unstructured":"Karaboga D, Gorkemli B (2011) A combinatorial artificial bee colony algorithm for traveling salesman problem. In: International symposium on innovations in intelligent systems and applications. IEEE 2011, pp 50\u201353","DOI":"10.1109\/INISTA.2011.5946125"},{"key":"960_CR22","doi-asserted-by":"crossref","first-page":"1707","DOI":"10.1007\/s00500-012-0855-z","volume":"16","author":"W Deng","year":"2012","unstructured":"Deng W, Chen R, He B, Liu Y, Yin L, Guo J (2012) A novel two-stage hybrid swarm intelligence optimization algorithm and application. Soft Comput 16:1707\u20131722","journal-title":"Soft Comput"},{"key":"960_CR23","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1002\/(SICI)1099-0526(199903\/04)4:4<31::AID-CPLX5>3.0.CO;2-4","volume":"4","author":"E Alba","year":"1999","unstructured":"Alba E, Troya JM et al (1999) A survey of parallel distributed genetic algorithms. Complexity 4:31\u201352","journal-title":"Complexity"},{"key":"960_CR24","doi-asserted-by":"crossref","first-page":"290","DOI":"10.1109\/72.363466","volume":"6","author":"PP Yip","year":"1995","unstructured":"Yip PP, Pao Y-H (1995) Combinatorial optimization with use of guided evolutionary simulated annealing. IEEE Trans Neural Netw 6:290\u2013295","journal-title":"IEEE Trans Neural Netw"},{"key":"960_CR25","doi-asserted-by":"crossref","first-page":"1277","DOI":"10.1166\/jctn.2015.3886","volume":"12","author":"M Li","year":"2015","unstructured":"Li M, Ma J, Zhang Y, Zhou H, Liu J (2015) Firefly algorithm solving multiple traveling salesman problem. J Comput Theor Nanosci 12:1277\u20131281","journal-title":"J Comput Theor Nanosci"},{"key":"960_CR26","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1016\/j.engappai.2015.10.006","volume":"48","author":"E Osaba","year":"2016","unstructured":"Osaba E, Yang X-S, Diaz F, Lopez-Garcia P, Carballedo R (2016) An improved discrete bat algorithm for symmetric and asymmetric traveling salesman problems. Eng Appl Artif Intell 48:59\u201371","journal-title":"Eng Appl Artif Intell"},{"key":"960_CR27","doi-asserted-by":"crossref","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","journal-title":"Appl Soft Comput"},{"key":"960_CR28","doi-asserted-by":"crossref","unstructured":"Panwar K, Deep K (2023) A discrete hybrid grey wolf optimizer algorithm to solve quadratic assignment problem","DOI":"10.21203\/rs.3.rs-3206923\/v1"},{"key":"960_CR29","doi-asserted-by":"crossref","unstructured":"Bogyrbayeva A, Meraliyev M, Mustakhov T, Dauletbayev B (2024) Machine learning to solve vehicle routing problems: a survey. IEEE Trans Intell Transp Syst","DOI":"10.1109\/TITS.2023.3334976"},{"key":"960_CR30","unstructured":"Rajwar K, Pant M, Deep K, et\u00a0al (2024) Application of machine learning in agriculture: Recent trends and future research avenues. arXiv:2405.17465"},{"key":"960_CR31","doi-asserted-by":"crossref","DOI":"10.1016\/j.eswa.2020.113377","volume":"152","author":"A Faramarzi","year":"2020","unstructured":"Faramarzi A, Heidarinejad M, Mirjalili S, Gandomi AH (2020) Marine predators algorithm: a nature-inspired metaheuristic. Expert Syst Appl 152:113377","journal-title":"Expert Syst Appl"},{"key":"960_CR32","doi-asserted-by":"crossref","first-page":"3133","DOI":"10.1007\/s11831-023-09897-x","volume":"30","author":"R Rai","year":"2023","unstructured":"Rai R, Dhal KG, Das A, Ray S (2023) An inclusive survey on marine predators algorithm: variants and applications. Arch Comput Methods Eng 30:3133\u20133172","journal-title":"Arch Comput Methods Eng"},{"key":"960_CR33","doi-asserted-by":"crossref","first-page":"38","DOI":"10.1016\/j.aej.2024.03.060","volume":"95","author":"M Kumar","year":"2024","unstructured":"Kumar M, Rajwar K, Deep K (2024) Analysis of marine predators algorithm using bias toolbox and generalized signature test. Alex Eng J 95:38\u201349","journal-title":"Alex Eng J"},{"key":"960_CR34","doi-asserted-by":"crossref","unstructured":"Abualigah L, Odah S, Ikotun AM, Alsoud AR, Forestiero A, Ezugwu AE, Hanandeh ES, Jia H, Zare M (2024) Marine predator\u2019s algorithm: a survey of recent applications. In: Metaheuristic optimization algorithms. Elsevier, pp 133\u2013145","DOI":"10.1016\/B978-0-443-13925-3.00010-8"},{"key":"960_CR35","doi-asserted-by":"crossref","first-page":"7339","DOI":"10.3390\/app13127339","volume":"13","author":"F Uddin","year":"2023","unstructured":"Uddin F, Riaz N, Manan A, Mahmood I, Song O-Y, Malik AJ, Abbasi AA (2023) An improvement to the 2-opt heuristic algorithm for approximation of optimal TSP tour. Appl Sci 13:7339","journal-title":"Appl Sci"},{"key":"960_CR36","first-page":"69","volume-title":"Der handlungsreisende, wie er sein soll und was er zu thun hat, um auftr\u00e4ge zu erhalten und eines gl\u00fccklichen erfolgs in seinen gesch\u00e4ften gewiss zu sein","author":"BF Voigt","year":"1831","unstructured":"Voigt BF (1831) Der handlungsreisende, wie er sein soll und was er zu thun hat, um auftr\u00e4ge zu erhalten und eines gl\u00fccklichen erfolgs in seinen gesch\u00e4ften gewiss zu sein. Ilmenau, Commis-Voageur, pp 69\u201372"},{"key":"960_CR37","volume-title":"The traveling salesman problem: a guided tour of combinatorial optimization","author":"EL Lawler","year":"1985","unstructured":"Lawler EL (1985) The traveling salesman problem: a guided tour of combinatorial optimization. Wiley, Hoboken"},{"key":"960_CR38","unstructured":"Robinson J (1949) On the Hamiltonian game (a traveling salesman problem). Rand Corporation"},{"key":"960_CR39","doi-asserted-by":"crossref","first-page":"804","DOI":"10.1038\/317804a0","volume":"317","author":"R Brady","year":"1985","unstructured":"Brady R (1985) Optimization strategies gleaned from biological evolution. Nature 317:804\u2013806","journal-title":"Nature"},{"key":"960_CR40","unstructured":"Knox JE (1989) The application of tabu search to the symmetric traveling salesman problem, University of Colorado at Boulder"},{"key":"960_CR41","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1016\/S0303-2647(97)01708-5","volume":"43","author":"M Dorigo","year":"1997","unstructured":"Dorigo M, Gambardella LM (1997) Ant colonies for the travelling salesman problem. Biosystems 43:73\u201381","journal-title":"Biosystems"},{"key":"960_CR42","doi-asserted-by":"crossref","first-page":"92","DOI":"10.1109\/TSMCB.2006.880136","volume":"37","author":"HD Nguyen","year":"2007","unstructured":"Nguyen HD, Yoshihara I, Yamamori K, Yasunaga M (2007) Implementation of an effective hybrid GA for large-scale traveling salesman problems. IEEE Trans Syst Man Cybern Part B (Cybern) 37:92\u201399","journal-title":"IEEE Trans Syst Man Cybern Part B (Cybern)"},{"key":"960_CR43","doi-asserted-by":"crossref","unstructured":"Bouzidi A, Riffi ME (2013) Discrete cat swarm optimization to resolve the traveling salesman problem. Int J 3","DOI":"10.1109\/CIST.2014.7016619"},{"key":"960_CR44","doi-asserted-by":"crossref","first-page":"1659","DOI":"10.1007\/s00521-013-1402-2","volume":"24","author":"A Ouaarab","year":"2014","unstructured":"Ouaarab A, Ahiod B, Yang X-S (2014) Discrete cuckoo search algorithm for the travelling salesman problem. Neural Comput Appl 24:1659\u20131669","journal-title":"Neural Comput Appl"},{"key":"960_CR45","doi-asserted-by":"crossref","first-page":"124","DOI":"10.1016\/j.cie.2014.01.015","volume":"70","author":"Y Wang","year":"2014","unstructured":"Wang Y (2014) The hybrid genetic algorithm with two local optimization strategies for traveling salesman problem. Comput Ind Eng 70:124\u2013133","journal-title":"Comput Ind Eng"},{"key":"960_CR46","doi-asserted-by":"crossref","first-page":"415","DOI":"10.1016\/j.asoc.2016.02.021","volume":"43","author":"J Wang","year":"2016","unstructured":"Wang J, Ersoy OK, He M, Wang F (2016) Multi-offspring genetic algorithm and its application to the traveling salesman problem. Appl Soft Comput 43:415\u2013423","journal-title":"Appl Soft Comput"},{"key":"960_CR47","doi-asserted-by":"crossref","first-page":"428","DOI":"10.1016\/j.swevo.2018.05.006","volume":"44","author":"I Khan","year":"2019","unstructured":"Khan I, Maiti MK (2019) A swap sequence based artificial bee colony algorithm for traveling salesman problem. Swarm Evol Comput 44:428\u2013438","journal-title":"Swarm Evol Comput"},{"key":"960_CR48","doi-asserted-by":"crossref","first-page":"48","DOI":"10.3390\/sym13010048","volume":"13","author":"J Zhang","year":"2020","unstructured":"Zhang J, Hong L, Liu Q (2020) An improved whale optimization algorithm for the traveling salesman problem. Symmetry 13:48","journal-title":"Symmetry"},{"key":"960_CR49","volume":"97","author":"GH Al-Gaphari","year":"2021","unstructured":"Al-Gaphari GH, Al-Amry R, Al-Nuzaili AS (2021) Discrete crow-inspired algorithms for traveling salesman problem. Eng Appl Artif Intell 97:104006","journal-title":"Eng Appl Artif Intell"},{"key":"960_CR50","doi-asserted-by":"crossref","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","journal-title":"J Comput Sci"},{"key":"960_CR51","doi-asserted-by":"crossref","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","journal-title":"Swarm Evol Comput"},{"key":"960_CR52","doi-asserted-by":"crossref","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","journal-title":"Expert Syst Appl"},{"key":"960_CR53","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1016\/j.cie.2019.04.008","volume":"131","author":"Y Wang","year":"2019","unstructured":"Wang Y, Wu Y, Xu N (2019) Discrete symbiotic organism search with excellence coefficients and self-escape for traveling salesman problem. Comput Ind Eng 131:269\u2013281","journal-title":"Comput Ind Eng"},{"key":"960_CR54","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1016\/j.asoc.2018.06.047","volume":"71","author":"E Osaba","year":"2018","unstructured":"Osaba E, Del Ser J, Sadollah A, Bilbao MN, Camacho D (2018) A discrete water cycle algorithm for solving the symmetric and asymmetric traveling salesman problem. Appl Soft Comput 71:277\u2013290","journal-title":"Appl Soft Comput"},{"key":"960_CR55","doi-asserted-by":"crossref","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":"960_CR56","doi-asserted-by":"crossref","DOI":"10.1016\/j.asoc.2019.105887","volume":"86","author":"M Akhand","year":"2020","unstructured":"Akhand M, Ayon SI, Shahriyar S, Siddique N, Adeli H (2020) Discrete spider monkey optimization for travelling salesman problem. Appl Soft Comput 86:105887","journal-title":"Appl Soft Comput"},{"key":"960_CR57","doi-asserted-by":"crossref","DOI":"10.1016\/j.knosys.2021.107199","volume":"227","author":"SR Kanna","year":"2021","unstructured":"Kanna SR, 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","journal-title":"Knowl Based Syst"},{"key":"960_CR58","doi-asserted-by":"crossref","DOI":"10.1016\/j.eswa.2021.115353","volume":"183","author":"MM Krishna","year":"2021","unstructured":"Krishna MM, Panda N, Majhi SK (2021) Solving traveling salesman problem using hybridization of rider optimization and spotted hyena optimization algorithm. Expert Syst Appl 183:115353","journal-title":"Expert Syst Appl"},{"key":"960_CR59","doi-asserted-by":"crossref","unstructured":"Bozorg-Haddad O (2018) Advanced optimization by nature-inspired algorithms, vol 720. Springer","DOI":"10.1007\/978-981-10-5221-7"},{"key":"960_CR60","first-page":"55","volume":"23","author":"ZH Ahmed","year":"2023","unstructured":"Ahmed ZH, Yousefikhoshbakht M, Saudagar AKJ, Khan S (2023) Solving the travelling salesman problem using an ant colony system algorithm. IJCSNS 23:55","journal-title":"IJCSNS"},{"key":"960_CR61","doi-asserted-by":"crossref","DOI":"10.1016\/j.eswa.2023.121735","volume":"238","author":"AA Chaves","year":"2024","unstructured":"Chaves AA, Vianna BL, da Silva TT, Schenekemberg CM (2024) A parallel branch-and-cut and an adaptive metaheuristic to solve the family traveling salesman problem. Expert Syst Appl 238:121735","journal-title":"Expert Syst Appl"},{"key":"960_CR62","doi-asserted-by":"crossref","first-page":"791","DOI":"10.1287\/opre.6.6.791","volume":"6","author":"GA Croes","year":"1958","unstructured":"Croes GA (1958) A method for solving traveling-salesman problems. Oper Res 6:791\u2013812","journal-title":"Oper Res"},{"key":"960_CR63","doi-asserted-by":"crossref","first-page":"104","DOI":"10.1016\/j.asoc.2017.04.057","volume":"58","author":"X Chen","year":"2017","unstructured":"Chen X, Zhou Y, Tang Z, Luo Q (2017) A hybrid algorithm combining glowworm swarm optimization and complete 2-opt algorithm for spherical travelling salesman problems. Appl Soft Comput 58:104\u2013114","journal-title":"Appl Soft Comput"},{"key":"960_CR64","doi-asserted-by":"crossref","first-page":"103","DOI":"10.11121\/ijocta.01.2016.00268","volume":"6","author":"K Karagul","year":"2016","unstructured":"Karagul K, Aydemir E, Tokat S (2016) Using 2-opt based evolution strategy for travelling salesman problem. Int J Optim Control Theor Appl (IJOCTA) 6:103\u2013113","journal-title":"Int J Optim Control Theor Appl (IJOCTA)"},{"key":"960_CR65","unstructured":"TSPLIB\u2014A library of sample instances for the TSP (and related problems) from various sources. http:\/\/elib.zib.de\/pub\/mptestdata\/tsp\/tsplib\/tsplib.html. Accessed 1 December 2023"}],"container-title":["Evolutionary Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12065-024-00960-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s12065-024-00960-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12065-024-00960-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,10,19]],"date-time":"2024-10-19T06:17:06Z","timestamp":1729318626000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s12065-024-00960-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,7,2]]},"references-count":65,"journal-issue":{"issue":"5-6","published-print":{"date-parts":[[2024,10]]}},"alternative-id":["960"],"URL":"https:\/\/doi.org\/10.1007\/s12065-024-00960-5","relation":{},"ISSN":["1864-5909","1864-5917"],"issn-type":[{"value":"1864-5909","type":"print"},{"value":"1864-5917","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,7,2]]},"assertion":[{"value":"31 March 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"5 June 2024","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"17 June 2024","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"2 July 2024","order":4,"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 there are no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}