{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,4]],"date-time":"2026-05-04T14:02:35Z","timestamp":1777903355144,"version":"3.51.4"},"reference-count":65,"publisher":"Springer Science and Business Media LLC","issue":"8","license":[{"start":{"date-parts":[[2024,11,22]],"date-time":"2024-11-22T00:00:00Z","timestamp":1732233600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,11,22]],"date-time":"2024-11-22T00:00:00Z","timestamp":1732233600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"name":"BHU","award":["BHU IoE"],"award-info":[{"award-number":["BHU IoE"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["SN COMPUT. SCI."],"DOI":"10.1007\/s42979-024-03420-0","type":"journal-article","created":{"date-parts":[[2024,11,22]],"date-time":"2024-11-22T03:04:44Z","timestamp":1732244684000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Genetic Algorithm Incorporating Group Theory for Solving the General 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"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2597-2458","authenticated-orcid":false,"given":"Anshul","family":"Verma","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,11,22]]},"reference":[{"key":"3420_CR1","first-page":"1","volume":"42","author":"M Akhand","year":"2015","unstructured":"Akhand M, Akter S, Rashid M, Yaakob S. Velocity tentative pso: an optimal velocity implementation based particle swarm optimization to solve traveling salesman problem. IAENG Int J Comput Sci. 2015;42:1\u201312.","journal-title":"IAENG Int J Comput Sci"},{"key":"3420_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":"3420_CR3","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":"3420_CR4","doi-asserted-by":"publisher","first-page":"941","DOI":"10.1109\/72.286889","volume":"4","author":"MKM Ali","year":"1993","unstructured":"Ali MKM, Kamoun F. Neural networks for shortest path computation and routing in computer networks. IEEE Trans Neural Netw. 1993;4:941\u201354.","journal-title":"IEEE Trans Neural Netw"},{"key":"3420_CR5","doi-asserted-by":"publisher","first-page":"613","DOI":"10.1109\/4235.974843","volume":"5","author":"R Baraglia","year":"2001","unstructured":"Baraglia R, Hidalgo JI, Perego R. A hybrid heuristic for the traveling salesman problem. IEEE Trans Evol Comput. 2001;5:613\u201322.","journal-title":"IEEE Trans Evol Comput"},{"key":"3420_CR6","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1016\/j.omega.2004.10.004","volume":"34","author":"T Bektas","year":"2006","unstructured":"Bektas T. The multiple traveling salesman problem: an overview of formulations and solution procedures. Omega. 2006;34:209\u201319.","journal-title":"Omega"},{"key":"3420_CR7","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1023\/A:1018940026670","volume":"89","author":"B Bullnheimer","year":"1999","unstructured":"Bullnheimer B, Hartl RF, Strauss C. An improved ant system algorithm for the vehicle routing problem. Ann Oper Res. 1999;89:319\u201328.","journal-title":"Ann Oper Res"},{"key":"3420_CR8","doi-asserted-by":"publisher","first-page":"800","DOI":"10.1016\/j.asoc.2006.02.002","volume":"7","author":"P-C Chang","year":"2007","unstructured":"Chang P-C, Hsieh J-C, Wang C-Y. Adaptive multi-objective genetic algorithms for scheduling of drilling operation in printed circuit board industry. Appl Soft Comput. 2007;7:800\u20136.","journal-title":"Appl Soft Comput"},{"key":"3420_CR9","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":"3420_CR10","doi-asserted-by":"publisher","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. A hybrid algorithm combining glowworm swarm optimization and complete 2-opt algorithm for spherical travelling salesman problems. Appl Soft Comput. 2017;58:104\u201314.","journal-title":"Appl Soft Comput"},{"key":"3420_CR11","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2480741.2480752","volume":"45","author":"M \u010crepin\u0161ek","year":"2013","unstructured":"\u010crepin\u0161ek M, Liu S-H, Mernik M. Exploration and exploitation in evolutionary algorithms: a survey. ACM Comput Surv (CSUR). 2013;45:1\u201333.","journal-title":"ACM Comput Surv (CSUR)"},{"key":"3420_CR12","doi-asserted-by":"publisher","first-page":"1250","DOI":"10.1016\/j.neucom.2008.01.023","volume":"72","author":"J-C Cr\u00e9put","year":"2009","unstructured":"Cr\u00e9put J-C, Koukam A. A memetic neural network for the Euclidean traveling salesman problem. Neurocomputing. 2009;72:1250\u201364.","journal-title":"Neurocomputing"},{"key":"3420_CR13","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":"3420_CR14","volume-title":"Handbook of genetic algorithms","author":"L Davis","year":"1991","unstructured":"Davis L. Handbook of genetic algorithms. New York: Van Nostrand Reinhold; 1991."},{"key":"3420_CR15","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":"3420_CR16","volume-title":"Graph theory with applications to engineering and computer science","author":"N Deo","year":"2017","unstructured":"Deo N. Graph theory with applications to engineering and computer science. Courier Dover Publications; 2017."},{"key":"3420_CR17","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/j.swevo.2011.02.002","volume":"1","author":"J Derrac","year":"2011","unstructured":"Derrac J, Garc\u00eda S, Molina D, Herrera F. A practical tutorial on the use of nonparametric statistical tests as a methodology for comparing evolutionary and swarm intelligence algorithms. Swarm Evol Comput. 2011;1:3\u201318.","journal-title":"Swarm Evol Comput"},{"key":"3420_CR18","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":"3420_CR19","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1016\/S0303-2647(97)01708-5","volume":"43","author":"M Dorigo","year":"1997","unstructured":"Dorigo M, Gambardella LM. Ant colonies for the travelling salesman problem. Biosystems. 1997;43:73\u201381.","journal-title":"Biosystems"},{"key":"3420_CR20","doi-asserted-by":"publisher","first-page":"348","DOI":"10.1162\/neco.1989.1.3.348","volume":"1","author":"R Durbin","year":"1989","unstructured":"Durbin R, Szeliski R, Yuille A. An analysis of the elastic net approach to the traveling salesman problem. Neural Comput. 1989;1:348\u201358.","journal-title":"Neural Comput"},{"key":"3420_CR21","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. Discrete symbiotic organisms search algorithm for travelling salesman problem. Expert Syst Appl. 2017;87:70\u20138.","journal-title":"Expert Syst Appl"},{"key":"3420_CR22","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":"3420_CR23","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1080\/01969729308961697","volume":"24","author":"DB Fogel","year":"1993","unstructured":"Fogel DB. Applying evolutionary programming to selected traveling salesman problems. Cybern Syst. 1993;24:27\u201336.","journal-title":"Cybern Syst"},{"key":"3420_CR24","doi-asserted-by":"publisher","DOI":"10.1002\/9780470172261","volume-title":"Genetic algorithms and engineering optimization","author":"M Gen","year":"1999","unstructured":"Gen M, Cheng R. Genetic algorithms and engineering optimization, vol. 7. Wiley; 1999."},{"key":"3420_CR25","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":"3420_CR26","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":"3420_CR27","unstructured":"Goldberg D.E, Lingle\u00a0Jr R. Alleleslociand the traveling salesman problem. In: Proceedings of the 1st International Conference on Genetic Algorithms; 1985. pp. 154\u2013159."},{"key":"3420_CR28","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":"3420_CR29","unstructured":"Gr\u00f6tschel M, Padberg M, Lawler E, Lenstra J, Rinnooy\u00a0Kan A, Schmoys D. The traveling salesman problem; 1985"},{"key":"3420_CR30","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2023.122472","volume":"240","author":"P Guti\u00e9rrez-Aguirre","year":"2024","unstructured":"Guti\u00e9rrez-Aguirre P, Contreras-Bolton C. A multioperator genetic algorithm for the traveling salesman problem with job-times. Expert Syst Appl. 2024;240: 122472.","journal-title":"Expert Syst Appl"},{"issue":"3","key":"3420_CR31","doi-asserted-by":"publisher","first-page":"2323","DOI":"10.1007\/s10462-020-09906-6","volume":"54","author":"AH Halim","year":"2020","unstructured":"Halim AH, Ismail I, Das S. Performance assessment of the metaheuristic optimization algorithms: an exhaustive review. Artif Intell Rev. 2020;54(3):2323\u2013409.","journal-title":"Artif Intell Rev"},{"key":"3420_CR32","doi-asserted-by":"publisher","first-page":"1138","DOI":"10.1287\/opre.18.6.1138","volume":"18","author":"M Held","year":"1970","unstructured":"Held M, Karp RM. The traveling-salesman problem and minimum spanning trees. Oper Res. 1970;18:1138\u201362.","journal-title":"Oper Res"},{"key":"3420_CR33","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\u2013Kernighan traveling salesman heuristic. Eur J Oper Res. 2000;126:106\u201330.","journal-title":"Eur J Oper Res"},{"key":"3420_CR34","doi-asserted-by":"publisher","DOI":"10.7551\/mitpress\/1090.001.0001","volume-title":"Adaptation in natural and artificial systems: an introductory analysis with applications to biology, control, and artificial intelligence","author":"JH Holland","year":"1992","unstructured":"Holland JH. Adaptation in natural and artificial systems: an introductory analysis with applications to biology, control, and artificial intelligence. MIT press; 1992."},{"key":"3420_CR35","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1016\/j.egypro.2012.02.101","volume":"17","author":"K Jun-man","year":"2012","unstructured":"Jun-man K, Yi Z. Application of an improved ant colony optimization on generalized traveling salesman problem. Energy Procedia. 2012;17:319\u201325.","journal-title":"Energy Procedia"},{"key":"3420_CR36","doi-asserted-by":"publisher","first-page":"561","DOI":"10.1137\/0208045","volume":"8","author":"RM Karp","year":"1979","unstructured":"Karp RM. A patching algorithm for the nonsymmetric traveling-salesman problem. SIAM J Comput. 1979;8:561\u201373.","journal-title":"SIAM J Comput"},{"key":"3420_CR37","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":"3420_CR38","doi-asserted-by":"publisher","first-page":"3792","DOI":"10.1016\/j.asoc.2013.05.010","volume":"13","author":"S-H Liu","year":"2013","unstructured":"Liu S-H, Mernik M, Hrn\u010di\u010d D, \u010crepin\u0161ek M. A parameter control method of evolutionary algorithms using exploration and exploitation measures with a practical application for fitting sovova\u2019s mass transfer model. Appl Soft Comput. 2013;13:3792\u2013805.","journal-title":"Appl Soft Comput"},{"key":"3420_CR39","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":"3420_CR40","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":"3420_CR41","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":"3420_CR42","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":"3420_CR43","doi-asserted-by":"publisher","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. Discrete cuckoo search algorithm for the travelling salesman problem. Neural Comput Appl. 2014;24:1659\u201369.","journal-title":"Neural Comput Appl"},{"key":"3420_CR44","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 J. 2021;105: 107298.","journal-title":"Appl Soft Comput J"},{"issue":"3","key":"3420_CR45","doi-asserted-by":"publisher","first-page":"819","DOI":"10.1016\/j.ejor.2023.07.022","volume":"314","author":"PC Pop","year":"2023","unstructured":"Pop PC, Cosma O, Sabo C, Sitar CP. A comprehensive survey on the generalized traveling salesman problem. Eur J Oper Res. 2023;314(3):819\u201335.","journal-title":"Eur J Oper Res"},{"key":"3420_CR46","volume-title":"The traveling salesman: computational solutions for TSP applications","author":"G Reinelt","year":"2003","unstructured":"Reinelt G. The traveling salesman: computational solutions for TSP applications, vol. 840. Springer; 2003."},{"key":"3420_CR47","volume-title":"Discrete mathematics and its applications: with combinatorics and graph theory","author":"KH Rosen","year":"2012","unstructured":"Rosen KH, Krithivasan K. Discrete mathematics and its applications: with combinatorics and graph theory. Tata McGraw-Hill Education; 2012."},{"key":"3420_CR48","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1016\/j.engappai.2003.11.001","volume":"17","author":"HA Saleh","year":"2004","unstructured":"Saleh HA, Chelouah R. The design of the global navigation satellite system surveying networks using genetic algorithms. Eng Appl Artif Intell. 2004;17:111\u201322.","journal-title":"Eng Appl Artif Intell"},{"key":"3420_CR49","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1016\/j.ipl.2007.03.010","volume":"103","author":"XH Shi","year":"2007","unstructured":"Shi XH, Liang YC, Lee HP, Lu C, Wang Q. Particle swarm optimization-based algorithms for TSP and generalized TSP. Inf Process Lett. 2007;103:169\u201376.","journal-title":"Inf Process Lett"},{"key":"3420_CR50","doi-asserted-by":"crossref","unstructured":"Singh DR, Singh MK, Singh T. A hybrid heuristic algorithm for the Euclidean traveling salesman problem. In: International Conference on Computing, Communication & Automation. IEEE; 2015. pp. 773\u2013778.","DOI":"10.1109\/CCAA.2015.7148514"},{"key":"3420_CR51","doi-asserted-by":"crossref","unstructured":"Singh DR, Singh MK, Singh T. Multiple traveling salesman problem using novel crossover and group theory. In: 2017 International Conference on Computing, Communication and Automation (ICCCA). IEEE; 2017. pp. 368\u2013372.","DOI":"10.1109\/CCAA.2017.8229844"},{"key":"3420_CR52","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1007\/978-3-540-73190-0_2","volume-title":"Introduction to genetic algorithms","author":"SN Sivanandam","year":"2008","unstructured":"Sivanandam SN, Deepa SN. Genetic algorithms. In: Introduction to genetic algorithms. Springer; 2008. p. 15\u201337."},{"key":"3420_CR53","doi-asserted-by":"publisher","first-page":"919","DOI":"10.1057\/palgrave.jors.2600439","volume":"48","author":"S Somhom","year":"1997","unstructured":"Somhom S, Modares A, Enkawa T. A self-organising model for the travelling salesman problem. J Oper Res Soc. 1997;48:919\u201328.","journal-title":"J Oper Res Soc"},{"key":"3420_CR54","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, Rybansk\u1ef3 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":"3420_CR55","doi-asserted-by":"publisher","first-page":"1495","DOI":"10.1287\/mnsc.38.10.1495","volume":"38","author":"RH Storer","year":"1992","unstructured":"Storer RH, Wu SD, Vaccari R. New search spaces for sequencing problems with application to job shop scheduling. Manag Sci. 1992;38:1495\u2013509.","journal-title":"Manag Sci"},{"key":"3420_CR56","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":"3420_CR57","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1016\/j.ins.2003.11.008","volume":"166","author":"C-F Tsai","year":"2004","unstructured":"Tsai C-F, Tsai C-W, Tseng C-C. A new hybrid heuristic approach for solving large traveling salesman problem. Inf Sci. 2004;166:67\u201381.","journal-title":"Inf Sci"},{"key":"3420_CR58","doi-asserted-by":"publisher","first-page":"477","DOI":"10.15837\/ijccc.2013.3.7","volume":"8","author":"M Tuba","year":"2013","unstructured":"Tuba M, Jovanovic R. Improved ACO algorithm with pheromone correction strategy for the traveling salesman problem. Int J Comput Commun Control. 2013;8:477\u201385.","journal-title":"Int J Comput Commun Control"},{"key":"3420_CR59","doi-asserted-by":"publisher","first-page":"341","DOI":"10.1016\/j.advengsoft.2008.05.004","volume":"40","author":"A U\u011fur","year":"2009","unstructured":"U\u011fur A, Aydin D. An interactive simulation and analysis software for solving TSP using ant colony optimization algorithms. Adv Eng Softw. 2009;40:341\u20139.","journal-title":"Adv Eng Softw"},{"key":"3420_CR60","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1016\/0377-2217(82)90015-7","volume":"9","author":"T Volgenant","year":"1982","unstructured":"Volgenant T, Jonker R. A branch and bound algorithm for the symmetric traveling salesman problem based on the 1-tree relaxation. Eur J Oper Res. 1982;9:83\u20139.","journal-title":"Eur J Oper Res"},{"key":"3420_CR61","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1016\/j.neucom.2017.02.041","volume":"240","author":"H Wang","year":"2017","unstructured":"Wang H, Zhang N, Cr\u00e9put J-C. A massively parallel neural network approach to large-scale Euclidean traveling salesman problems. Neurocomputing. 2017;240:137\u201351.","journal-title":"Neurocomputing"},{"key":"3420_CR62","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"},{"issue":"1","key":"3420_CR63","volume":"2013","author":"H-Y Yun","year":"2013","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(1): 123738.","journal-title":"J Appl Math"},{"key":"3420_CR64","unstructured":"Zhang W. Truncated branch-and-bound: a case study on the asymmetric TSP. In: Proc. Of AAAI 1993 Spring Symposium on AI and NP-hard problems, vol. 160166. 1993. pp. 160\u2013166."},{"key":"3420_CR65","doi-asserted-by":"crossref","unstructured":"Zhao W, Ammar M, Zegura E. A message ferrying approach for data delivery in sparse mobile ad hoc networks. In: Proceedings of the 5th ACM international symposium on Mobile ad hoc networking and computing. 2004. pp. 187\u2013198.","DOI":"10.1145\/989459.989483"}],"container-title":["SN Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s42979-024-03420-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s42979-024-03420-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s42979-024-03420-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,11,22]],"date-time":"2024-11-22T05:41:36Z","timestamp":1732254096000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s42979-024-03420-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,11,22]]},"references-count":65,"journal-issue":{"issue":"8","published-online":{"date-parts":[[2024,12]]}},"alternative-id":["3420"],"URL":"https:\/\/doi.org\/10.1007\/s42979-024-03420-0","relation":{"has-preprint":[{"id-type":"doi","id":"10.21203\/rs.3.rs-4578095\/v1","asserted-by":"object"}]},"ISSN":["2661-8907"],"issn-type":[{"value":"2661-8907","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,11,22]]},"assertion":[{"value":"7 June 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"15 October 2024","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"22 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":"1075"}}