{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T23:46:46Z","timestamp":1740181606711,"version":"3.37.3"},"reference-count":63,"publisher":"Springer Science and Business Media LLC","issue":"8","license":[{"start":{"date-parts":[[2024,11,14]],"date-time":"2024-11-14T00:00:00Z","timestamp":1731542400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,11,14]],"date-time":"2024-11-14T00:00:00Z","timestamp":1731542400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100002742","name":"Banaras Hindu University","doi-asserted-by":"publisher","award":["BHU IoE"],"award-info":[{"award-number":["BHU IoE"]}],"id":[{"id":"10.13039\/501100002742","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["SN COMPUT. SCI."],"DOI":"10.1007\/s42979-024-03417-9","type":"journal-article","created":{"date-parts":[[2024,11,14]],"date-time":"2024-11-14T12:26:06Z","timestamp":1731587166000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Hybrid Heuristic for Solving the Euclidean Travelling Salesman Problem"],"prefix":"10.1007","volume":"5","author":[{"given":"Dharm Raj","family":"Singh","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Manoj Kumar","family":"Singh","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0635-0808","authenticated-orcid":false,"given":"Sachchida Nand","family":"Chaurasia","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pradeepika","family":"Verma","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,11,14]]},"reference":[{"key":"3417_CR1","doi-asserted-by":"publisher","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. Discrete spider monkey optimization for travelling salesman problem. Appl Soft Comput. 2020;86: 105887.","journal-title":"Appl Soft Comput"},{"key":"3417_CR2","doi-asserted-by":"publisher","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. Discrete spider monkey optimization for travelling salesman problem. Appl Soft Comput. 2020;86: 105887.","journal-title":"Appl Soft Comput"},{"key":"3417_CR3","doi-asserted-by":"publisher","DOI":"10.1016\/j.engappai.2020.104006","volume":"97","author":"GH Al-Gaphari","year":"2021","unstructured":"Al-Gaphari GH, Al-Amry R, Al-Nuzaili AS. Discrete crow-inspired algorithms for traveling salesman problem. Eng Appl Artif Intell. 2021;97: 104006.","journal-title":"Eng Appl Artif Intell"},{"key":"3417_CR4","doi-asserted-by":"publisher","first-page":"1313","DOI":"10.1016\/j.eswa.2010.07.006","volume":"38","author":"M Albayrak","year":"2011","unstructured":"Albayrak M, Allahverdi N. Development a new mutation operator to solve the traveling salesman problem by aid of genetic algorithms. Expert Syst Appl. 2011;38:1313\u201320.","journal-title":"Expert Syst Appl"},{"key":"3417_CR5","doi-asserted-by":"publisher","DOI":"10.1016\/j.swevo.2019.100607","volume":"52","author":"IM Ali","year":"2020","unstructured":"Ali IM, Essam D, Kasmarik K. A novel design of differential evolution for solving discrete traveling salesman problems. Swarm Evol Comput. 2020;52: 100607.","journal-title":"Swarm Evol Comput"},{"key":"3417_CR6","doi-asserted-by":"publisher","first-page":"636","DOI":"10.1016\/j.swevo.2018.08.007","volume":"44","author":"M Castelli","year":"2019","unstructured":"Castelli M, Cattaneo G, Manzoni L, Vanneschi L. A distance between populations for n-points crossover in genetic algorithms. Swarm Evol Comput. 2019;44:636\u201345.","journal-title":"Swarm Evol Comput"},{"key":"3417_CR7","doi-asserted-by":"publisher","first-page":"14439","DOI":"10.1016\/j.eswa.2011.04.163","volume":"38","author":"S-M Chen","year":"2011","unstructured":"Chen S-M, Chien C-Y. Solving the traveling salesman problem based on the genetic simulated annealing ant colony system with particle swarm optimization techniques. Expert Syst Appl. 2011;38:14439\u201350.","journal-title":"Expert Syst Appl"},{"key":"3417_CR8","doi-asserted-by":"crossref","unstructured":"Chitty DM. Applying aco to large-scale tsp instances. In: UK workshop on computational intelligence. Springer. 2017. pp. 104\u201318.","DOI":"10.1007\/978-3-319-66939-7_9"},{"key":"3417_CR9","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 L-P, Lim CP. An artificial bee colony algorithm with a modified choice function for the traveling salesman problem. Swarm Evol Comput. 2019;44:622\u201335.","journal-title":"Swarm Evol Comput"},{"key":"3417_CR10","doi-asserted-by":"publisher","first-page":"791","DOI":"10.1287\/opre.6.6.791","volume":"6","author":"GA Croes","year":"1958","unstructured":"Croes GA. A method for solving traveling-salesman problems. Oper Res. 1958;6:791\u2013812.","journal-title":"Oper Res"},{"key":"3417_CR11","doi-asserted-by":"publisher","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. A novel two-stage hybrid swarm intelligence optimization algorithm and application. Soft Comput. 2012;16:1707\u201322.","journal-title":"Soft Comput"},{"key":"3417_CR12","doi-asserted-by":"publisher","first-page":"727","DOI":"10.1016\/j.future.2018.12.065","volume":"95","author":"X Dong","year":"2019","unstructured":"Dong X, Cai Y. A novel genetic algorithm for large scale colored balanced traveling salesman problem. Future Gener Comput Syst. 2019;95:727\u201342.","journal-title":"Future Gener Comput Syst"},{"key":"3417_CR13","doi-asserted-by":"publisher","DOI":"10.1016\/j.engappai.2020.103649","volume":"92","author":"S Ebadinezhad","year":"2020","unstructured":"Ebadinezhad S. Deaco: adopting dynamic evaporation strategy to enhance aco algorithm for the traveling salesman problem. Eng Appl Artif Intell. 2020;92: 103649.","journal-title":"Eng Appl Artif Intell"},{"key":"3417_CR14","doi-asserted-by":"crossref","unstructured":"Eskandari L, Jafarian A, Rahimloo P, Baleanu D. A modified and enhanced ant colony optimization algorithm for traveling salesman problem. In: Mathematical methods in engineering. Springer; 2019. pp. 257\u201365.","DOI":"10.1007\/978-3-319-91065-9_13"},{"key":"3417_CR15","doi-asserted-by":"publisher","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. R. Expert Syst Appl. 2017;87:70\u20138.","journal-title":"Expert Syst Appl"},{"key":"3417_CR16","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1016\/j.eswa.2017.01.053","volume":"77","author":"AE-S Ezugwu","year":"2017","unstructured":"Ezugwu AE-S, Adewumi AO, Fr\u00eencu ME. Simulated annealing based symbiotic organisms search optimization algorithm for traveling salesman problem. Expert Syst Appl. 2017;77:189\u2013210.","journal-title":"Expert Syst Appl"},{"key":"3417_CR17","doi-asserted-by":"crossref","unstructured":"FReisleben B, Merz P. A genetic local search algorithm for solving symmetric and asymmetric traveling salesman problems. In: Proceedings of IEEE international conference on evolutionary computation. IEEE. 1996. pp. 616\u201321.","DOI":"10.1109\/ICEC.1996.542671"},{"key":"3417_CR18","doi-asserted-by":"publisher","first-page":"3680","DOI":"10.1016\/j.asoc.2011.01.039","volume":"11","author":"X Geng","year":"2011","unstructured":"Geng X, Chen Z, Yang W, Shi D, Zhao K. Solving the traveling salesman problem based on an adaptive simulated annealing algorithm with greedy search. Appl Soft Comput. 2011;11:3680\u20139.","journal-title":"Appl Soft Comput"},{"key":"3417_CR19","doi-asserted-by":"publisher","first-page":"671","DOI":"10.1007\/s11047-023-09968-9","volume":"22","author":"FJ Gil-Gala","year":"2023","unstructured":"Gil-Gala FJ, Durasevi\u0107 M, Sierra MR, Varela R. Evolving ensembles of heuristics for the travelling salesman problem. Nat Comput. 2023;22:671\u201384.","journal-title":"Nat Comput"},{"key":"3417_CR20","doi-asserted-by":"publisher","first-page":"3951","DOI":"10.1007\/s40747-022-00932-1","volume":"9","author":"X Gong","year":"2023","unstructured":"Gong X, Rong Z, Wang J, Zhang K, Yang S. A hybrid algorithm based on state-adaptive slime mold model and fractional-order ant system for the travelling salesman problem. Complex Intell Syst. 2023;9:3951\u201370.","journal-title":"Complex Intell Syst"},{"key":"3417_CR21","doi-asserted-by":"publisher","first-page":"8167","DOI":"10.1007\/s00500-017-2760-y","volume":"22","author":"A Hatamlou","year":"2018","unstructured":"Hatamlou A. Solving travelling salesman problem using black hole algorithm. Soft Comput. 2018;22:8167\u201375.","journal-title":"Soft Comput"},{"key":"3417_CR22","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. An effective implementation of the lin-kernighan traveling salesman heuristic. Eur J Oper Res. 2000;126:106\u201330.","journal-title":"Eur J Oper Res"},{"key":"3417_CR23","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2021.107085","volume":"102","author":"Y Huang","year":"2021","unstructured":"Huang Y, Shen X-N, You X. A discrete shuffled frog-leaping algorithm based on heuristic information for traveling salesman problem. Appl Soft Comput. 2021;102: 107085.","journal-title":"Appl Soft Comput"},{"key":"3417_CR24","doi-asserted-by":"crossref","unstructured":"Kanna SR, Sivakumar K, Lingaraj N. Development of deer hunting linked earthworm optimization algorithm for solving large scale traveling salesman problem. Knowl Based Syst. 2021;107199.","DOI":"10.1016\/j.knosys.2021.107199"},{"key":"3417_CR25","doi-asserted-by":"publisher","first-page":"428","DOI":"10.1016\/j.swevo.2018.05.006","volume":"44","author":"I Khan","year":"2019","unstructured":"Khan I, Maiti MK. A swap sequence based artificial bee colony algorithm for traveling salesman problem. Swarm Evol Comput. 2019;44:428\u201338.","journal-title":"Swarm Evol Comput"},{"key":"3417_CR26","doi-asserted-by":"publisher","first-page":"428","DOI":"10.1016\/j.swevo.2018.05.006","volume":"44","author":"I Khan","year":"2019","unstructured":"Khan I, Maiti MK. A swap sequence based artificial bee colony algorithm for traveling salesman problem. Swarm Evol Comput. 2019;44:428\u201338.","journal-title":"Swarm Evol Comput"},{"key":"3417_CR27","doi-asserted-by":"publisher","DOI":"10.1016\/j.buildenv.2021.107721","volume":"196","author":"A Kirimtat","year":"2021","unstructured":"Kirimtat A, KRejcar, O., TasgetiRen, M. F., & HerRera-Viedma, E. Multi-performance based computational model for the cuboid open traveling salesman problem in a smart floating city. Build Environ. 2021;196: 107721.","journal-title":"Build Environ"},{"key":"3417_CR28","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1016\/j.ins.2019.05.075","volume":"502","author":"Y Lu","year":"2019","unstructured":"Lu Y, Hao J-K, Wu Q. Hybrid evolutionary search for the traveling repairman problem with profits. Inf Sci. 2019;502:91\u2013108.","journal-title":"Inf Sci"},{"key":"3417_CR29","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1016\/j.ins.2019.05.075","volume":"502","author":"Y Lu","year":"2019","unstructured":"Lu Y, Hao J-K, Wu Q. Hybrid evolutionary search for the traveling repairman problem with profits. Inf Sci. 2019;502:91\u2013108.","journal-title":"Inf Sci"},{"key":"3417_CR30","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. A new hybrid method based on particle swarm optimization, ant colony optimization and 3-opt algorithms for traveling salesman problem. Appl Soft Comput. 2015;30:484\u201390.","journal-title":"Appl Soft Comput"},{"key":"3417_CR31","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. A hybrid multi-swarm particle swarm optimization algorithm for the probabilistic traveling salesman problem. Comput Oper Res. 2010;37:432\u201342.","journal-title":"Comput Oper Res"},{"key":"3417_CR32","doi-asserted-by":"publisher","first-page":"1454","DOI":"10.1016\/j.ins.2008.12.016","volume":"179","author":"TA Masutti","year":"2009","unstructured":"Masutti TA, de Castro LN. A self-organizing neural network using ideas from the immune system to solve the traveling salesman problem. Inf Sci. 2009;179:1454\u201368.","journal-title":"Inf Sci"},{"key":"3417_CR33","doi-asserted-by":"publisher","first-page":"4023","DOI":"10.1016\/j.asoc.2013.05.022","volume":"13","author":"M Mavrovouniotis","year":"2013","unstructured":"Mavrovouniotis M, Yang S. Ant colony optimization with immigrants schemes for the dynamic travelling salesman problem with traffic factors. Appl Soft Comput. 2013;13:4023\u201337.","journal-title":"Appl Soft Comput"},{"key":"3417_CR34","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 X-S, Diaz F, Lopez-Garcia P, Carballedo R. An improved discrete bat algorithm for symmetric and asymmetric traveling salesman problems. Eng Appl Artif Intell. 2016;48:59\u201371.","journal-title":"Eng Appl Artif Intell"},{"key":"3417_CR35","doi-asserted-by":"publisher","first-page":"849","DOI":"10.1007\/s10489-015-0730-6","volume":"44","author":"V Pandiri","year":"2016","unstructured":"Pandiri V, Singh A. Swarm intelligence approaches for multidepot salesmen problems with load balancing. Appl Intell. 2016;44:849\u201361.","journal-title":"Appl Intell"},{"key":"3417_CR36","doi-asserted-by":"publisher","first-page":"4412","DOI":"10.1007\/s10489-018-1216-0","volume":"48","author":"V Pandiri","year":"2018","unstructured":"Pandiri V, Singh A. A swarm intelligence approach for the colored traveling salesman problem. Appl Intell. 2018;48:4412\u201328.","journal-title":"Appl Intell"},{"key":"3417_CR37","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2021.107298","volume":"105","author":"K Panwar","year":"2021","unstructured":"Panwar K, Deep K. Discrete grey wolf optimizer for symmetric travelling salesman problem. Appl Soft Comput. 2021;105: 107298.","journal-title":"Appl Soft Comput"},{"key":"3417_CR38","doi-asserted-by":"crossref","unstructured":"Pop PC, Cosma O, Sabo C, Sitar CP. A comprehensive survey on the generalized traveling salesman problem. Eur J Oper Res. 2023.","DOI":"10.1016\/j.ejor.2023.07.022"},{"key":"3417_CR39","first-page":"17","volume":"15","author":"N Rokbani","year":"2019","unstructured":"Rokbani N, Abraham A, Twir I, Haqiq A. Solving the travelling salesman problem using fuzzy and simplified variants of ant supervised by pso with local search policy, fas-pso-ls, sas-pso-ls. Int J Hybrid Intell Syst. 2019;15:17\u201326.","journal-title":"Int J Hybrid Intell Syst"},{"key":"3417_CR40","doi-asserted-by":"publisher","first-page":"3775","DOI":"10.1007\/s00500-020-05406-5","volume":"25","author":"N Rokbani","year":"2021","unstructured":"Rokbani N, Kumar R, Abraham A, Alimi AM, Long HV, Priyadarshini I, Son LH. Bi-heuristic ant colony optimization-based approaches for traveling salesman problem. Soft Comput. 2021;25:3775\u201394.","journal-title":"Soft Comput"},{"key":"3417_CR41","doi-asserted-by":"publisher","first-page":"100","DOI":"10.31181\/dmame1902076r","volume":"2","author":"A Roy","year":"2019","unstructured":"Roy A, Manna A, Maity S. A novel memetic genetic algorithm for solving traveling salesman problem based on multi-parent crossover technique. Decis Mak Appl Manag Eng. 2019;2:100\u201311.","journal-title":"Decis Mak Appl Manag Eng"},{"key":"3417_CR42","doi-asserted-by":"publisher","first-page":"324","DOI":"10.1016\/j.engappai.2014.06.026","volume":"35","author":"T Saenphon","year":"2014","unstructured":"Saenphon T, PhimoltaRefs S, Lursinsap C. Combining new fast opposite gradient search with ant colony optimization for solving travelling salesman problem. Eng Appl Artif Intell. 2014;35:324\u201334.","journal-title":"Eng Appl Artif Intell"},{"key":"3417_CR43","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1007\/s12065-019-00208-7","volume":"12","author":"SK Sahana","year":"2019","unstructured":"Sahana SK. Hybrid optimizer for the travelling salesman problem. Evol Intell. 2019;12:179\u201388.","journal-title":"Evol Intell"},{"key":"3417_CR44","doi-asserted-by":"crossref","unstructured":"Sahin M. Solving tsp by using combinatorial bees algorithm with nearest neighbor method. Neural Comput Appl. 2022;1\u201317.","DOI":"10.1007\/s00521-022-07816-y"},{"key":"3417_CR45","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2021.114639","volume":"172","author":"Y Saji","year":"2021","unstructured":"Saji Y, Barkatou M. A discrete bat algorithm based on levy flights for Euclidean traveling salesman problem. Expert Syst Appl. 2021;172: 114639.","journal-title":"Expert Syst Appl"},{"key":"3417_CR46","first-page":"29","volume":"1","author":"DR Singh","year":"2016","unstructured":"Singh DR, Singh MK, Singh T. A hybrid algorithm with modified inver-over operator and ant colony optimization for traveling salesman problem. Adv Comput Control Commun Technol. 2016;1:29.","journal-title":"Adv Comput Control Commun Technol"},{"key":"3417_CR47","doi-asserted-by":"crossref","unstructured":"Singh DR, Singh MK, Singh T. A hybrid algorithm with modified inver-over operator and genetic algorithm search for traveling salesman problem. In: Advanced computing and communication technologies. Springer; 2016b. pp. 141\u201350.","DOI":"10.1007\/978-981-10-1023-1_14"},{"key":"3417_CR48","doi-asserted-by":"publisher","first-page":"884","DOI":"10.3390\/e22080884","volume":"22","author":"P Stodola","year":"2020","unstructured":"Stodola P, Michenka K, Nohel J, Rybansky M. Hybrid algorithm based on ant colony optimization and simulated annealing applied to the dynamic traveling salesman problem. Entropy. 2020;22:884.","journal-title":"Entropy"},{"key":"3417_CR49","doi-asserted-by":"publisher","first-page":"420","DOI":"10.1016\/j.ejor.2018.06.039","volume":"272","author":"\u00c9D Taillard","year":"2019","unstructured":"Taillard \u00c9D, Helsgaun K. Popmusic for the travelling salesman problem. Eur J Oper Res. 2019;272:420\u20139.","journal-title":"Eur J Oper Res"},{"key":"3417_CR50","doi-asserted-by":"crossref","unstructured":"Tao G, Michalewicz Z. Inver-over operator for the tsp. In: International conference on parallel problem solving from nature. Springer. 1998. pp. 803\u201312.","DOI":"10.1007\/BFb0056922"},{"key":"3417_CR51","doi-asserted-by":"publisher","first-page":"6417","DOI":"10.3390\/app13116417","volume":"13","author":"T Tawanda","year":"2023","unstructured":"Tawanda T, Nyamugure P, Kumar S, Munapo E. A labelling method for the travelling salesman problem. Appl Sci. 2023;13:6417.","journal-title":"Appl Sci"},{"key":"3417_CR52","doi-asserted-by":"publisher","first-page":"3669","DOI":"10.1007\/s13369-018-3617-0","volume":"44","author":"MA Tawhid","year":"2019","unstructured":"Tawhid MA, Savsani P. Discrete sine-cosine algorithm (dsca) with local search for solving traveling salesman problem. Arab J Sci Eng. 2019;44:3669\u201379.","journal-title":"Arab J Sci Eng"},{"key":"3417_CR53","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2020.106720","volume":"97","author":"AF Tuani","year":"2020","unstructured":"Tuani AF, Keedwell E, Collett M. Heterogenous adaptive ant colony optimization with 3-opt local search for the travelling salesman problem. Appl Soft Comput. 2020;97: 106720.","journal-title":"Appl Soft Comput"},{"key":"3417_CR54","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2019.105949","volume":"88","author":"Y Wang","year":"2020","unstructured":"Wang Y, Li C, Yin M. A two-phase removing algorithm for minimum independent dominating set problem. Appl Soft Comput. 2020;88: 105949.","journal-title":"Appl Soft Comput"},{"key":"3417_CR55","doi-asserted-by":"crossref","unstructured":"Wang Y, Sun J, Li J, Gao K. A modified inver-over operator for the traveling salesman problem. In: International conference on intelligent computing. Springer. 2011a. pp. 17\u201323.","DOI":"10.1007\/978-3-642-25944-9_3"},{"key":"3417_CR56","doi-asserted-by":"publisher","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. Discrete symbiotic organism search with excellence coefficients and self-escape for traveling salesman problem. Comput Ind Eng. 2019;131:269\u201381.","journal-title":"Comput Ind Eng"},{"key":"3417_CR57","doi-asserted-by":"publisher","first-page":"2743","DOI":"10.1016\/j.camwa.2011.06.063","volume":"62","author":"Y-T Wang","year":"2011","unstructured":"Wang Y-T, Li J-Q, Gao K-Z, Pan Q-K. Memetic algorithm based on improved inver-over operator and lin-kernighan local search for the euclidean traveling salesman problem. Comput Math Appl. 2011;62:2743\u201354.","journal-title":"Comput Math Appl"},{"key":"3417_CR58","doi-asserted-by":"crossref","unstructured":"Wei F-F, Chen W-N, Hu X-M, Zhang J. An empirical study on evolutionary algorithms for traveling salesman problem. In: 2019 9th international conference on information science and technology (ICIST). IEEE. 2019, pp. 273\u201380.","DOI":"10.1109\/ICIST.2019.8836906"},{"key":"3417_CR59","doi-asserted-by":"publisher","first-page":"4529","DOI":"10.1007\/s10489-020-01799-w","volume":"50","author":"K Yang","year":"2020","unstructured":"Yang K, You X, Liu S, Pan H. A novel ant colony optimization based on game for traveling salesman problem. Appl Intell. 2020;50:4529\u201342.","journal-title":"Appl Intell"},{"key":"3417_CR60","doi-asserted-by":"crossref","unstructured":"Yun H-Y, Jeong S-J, Kim K-S. Advanced harmony search with ant colony optimization for solving the traveling salesman problem. J Appl Math. 2013;2013.","DOI":"10.1155\/2013\/123738"},{"key":"3417_CR61","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. Hybrid discrete artificial bee colony algorithm with threshold acceptance criterion for traveling salesman problem. Inf Sci. 2017;421:70\u201384.","journal-title":"Inf Sci"},{"key":"3417_CR62","doi-asserted-by":"publisher","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. A discrete invasive weed optimization algorithm for solving traveling salesman problem. Neurocomputing. 2015;151:1227\u201336.","journal-title":"Neurocomputing"},{"key":"3417_CR63","first-page":"68","volume":"1","author":"Y Zhou","year":"2014","unstructured":"Zhou Y, Ouyang X, Xie J. A discrete cuckoo search algorithm for travelling salesman problem. Int J Collab Intell. 2014;1:68\u201384.","journal-title":"Int J Collab Intell"}],"container-title":["SN Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s42979-024-03417-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s42979-024-03417-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s42979-024-03417-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,11,14]],"date-time":"2024-11-14T12:30:07Z","timestamp":1731587407000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s42979-024-03417-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,11,14]]},"references-count":63,"journal-issue":{"issue":"8","published-online":{"date-parts":[[2024,12]]}},"alternative-id":["3417"],"URL":"https:\/\/doi.org\/10.1007\/s42979-024-03417-9","relation":{},"ISSN":["2661-8907"],"issn-type":[{"type":"electronic","value":"2661-8907"}],"subject":[],"published":{"date-parts":[[2024,11,14]]},"assertion":[{"value":"8 June 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"14 October 2024","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"14 November 2024","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"}},{"value":"This article does not contain any studies with human participants or animals performed by any of the authors.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethical approval"}}],"article-number":"1050"}}