{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,31]],"date-time":"2025-12-31T20:15:12Z","timestamp":1767212112874},"reference-count":63,"publisher":"Springer Science and Business Media LLC","issue":"10","license":[{"start":{"date-parts":[[2022,9,5]],"date-time":"2022-09-05T00:00:00Z","timestamp":1662336000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,9,5]],"date-time":"2022-09-05T00:00:00Z","timestamp":1662336000000},"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":["Appl Intell"],"published-print":{"date-parts":[[2023,5]]},"DOI":"10.1007\/s10489-022-03976-5","type":"journal-article","created":{"date-parts":[[2022,9,5]],"date-time":"2022-09-05T10:15:01Z","timestamp":1662372901000},"page":"11420-11438","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":14,"title":["Discrete Salp Swarm Algorithm for Euclidean Travelling Salesman Problem"],"prefix":"10.1007","volume":"53","author":[{"given":"Karuna","family":"Panwar","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kusum","family":"Deep","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,9,5]]},"reference":[{"issue":"2","key":"3976_CR1","doi-asserted-by":"crossref","first-page":"210","DOI":"10.1287\/opre.14.2.210","volume":"14","author":"JW Gavett","year":"1966","unstructured":"Gavett JW, Plyter NV (1966) The optimal assignment of facilities to locations by branch and bound. Oper Res 14(2):210\u2013232","journal-title":"Oper Res"},{"issue":"1","key":"3976_CR2","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0167-6377(87)90002-2","volume":"6","author":"M Padberg","year":"1987","unstructured":"Padberg M, Rinaldi G (1987) Optimization of a 532-city symmetric traveling salesman problem by branch and cut. Oper Res Lett 6(1):1\u20137","journal-title":"Oper Res Lett"},{"issue":"1","key":"3976_CR3","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1145\/321105.321111","volume":"9","author":"R Bellman","year":"1962","unstructured":"Bellman R (1962) Dynamic programming treatment of the travelling salesman problem. Journal of the ACM (JACM) 9(1):61\u201363","journal-title":"Journal of the ACM (JACM)"},{"issue":"10","key":"3976_CR4","doi-asserted-by":"crossref","first-page":"1276","DOI":"10.1287\/mnsc.40.10.1276","volume":"40","author":"M Gendreau","year":"1994","unstructured":"Gendreau M, Hertz A, Laporte G (1994) A tabu search heuristic for the vehicle routing problem. Manag Sci 40(10):1276\u20131290","journal-title":"Manag Sci"},{"key":"3976_CR5","unstructured":"Lawler EL (1985) The traveling salesman problem: a guided tour of combinatorial optimization, Wiley-Interscience Series in Discrete Mathematics"},{"key":"3976_CR6","doi-asserted-by":"crossref","unstructured":"Koopmans TC, Beckmann M (1957) Assignment problems and the location of economic activities","DOI":"10.2307\/1907742"},{"key":"3976_CR7","doi-asserted-by":"crossref","unstructured":"Toth P, Vigo D (2002) The vehicle routing problem, SIAM","DOI":"10.1137\/1.9780898718515"},{"issue":"2","key":"3976_CR8","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1016\/0377-2217(85)90167-5","volume":"19","author":"D de Werra","year":"1985","unstructured":"de Werra D (1985) An introduction to timetabling. Eur J Oper Res 19(2):151\u2013162","journal-title":"Eur J Oper Res"},{"issue":"3","key":"3976_CR9","doi-asserted-by":"crossref","first-page":"985","DOI":"10.1016\/j.ejor.2006.06.060","volume":"187","author":"A Allahverdi","year":"2008","unstructured":"Allahverdi A, Ng CT, Cheng TE, Kovalyov MY (2008) A survey of scheduling problems with setup times or costs. Eur J Oper Res 187(3):985\u20131032","journal-title":"Eur J Oper Res"},{"key":"3976_CR10","unstructured":"Papadimitriou CH, Steiglitz K (1998) Combinatorial optimization: algorithms and complexity, Courier Corporation"},{"issue":"1","key":"3976_CR11","doi-asserted-by":"crossref","first-page":"197","DOI":"10.1007\/BF02192047","volume":"87","author":"W Wong","year":"1995","unstructured":"Wong W (1995) Matrix representation and gradient flows for np-hard problems. J Optim Theory Appl 87(1):197\u2013220","journal-title":"J Optim Theory Appl"},{"issue":"2","key":"3976_CR12","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(2):231\u2013 247","journal-title":"Eur J Oper Res"},{"issue":"11","key":"3976_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(11):1017\u20131023","journal-title":"J Oper Res Soc"},{"key":"3976_CR14","doi-asserted-by":"crossref","unstructured":"Dasgupta D, Michalewicz Z (1997) Evolutionary algorithms\u2014an overview","DOI":"10.1007\/978-3-662-03423-1_1"},{"key":"3976_CR15","doi-asserted-by":"crossref","unstructured":"Slowik A, Kwasnicka H (2020) Evolutionary algorithms and their applications to engineering problems","DOI":"10.1007\/s00521-020-04832-8"},{"key":"3976_CR16","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1016\/j.advengsoft.2017.07.002","volume":"114","author":"S Mirjalili","year":"2017","unstructured":"Mirjalili S, Gandomi AH, Mirjalili SZ, Saremi S, Faris H, Mirjalili SM (2017) Salp swarm algorithm: a bio-inspired optimizer for engineering design problems. Adv Eng Softw 114:163\u2013191","journal-title":"Adv Eng Softw"},{"key":"3976_CR17","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1016\/j.eswa.2019.113122","volume":"145","author":"M Tubishat","year":"2020","unstructured":"Tubishat M, Idris N, Shuib L, Abushariah MA, Mirjalili S (2020) Improved salp swarm algorithm based on opposition based learning and novel local search algorithm for feature selection. Expert Syst Appl 145:113\u2013122","journal-title":"Expert Syst Appl"},{"issue":"5","key":"3976_CR18","doi-asserted-by":"crossref","first-page":"1641","DOI":"10.1007\/s00521-018-3613-z","volume":"31","author":"RM Rizk-Allah","year":"2019","unstructured":"Rizk-Allah RM, Hassanien AE, Elhoseny M, Gunasekaran M (2019) A new binary salp swarm algorithm: development and application for optimization tasks. Neural Comput & Applic 31(5):1641\u20131663","journal-title":"Neural Comput & Applic"},{"issue":"6","key":"3976_CR19","doi-asserted-by":"crossref","first-page":"815","DOI":"10.3390\/w10060815","volume":"10","author":"J Zhang","year":"2018","unstructured":"Zhang J, Wang Z, Luo X (2018) Parameter estimation for soil water retention curve using the salp swarm algorithm. Water 10(6):815\u2013826","journal-title":"Water"},{"key":"3976_CR20","doi-asserted-by":"crossref","unstructured":"Ekinci S, Hekimoglu B (2018) Parameter optimization of power system stabilizer via salp swarm algorithm. In: 2018 5th international conference on electrical and electronic engineering (ICEEE), IEEE, pp 143\u2013147","DOI":"10.1109\/ICEEE2.2018.8391318"},{"issue":"12","key":"3976_CR21","first-page":"13","volume":"17","author":"HT Ibrahim","year":"2017","unstructured":"Ibrahim HT, Mazher WJ, Ucan ON, Bayat O (2017) Feature selection using salp swarm algorithm for real biomedical datasets. IJCSNS 17(12):13\u201320","journal-title":"IJCSNS"},{"issue":"10","key":"3976_CR22","doi-asserted-by":"crossref","first-page":"25","DOI":"10.3390\/en11102556","volume":"11","author":"M Tolba","year":"2018","unstructured":"Tolba M, Rezk H, Diab AAZ, Al-Dhaifallah M (2018) A novel robust methodology based salp swarm algorithm for allocation and capacity of renewable distributed generators on distribution grids. Energies 11(10):25\u201356","journal-title":"Energies"},{"key":"3976_CR23","doi-asserted-by":"crossref","unstructured":"Zhang H, Cai Z, Ye X, Wang M, Kuang F, Chen H, Li C, Li Y (2020) A multi-strategy enhanced salp swarm algorithm for global optimization","DOI":"10.1007\/s00366-020-01099-4"},{"key":"3976_CR24","doi-asserted-by":"crossref","first-page":"188","DOI":"10.1016\/j.apm.2020.08.014","volume":"89","author":"R Salgotra","year":"2021","unstructured":"Salgotra R, Singh U, Singh S, Singh G, Mittal N (2021) Self-adaptive salp swarm algorithm for engineering optimization problems. Appl Math Model 89:188\u2013207","journal-title":"Appl Math Model"},{"key":"3976_CR25","doi-asserted-by":"crossref","unstructured":"Singh N, Singh S, Houssein EH (2020) Hybridizing salp swarm algorithm with particle swarm optimization algorithm for recent optimization functions","DOI":"10.1201\/9780429422614-21"},{"issue":"4","key":"3976_CR26","doi-asserted-by":"crossref","first-page":"3519","DOI":"10.1007\/s00366-020-01014-x","volume":"37","author":"E Li","year":"2021","unstructured":"Li E, Zhou J, Shi X, Jahed Armaghani D, Yu Z, Chen X, Huang P (2021) Developing a hybrid model of salp swarm algorithm-based support vector machine to predict the strength of fiber-reinforced cemented paste backfill. Engineering with Computers 37(4):3519\u20133540","journal-title":"Engineering with Computers"},{"key":"3976_CR27","doi-asserted-by":"crossref","first-page":"99740","DOI":"10.1109\/ACCESS.2020.2997783","volume":"8","author":"J Zhang","year":"2020","unstructured":"Zhang J, Wang J. -S. (2020) Improved salp swarm algorithm based on levy flight and sine cosine operator. IEEE Access 8:99740\u201399771","journal-title":"IEEE Access"},{"key":"3976_CR28","unstructured":"Syed MA, Syed R (2019) Weighted salp swarm algorithm and its applications towards optimal sensor deployment, Journal of King Saud University-Computer and Information Sciences"},{"key":"3976_CR29","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1016\/j.eswa.2019.113103","volume":"145","author":"N Neggaz","year":"2020","unstructured":"Neggaz N, Ewees AA, Abd Elaziz M, Mafarja M (2020) Boosting salp swarm algorithm by sine cosine algorithm and disrupt operator for feature selection. Expert Syst Appl 145:113\u2013133","journal-title":"Expert Syst Appl"},{"key":"3976_CR30","first-page":"106","volume":"94","author":"WH El-Ashmawi","year":"2020","unstructured":"El-Ashmawi WH, Ali AF (2020) A modified salp swarm algorithm for task assignment problem. Appl Soft Comput 94:106\u2013127","journal-title":"Appl Soft Comput"},{"issue":"4","key":"3976_CR31","doi-asserted-by":"crossref","first-page":"2743","DOI":"10.1007\/s13369-019-04132-x","volume":"45","author":"N Panda","year":"2020","unstructured":"Panda N, Majhi SK (2020) Improved salp swarm algorithm with space transformation search for training neural network. Arab J Sci Eng 45(4):2743\u20132761","journal-title":"Arab J Sci Eng"},{"key":"3976_CR32","doi-asserted-by":"crossref","unstructured":"Meraihi Y, Ramdane-Cherif A, Mahseur M, Achelia D (2018) A chaotic binary salp swarm algorithm for solving the graph coloring problem. In: International Symposium on Modelling and Implementation of Complex Systems, Springer, pp 106\u2013118","DOI":"10.1007\/978-3-030-05481-6_8"},{"key":"3976_CR33","doi-asserted-by":"crossref","unstructured":"Bairathi D, Gopalani D (2019) Salp swarm algorithm (ssa) for training feed-forward neural networks. In: Soft computing for problem solving, Springer, pp 521\u2013534","DOI":"10.1007\/978-981-13-1592-3_41"},{"key":"3976_CR34","doi-asserted-by":"crossref","unstructured":"Verma S, Shiva CK (2020) A novel salp swarm algorithm for expansion planning with security constraints, Iranian Journal of Science and Technology","DOI":"10.1007\/s40998-020-00315-7"},{"issue":"9","key":"3976_CR35","doi-asserted-by":"crossref","first-page":"5267","DOI":"10.1007\/s00521-019-04029-8","volume":"32","author":"AA El-Fergany","year":"2020","unstructured":"El-Fergany AA, Hasanien HM (2020) Salp swarm optimizer to solve optimal power flow comprising voltage stability analysis. Neural Comput & Applic 32(9):5267\u20135283","journal-title":"Neural Comput & Applic"},{"issue":"8","key":"3976_CR36","doi-asserted-by":"crossref","first-page":"3155","DOI":"10.1007\/s12652-018-1031-9","volume":"10","author":"RA Ibrahim","year":"2019","unstructured":"Ibrahim RA, Ewees AA, Oliva D, Abd Elaziz M, Lu S (2019) Improved salp swarm algorithm based on particle swarm optimization for feature selection. Journal of Ambient Intelligence and Humanized Computing 10(8):3155\u20133169","journal-title":"Journal of Ambient Intelligence and Humanized Computing"},{"key":"3976_CR37","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1016\/j.knosys.2018.05.009","volume":"154","author":"H Faris","year":"2018","unstructured":"Faris H, Mafarja MM, Heidari AA, Aljarah I, Ala\u2019M A.-Z, Mirjalili S, Fujita H (2018) An efficient binary salp swarm algorithm with crossover scheme for feature selection problems. Knowl-Based Syst 154:43\u201367","journal-title":"Knowl-Based Syst"},{"issue":"4","key":"3976_CR38","doi-asserted-by":"crossref","first-page":"1001","DOI":"10.1016\/j.jestch.2018.12.015","volume":"22","author":"AA Ateya","year":"2019","unstructured":"Ateya AA, Muthanna A, Vybornova A, Algarni AD, Abuarqoub A, Koucheryavy Y, Koucheryavy A (2019) Chaotic salp swarm algorithm for sdn multi-controller networks. Engineering Science and Technology, an International Journal 22(4):1001\u20131012","journal-title":"Engineering Science and Technology, an International Journal"},{"key":"3976_CR39","doi-asserted-by":"crossref","first-page":"106","DOI":"10.1016\/j.asoc.2020.106534","volume":"95","author":"SA Medjahed","year":"2020","unstructured":"Medjahed SA, Ouali M (2020) A new hybrid ssa-ta: Salp swarm algorithm with threshold accepting for band selection in hyperspectral images. Appl Soft Comput 95:106\u2013113","journal-title":"Appl Soft Comput"},{"issue":"1","key":"3976_CR40","doi-asserted-by":"crossref","first-page":"185","DOI":"10.1007\/s00366-018-00696-8","volume":"36","author":"N Singh","year":"2020","unstructured":"Singh N, Son LH, Chiclana F, Magnot J.-P. (2020) A new fusion of salp swarm with sine cosine for optimization of non-linear functions. Engineering with Computers 36(1):185\u2013212","journal-title":"Engineering with Computers"},{"issue":"1","key":"3976_CR41","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1186\/s40294-016-0040-9","volume":"5","author":"C-M Pintea","year":"2017","unstructured":"Pintea C.-M., Pop PC, Chira C (2017) The generalized traveling salesman problem solved with ant algorithms. Complex Adaptive Systems Modeling 5(1):1\u20139","journal-title":"Complex Adaptive Systems Modeling"},{"key":"3976_CR42","doi-asserted-by":"crossref","unstructured":"Xiao Y, Jiao J, Pei J, Zhou K, Yang X (2018) A multi-strategy improved ant colony algorithm for solving traveling salesman problem. In: IOP Conference Series: Materials Science and Engineering, Vol. 394, IOP Publishing, p 042101","DOI":"10.1088\/1757-899X\/394\/4\/042101"},{"key":"3976_CR43","doi-asserted-by":"crossref","unstructured":"Gharehchopogh FS, Abdollahzadeh B (2021) An efficient harris hawk optimization algorithm for solving the travelling salesman problem","DOI":"10.1007\/s10586-021-03304-5"},{"key":"3976_CR44","doi-asserted-by":"crossref","first-page":"100607","DOI":"10.1016\/j.swevo.2019.100607","volume":"52","author":"IM Ali","year":"2020","unstructured":"Ali IM, Essam D, Kasmarik K (2020) A novel design of differential evolution for solving discrete traveling salesman problems. Swarm and Evolutionary Computation 52:100607","journal-title":"Swarm and Evolutionary Computation"},{"issue":"3","key":"3976_CR45","doi-asserted-by":"crossref","first-page":"1270","DOI":"10.1002\/int.22342","volume":"36","author":"A Benyamin","year":"2021","unstructured":"Benyamin A, Farhad SG, Saeid B (2021) Discrete farmland fertility optimization algorithm with metropolis acceptance criterion for traveling salesman problems. Int J Intell Syst 36(3):1270\u20131303","journal-title":"Int J Intell Syst"},{"key":"3976_CR46","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1016\/j.eswa.2018.12.044","volume":"122","author":"U Boryczka","year":"2019","unstructured":"Boryczka U, Szwarc K (2019) The harmony search algorithm with additional improvement of harmony memory for asymmetric traveling salesman problem. Expert Syst Appl 122:43\u201353","journal-title":"Expert Syst Appl"},{"issue":"7","key":"3976_CR47","doi-asserted-by":"crossref","first-page":"2155","DOI":"10.1007\/s00521-017-3176-4","volume":"31","author":"Y Zhou","year":"2019","unstructured":"Zhou Y, Wang R, Zhao C, Luo Q, Metwally MA (2019) Discrete greedy flower pollination algorithm for spherical traveling salesman problem. Neural Comput & Applic 31(7):2155\u20132170","journal-title":"Neural Comput & Applic"},{"issue":"1","key":"3976_CR48","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s44196-021-00052-7","volume":"15","author":"J Bi","year":"2022","unstructured":"Bi J, Zhou G, Zhou Y, Luo Q, Deng W (2022) Artificial electric field algorithm with greedy state transition strategy for spherical multiple traveling salesmen problem. International Journal of Computational Intelligence Systems 15(1):1\u201324","journal-title":"International Journal of Computational Intelligence Systems"},{"issue":"3","key":"3976_CR49","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1016\/0304-3975(77)90012-3","volume":"4","author":"CH Papadimitriou","year":"1977","unstructured":"Papadimitriou CH (1977) The euclidean travelling salesman problem is np-complete. Theor Comput Sci 4(3):237\u2013244","journal-title":"Theor Comput Sci"},{"issue":"6","key":"3976_CR50","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(6):791\u2013812","journal-title":"Oper Res"},{"issue":"3","key":"3976_CR51","doi-asserted-by":"crossref","first-page":"806","DOI":"10.1016\/j.ejor.2005.03.059","volume":"179","author":"CD Tarantilis","year":"2007","unstructured":"Tarantilis CD, Kiranoudis CT (2007) A flexible adaptive memory-based algorithm for real-life transportation operations: Two case studies from dairy and construction sector. Eur J Oper Res 179(3):806\u2013822","journal-title":"Eur J Oper Res"},{"issue":"2","key":"3976_CR52","doi-asserted-by":"crossref","first-page":"578","DOI":"10.1016\/j.cor.2005.03.014","volume":"34","author":"N Bianchessi","year":"2007","unstructured":"Bianchessi N, Righini G (2007) Heuristic algorithms for the vehicle routing problem with simultaneous pick-up and delivery. Comput Oper Res 34(2):578\u2013594","journal-title":"Comput Oper Res"},{"issue":"4","key":"3976_CR53","doi-asserted-by":"crossref","first-page":"879","DOI":"10.1016\/j.jestch.2019.11.005","volume":"23","author":"AC Cinar","year":"2020","unstructured":"Cinar AC, Korkmaz S, Kiran MS (2020) A discrete tree-seed algorithm for solving symmetric traveling salesman problem. Engineering Science and Technology, an International Journal 23(4):879\u2013890","journal-title":"Engineering Science and Technology, an International Journal"},{"key":"3976_CR54","doi-asserted-by":"crossref","first-page":"864","DOI":"10.1016\/j.neucom.2015.08.041","volume":"173","author":"X Zhou","year":"2016","unstructured":"Zhou X, Gao DY, Yang C, Gui W (2016) Discrete state transition algorithm for unconstrained integer optimization problems. Neurocomputing 173:864\u2013874","journal-title":"Neurocomputing"},{"key":"3976_CR55","doi-asserted-by":"crossref","first-page":"107","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:107\u2013122","journal-title":"Appl Soft Comput"},{"key":"3976_CR56","unstructured":"Chunhua Y, Xiaolin T, Xiaojun Z, Weihua G (2012) State transition algorithm for traveling salesman problem. In: Proceedings of the 31st Chinese Control Conference, IEEE, pp 2481\u20132485"},{"issue":"1","key":"3976_CR57","doi-asserted-by":"crossref","first-page":"103","DOI":"10.3906\/elk-1210-147","volume":"23","author":"M G\u00fcnd\u00fcz","year":"2015","unstructured":"G\u00fcnd\u00fcz M., Kiran MS, \u00d6zceylan E. (2015) A hierarchic approach based on swarm intelligence to solve the traveling salesman problem. Turk J Electr Eng Comput Sci 23(1):103\u2013117","journal-title":"Turk J Electr Eng Comput Sci"},{"issue":"24","key":"3976_CR58","doi-asserted-by":"crossref","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(24):8167\u20138175","journal-title":"Soft Comput"},{"key":"3976_CR59","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 and Evolutionary Computation 44:428\u2013438","journal-title":"Swarm and Evolutionary Computation"},{"key":"3976_CR60","doi-asserted-by":"crossref","first-page":"105","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:105\u2013121","journal-title":"Appl Soft Comput"},{"key":"3976_CR61","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 A. E. -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":"3976_CR62","doi-asserted-by":"crossref","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 30:484\u2013490","journal-title":"Appl Soft Comput"},{"key":"3976_CR63","doi-asserted-by":"crossref","first-page":"1227","DOI":"10.1016\/j.neucom.2014.01.078","volume":"151","author":"Y Zhou","year":"2015","unstructured":"Zhou Y, Luo Q, Chen H, He A, Wu J (2015) A discrete invasive weed optimization algorithm for solving traveling salesman problem. Neurocomputing 151:1227\u20131236","journal-title":"Neurocomputing"}],"container-title":["Applied Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10489-022-03976-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10489-022-03976-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10489-022-03976-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,20]],"date-time":"2023-05-20T10:17:37Z","timestamp":1684577857000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10489-022-03976-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,9,5]]},"references-count":63,"journal-issue":{"issue":"10","published-print":{"date-parts":[[2023,5]]}},"alternative-id":["3976"],"URL":"https:\/\/doi.org\/10.1007\/s10489-022-03976-5","relation":{},"ISSN":["0924-669X","1573-7497"],"issn-type":[{"value":"0924-669X","type":"print"},{"value":"1573-7497","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,9,5]]},"assertion":[{"value":"5 July 2022","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"5 September 2022","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}