{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,18]],"date-time":"2026-05-18T22:42:23Z","timestamp":1779144143301,"version":"3.51.4"},"reference-count":70,"publisher":"Springer Science and Business Media LLC","issue":"23-24","license":[{"start":{"date-parts":[[2024,12,1]],"date-time":"2024-12-01T00:00:00Z","timestamp":1733011200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,12,1]],"date-time":"2024-12-01T00:00:00Z","timestamp":1733011200000},"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":["Soft Comput"],"published-print":{"date-parts":[[2024,12]]},"DOI":"10.1007\/s00500-024-10340-x","type":"journal-article","created":{"date-parts":[[2024,12,9]],"date-time":"2024-12-09T07:21:10Z","timestamp":1733728870000},"page":"13127-13148","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":11,"title":["A hybridization of grey wolf optimizer and genetic algorithm for the traveling salesman problems"],"prefix":"10.1007","volume":"28","author":[{"ORCID":"https:\/\/orcid.org\/0009-0001-3605-8330","authenticated-orcid":false,"given":"Sk Hojayfa","family":"Rahaman","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0002-1033-578X","authenticated-orcid":false,"given":"Manas Kumar","family":"Maiti","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,12,9]]},"reference":[{"key":"10340_CR1","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1016\/j.cie.2015.06.018","volume":"88","author":"K Aditi","year":"2015","unstructured":"Aditi K, Kumar MM, Manoranjan M (2015) Profit maximization of TSP through a hybrid algorithm. Comput Ind Eng 88:229\u2013236","journal-title":"Comput Ind Eng"},{"issue":"15","key":"10340_CR2","first-page":"3768","volume":"99","author":"HH Ahmad Bany Doumi","year":"2021","unstructured":"Ahmad Bany Doumi HH, Mahafzah Basel A (2021) Solving traveling salesman problem using genetic algorithm based on efficient mutation operator. J Theor Appl Inf Technol 99(15):3768\u20133781","journal-title":"J Theor Appl Inf Technol"},{"key":"10340_CR3","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s11227-017-2102-y","volume":"74","author":"A Al-Adwan","year":"2018","unstructured":"Al-Adwan A, Mahafzah BA, Sharieh A (2018) Solving traveling salesman problem using parallel repetitive nearest neighbor algorithm on OTIS-hypercube and OTIS-mesh optoelectronic architectures. J Supercomput 74:1\u201336","journal-title":"J Supercomput"},{"key":"10340_CR4","doi-asserted-by":"crossref","first-page":"661","DOI":"10.1007\/s10489-018-1283-2","volume":"49","author":"A Al-Adwan","year":"2019","unstructured":"Al-Adwan A, Sharieh A, Mahafzah BA (2019) Parallel heuristic local search algorithm on OTIS hyper hexa-cell and OTIS mesh of trees optoelectronic architectures. Appl Intell 49:661\u2013688","journal-title":"Appl Intell"},{"issue":"6","key":"10340_CR5","doi-asserted-by":"crossref","first-page":"B-279","DOI":"10.1287\/mnsc.18.6.B279","volume":"18","author":"R Angel","year":"1972","unstructured":"Angel R, Caudle W, Noonan R, Whinston A (1972) Computer-assisted school bus scheduling. Manag Sci 18(6):B-279","journal-title":"Manag Sci"},{"key":"10340_CR6","first-page":"193","volume":"17","author":"JS Arias-Rojas","year":"2012","unstructured":"Arias-Rojas JS, Jim\u00e9nez JF, Montoya-Torres JR (2012) Solving of school bus routing problem by ant colony optimization. Rev EIA 17:193\u2013208","journal-title":"Rev EIA"},{"key":"10340_CR7","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1007\/BF01324873","volume":"6","author":"JF Bard","year":"1994","unstructured":"Bard JF, Clayton RW, Feo TA (1994) Machine setup and component placement in printed circuit board assembly. Int J Flex Manuf Syst 6:5\u201331","journal-title":"Int J Flex Manuf Syst"},{"key":"10340_CR8","doi-asserted-by":"crossref","unstructured":"Brumitt BL, Stentz A (1996) Dynamic mission planning for multiple mobile robots. In: Proceedings of IEEE international conference on robotics and automation, vol 3. IEEE, pp 2396\u20132401","DOI":"10.1109\/ROBOT.1996.506522"},{"key":"10340_CR9","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1007\/BF00940812","volume":"45","author":"V \u010cern\u1ef3","year":"1985","unstructured":"\u010cern\u1ef3 V (1985) Thermodynamical approach to the traveling salesman problem: an efficient simulation algorithm. J Optim Theory Appl 45:41\u201351","journal-title":"J Optim Theory Appl"},{"issue":"10","key":"10340_CR10","doi-asserted-by":"crossref","first-page":"1837","DOI":"10.1080\/00207548908942657","volume":"27","author":"D Chan","year":"1989","unstructured":"Chan D, Mercier D (1989) IC insertion: an application of the travelling salesman problem. Int J Prod Res 27(10):1837\u20131841","journal-title":"Int J Prod Res"},{"issue":"1","key":"10340_CR11","first-page":"1","volume":"10","author":"C Changdar","year":"2013","unstructured":"Changdar C, Maiti MK, Maiti M (2013) A constrained solid tsp in fuzzy environment: two heuristic approaches. Iran J Fuzzy Syst 10(1):1\u201328","journal-title":"Iran J Fuzzy Syst"},{"key":"10340_CR12","doi-asserted-by":"crossref","first-page":"798","DOI":"10.1016\/j.sbspro.2012.09.796","volume":"54","author":"F Ciaffi","year":"2012","unstructured":"Ciaffi F, Cipriani E, Petrelli M (2012) Feeder bus network design problem: a new metaheuristic procedure and real size applications. Procedia Soc Behav Sci 54:798\u2013807","journal-title":"Procedia Soc Behav Sci"},{"issue":"4","key":"10340_CR13","first-page":"393","volume":"2","author":"G Dantzig","year":"1954","unstructured":"Dantzig G, Fulkerson R, Johnson S (1954) Solution of a large-scale traveling-salesman problem. J Oper Res Soc Am 2(4):393\u2013410","journal-title":"J Oper Res Soc Am"},{"issue":"1","key":"10340_CR14","doi-asserted-by":"crossref","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 (2011) A practical tutorial on the use of nonparametric statistical tests as a methodology for comparing evolutionary and swarm intelligence algorithms. Swarm Evol Comput 1(1):3\u201318","journal-title":"Swarm Evol Comput"},{"key":"10340_CR15","unstructured":"Dorigo M (1992) Optimization, learning and natural algorithms. Ph.D. Thesis, Politecnico di Milano"},{"issue":"1","key":"10340_CR16","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1109\/3477.484436","volume":"26","author":"M Dorigo","year":"1996","unstructured":"Dorigo M, Maniezzo V, Colorni A (1996) Ant system: optimization by a colony of cooperating agents. IEEE Trans Syst Man Cybern B (Cybern) 26(1):29\u201341","journal-title":"IEEE Trans Syst Man Cybern B (Cybern)"},{"issue":"1","key":"10340_CR17","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1080\/00207540310001601073","volume":"42","author":"E Duman","year":"2004","unstructured":"Duman E, Or I (2004) Precedence constrained TSP arising in printed circuit board assembly. Int J Prod Res 42(1):67\u201378","journal-title":"Int J Prod Res"},{"key":"10340_CR18","doi-asserted-by":"crossref","first-page":"186","DOI":"10.1016\/j.ins.2017.07.015","volume":"417","author":"T Eftimov","year":"2017","unstructured":"Eftimov T, Koro\u0161ec P, Seljak BK (2017) A novel approach to statistical comparison of meta-heuristic stochastic optimization algorithms using deep statistics. Inf Sci 417:186\u2013215","journal-title":"Inf Sci"},{"issue":"4","key":"10340_CR19","first-page":"163","volume":"8","author":"E Filip","year":"2011","unstructured":"Filip E, Otakar M (2011) The travelling salesman problem and its application in logistic practice. WSEAS Trans Bus Econ 8(4):163\u2013173","journal-title":"WSEAS Trans Bus Econ"},{"issue":"23","key":"10340_CR20","doi-asserted-by":"crossref","first-page":"17957","DOI":"10.1007\/s00500-020-05043-y","volume":"24","author":"V Gabrel","year":"2020","unstructured":"Gabrel V, Mahjoub AR, Taktak R, Uchoa E (2020) The multiple Steiner TSP with order constraints: complexity and optimization algorithms. Soft Comput 24(23):17957\u201317968","journal-title":"Soft Comput"},{"issue":"1","key":"10340_CR21","doi-asserted-by":"crossref","first-page":"56","DOI":"10.1504\/IJOR.2018.091202","volume":"32","author":"PK Giri","year":"2018","unstructured":"Giri PK, Maiti MK, Maiti M (2018) Simulation approach to solve fuzzy fixed charge multi-item solid transportation problems under budget constraint. Int J Oper Res 32(1):56\u201391","journal-title":"Int J Oper Res"},{"key":"10340_CR22","doi-asserted-by":"crossref","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:107275","journal-title":"Appl Soft Comput"},{"key":"10340_CR23","volume-title":"The traveling salesman problem and its variations","author":"G Gutin","year":"2006","unstructured":"Gutin G, Punnen AP (2006) The traveling salesman problem and its variations, vol 12. Springer, Berlin"},{"key":"10340_CR24","unstructured":"Holland J (1975) An introductory analysis with applications to biology, control, and artificial intelligence. In: Adaptation in natural and artificial systems, 1st ed. The University of Michigan, USA"},{"issue":"8","key":"10340_CR25","doi-asserted-by":"crossref","first-page":"4975","DOI":"10.1007\/s00500-022-07581-z","volume":"27","author":"R Jain","year":"2023","unstructured":"Jain R, Singh KP, Meena A, Rana KB, Meena ML, Dangayach GS, Gao X-Z (2023) Application of proposed hybrid active genetic algorithm for optimization of traveling salesman problem. Soft Comput 27(8):4975\u20134985","journal-title":"Soft Comput"},{"key":"10340_CR26","volume":"139","author":"GK Jati","year":"2023","unstructured":"Jati GK, Kuwanto G, Hashmi T, Widjaja H (2023) Discrete Komodo algorithm for traveling salesman problem. Appl Soft Comput 139:110219","journal-title":"Appl Soft Comput"},{"key":"10340_CR27","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"},{"issue":"1","key":"10340_CR28","first-page":"108","volume":"214","author":"D Karaboga","year":"2009","unstructured":"Karaboga D, Akay B (2009) A comparative study of artificial bee colony algorithm. Appl Math Comput 214(1):108\u2013132","journal-title":"Appl Math Comput"},{"key":"10340_CR29","doi-asserted-by":"crossref","first-page":"459","DOI":"10.1007\/s10898-007-9149-x","volume":"39","author":"D Karaboga","year":"2007","unstructured":"Karaboga D, Basturk B (2007) A powerful and efficient algorithm for numerical function optimization: artificial bee colony (ABC) algorithm. J Global Optim 39:459\u2013471","journal-title":"J Global Optim"},{"issue":"1","key":"10340_CR30","doi-asserted-by":"crossref","first-page":"687","DOI":"10.1016\/j.asoc.2007.05.007","volume":"8","author":"D Karaboga","year":"2008","unstructured":"Karaboga D, Basturk B (2008) On the performance of artificial bee colony (ABC) algorithm. Appl Soft Comput 8(1):687\u2013697","journal-title":"Appl Soft Comput"},{"key":"10340_CR31","unstructured":"Karaboga D et\u00a0al (2005) An idea based on honey bee swarm for numerical optimization. Technical report-tr06, Erciyes University, Engineering Faculty, Computer"},{"key":"10340_CR32","doi-asserted-by":"crossref","unstructured":"Kennedy J, Eberhart R (1995) Particle swarm optimization. In: Proceedings of ICNN\u201995-international conference on neural networks, vol 4. IEEE, pp 1942\u20131948","DOI":"10.1109\/ICNN.1995.488968"},{"key":"10340_CR33","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":"10340_CR34","doi-asserted-by":"crossref","unstructured":"Khan I, Maiti MK, Maiti M (2017) Coordinating particle swarm optimization, ant colony optimization and k-opt algorithm for traveling salesman problem. In: Mathematics and computing: third international conference, ICMC 2017, Haldia, India, 17\u201321 Jan 2017, Proceedings 3. Springer, pp\u00a0103\u2013119","DOI":"10.1007\/978-981-10-4642-1_10"},{"issue":"05","key":"10340_CR35","doi-asserted-by":"crossref","first-page":"693","DOI":"10.1142\/S0218488519500314","volume":"27","author":"I Khan","year":"2019","unstructured":"Khan I, Pal S, Maiti MK (2019) A hybrid PSO-GA algorithm for traveling salesman problems in different environments. Int J Uncertain Fuzziness Knowl-Based Syst 27(05):693\u2013717","journal-title":"Int J Uncertain Fuzziness Knowl-Based Syst"},{"key":"10340_CR36","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1016\/j.cie.2015.06.018","volume":"88","author":"A Khanra","year":"2015","unstructured":"Khanra A, Maiti MK, Maiti M (2015) Profit maximization of tsp through a hybrid algorithm. Comput Ind Eng 88:229\u2013236","journal-title":"Comput Ind Eng"},{"issue":"4","key":"10340_CR37","doi-asserted-by":"crossref","first-page":"1987","DOI":"10.3233\/IFS-151913","volume":"30","author":"A Khanra","year":"2016","unstructured":"Khanra A, Maiti MK, Maiti M (2016) A hybrid heuristic algorithm for single and multi-objective imprecise traveling salesman problems. J Intell Fuzzy Syst 30(4):1987\u20132001","journal-title":"J Intell Fuzzy Syst"},{"issue":"2","key":"10340_CR38","doi-asserted-by":"crossref","first-page":"265","DOI":"10.22457\/apam.v16n2a2","volume":"16","author":"A Khanra","year":"2018","unstructured":"Khanra A, Maiti MK, Pal T, Maiti M (2018) Special TSPS considering conveyances and routes through a hybrid algorithm. Ann Pure Appl Math 16(2):265\u2013281","journal-title":"Ann Pure Appl Math"},{"issue":"3","key":"10340_CR39","doi-asserted-by":"crossref","first-page":"321","DOI":"10.1016\/S0925-5273(98)00010-3","volume":"54","author":"L Khoo","year":"1998","unstructured":"Khoo L, Ng T (1998) A genetic algorithm-based planning system for PCB component placement. Int J Prod Econ 54(3):321\u2013332","journal-title":"Int J Prod Econ"},{"issue":"4598","key":"10340_CR40","doi-asserted-by":"crossref","first-page":"671","DOI":"10.1126\/science.220.4598.671","volume":"220","author":"S Kirkpatrick","year":"1983","unstructured":"Kirkpatrick S, Gelatt CD Jr, Vecchi MP (1983) Optimization by simulated annealing. Science 220(4598):671\u2013680","journal-title":"Science"},{"issue":"2","key":"10340_CR41","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1016\/j.robot.2013.09.005","volume":"62","author":"E Kolakowska","year":"2014","unstructured":"Kolakowska E, Smith SF, Kristiansen M (2014) Constraint optimization model of a scheduling problem for a robotic arm in automatic systems. Robot Auton Syst 62(2):267\u2013280","journal-title":"Robot Auton Syst"},{"issue":"1","key":"10340_CR42","doi-asserted-by":"crossref","first-page":"14","DOI":"10.1109\/TEPM.2003.813002","volume":"26","author":"R Kumar","year":"2003","unstructured":"Kumar R, Luo Z (2003) Optimizing the operation sequence of a chip placement machine using TSP model. IEEE Trans Electron Packag Manuf 26(1):14\u201321","journal-title":"IEEE Trans Electron Packag Manuf"},{"key":"10340_CR43","unstructured":"Lawler EL (1985) The traveling salesman problem: a guided tour of combinatorial optimization. Wiley-interscience series in discrete mathematics. Wiley, Chichester [West Sussex]"},{"issue":"2","key":"10340_CR44","doi-asserted-by":"crossref","first-page":"498","DOI":"10.1287\/opre.21.2.498","volume":"21","author":"S Lin","year":"1973","unstructured":"Lin S, Kernighan BW (1973) An effective heuristic algorithm for the traveling-salesman problem. Oper Res 21(2):498\u2013516","journal-title":"Oper Res"},{"key":"10340_CR45","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"},{"issue":"9","key":"10340_CR46","doi-asserted-by":"crossref","first-page":"3063","DOI":"10.1016\/j.cam.2010.12.027","volume":"235","author":"J Majumdar","year":"2011","unstructured":"Majumdar J, Bhunia AK (2011) Genetic algorithm for asymmetric traveling salesman problem with imprecise travel times. J Comput Appl Math 235(9):3063\u20133078","journal-title":"J Comput Appl Math"},{"key":"10340_CR47","doi-asserted-by":"crossref","first-page":"46","DOI":"10.1016\/j.advengsoft.2013.12.007","volume":"69","author":"S Mirjalili","year":"2014","unstructured":"Mirjalili S, Mirjalili SM, Lewis A (2014) Grey wolf optimizer. Adv Eng Softw 69:46\u201361","journal-title":"Adv Eng Softw"},{"key":"10340_CR48","unstructured":"Oliver I, Smith D, Holland JR (1987) Study of permutation crossover operators on the traveling salesman problem. In: Genetic algorithms and their applications: proceedings of the second international conference on genetic algorithms: 28\u201331 July 1987 at the Massachusetts Institute of Technology, Cambridge, MA"},{"key":"10340_CR49","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"},{"issue":"06","key":"10340_CR50","doi-asserted-by":"crossref","first-page":"975","DOI":"10.1142\/S0218488523500447","volume":"31","author":"S Pal","year":"2023","unstructured":"Pal S, Dutta P, Khan I, Pramanik P, Maiti AK, Maiti MK (2023) Coordination of cyclic crossover and bat algorithm for the travelling salesman problems in different environments: a simulation approach. Int J Uncertain Fuzziness Knowl-Based Syst 31(06):975\u20131003","journal-title":"Int J Uncertain Fuzziness Knowl-Based Syst"},{"key":"10340_CR51","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"},{"issue":"4","key":"10340_CR52","doi-asserted-by":"crossref","first-page":"929","DOI":"10.1016\/j.cie.2010.09.003","volume":"59","author":"MM Paydar","year":"2010","unstructured":"Paydar MM, Mahdavi I, Sharafuddin I, Solimanpur M (2010) Applying simulated annealing for designing cellular manufacturing systems using MDMTSP. Comput Ind Eng 59(4):929\u2013936","journal-title":"Comput Ind Eng"},{"key":"10340_CR53","doi-asserted-by":"crossref","unstructured":"Picard J-C, Queyranne M (1978) The time-dependent traveling salesman problem and its application to the tardiness problem in one-machine scheduling. Oper Res 26(1):86\u2013110","DOI":"10.1287\/opre.26.1.86"},{"issue":"4","key":"10340_CR54","doi-asserted-by":"crossref","first-page":"376","DOI":"10.1287\/ijoc.3.4.376","volume":"3","author":"G Reinelt","year":"1991","unstructured":"Reinelt G (1991) TSPLIB\u2014a traveling salesman problem library. ORSA J Comput 3(4):376\u2013384","journal-title":"ORSA J Comput"},{"key":"10340_CR55","unstructured":"Rookmaaker K (2009) Darwin\u2019s itinerary on the voyage of the beagle. The complete work of Charles Darwin Online. www.darwinonline.org.uk"},{"issue":"3","key":"10340_CR56","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1177\/0278364906061705","volume":"25","author":"M Saha","year":"2006","unstructured":"Saha M, Roughgarden T, Latombe J-C, S\u00e1nchez-Ante G (2006) Planning tours of robotic arms among partitioned goals. Int J Robot Res 25(3):207\u2013223","journal-title":"Int J Robot Res"},{"issue":"8","key":"10340_CR57","doi-asserted-by":"crossref","first-page":"142","DOI":"10.5539\/mas.v12n8p142","volume":"12","author":"A Shaheen","year":"2018","unstructured":"Shaheen A, Sleit A, Al-Sharaeh S (2018) Travelling salesman problem solution based-on grey wolf algorithm over hypercube interconnection network. Mod Appl Sci 12(8):142","journal-title":"Mod Appl Sci"},{"issue":"5","key":"10340_CR58","doi-asserted-by":"crossref","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 (2007) Particle swarm optimization-based algorithms for TSP and generalized TSP. Inf Process Lett 103(5):169\u2013176","journal-title":"Inf Process Lett"},{"issue":"3","key":"10340_CR59","first-page":"351","volume":"22","author":"G Sierksma","year":"1994","unstructured":"Sierksma G (1994) Hamiltonicity and the 3-opt procedure for the traveling salesman problem. Appl Math 22(3):351\u2013358","journal-title":"Appl Math"},{"key":"10340_CR60","doi-asserted-by":"crossref","unstructured":"Sopto DS, Ayon SI, Akhand M, Siddique N (2018) Modified grey wolf optimization to solve traveling salesman problem. In: 2018 International conference on innovation in engineering and technology (ICIET). IEEE, pp\u00a01\u20134","DOI":"10.1109\/CIET.2018.8660872"},{"issue":"10","key":"10340_CR61","doi-asserted-by":"crossref","first-page":"2519","DOI":"10.1016\/j.cor.2013.01.013","volume":"40","author":"A Subramanian","year":"2013","unstructured":"Subramanian A, Uchoa E, Ochi LS (2013) A hybrid algorithm for a class of vehicle routing problems. Comput Oper Res 40(10):2519\u20132531","journal-title":"Comput Oper Res"},{"key":"10340_CR62","doi-asserted-by":"crossref","unstructured":"Tian J, Shen L, Zheng Y (2006) Genetic algorithm based approach for multi-UAV cooperative reconnaissance mission planning problem. In: International symposium on methodologies for intelligent systems. Springer, pp\u00a0101\u2013110","DOI":"10.1007\/11875604_13"},{"key":"10340_CR63","doi-asserted-by":"crossref","DOI":"10.1137\/1.9780898718515","volume-title":"The vehicle routing problem","author":"P Toth","year":"2002","unstructured":"Toth P, Vigo D (2002) The vehicle routing problem. SIAM, Philadelphia"},{"issue":"3","key":"10340_CR64","first-page":"219","volume":"14","author":"A U\u011fur","year":"2009","unstructured":"U\u011fur A, Koruko\u011flu S, \u00c7al\u0131skan A, Cinsdikici M, Alp A (2009) Genetic algorithm based solution for TSP on a sphere. Math Comput Appl 14(3):219\u2013228","journal-title":"Math Comput Appl"},{"issue":"2","key":"10340_CR65","first-page":"202","volume":"41","author":"U Valeriu","year":"2006","unstructured":"Valeriu U (2006) Traveling salesman problem with transportation. Comput Sci J Moldova 41(2):202\u2013206","journal-title":"Comput Sci J Moldova"},{"key":"10340_CR66","unstructured":"Wang K-P, Huang L, Zhou C-G, Pang W (2003) Particle swarm optimization for traveling salesman problem. In: Proceedings of the 2003 international conference on machine learning and cybernetics (IEEE cat. no. 03ex693), vol 3. IEEE, pp 1583\u20131585"},{"issue":"7","key":"10340_CR67","doi-asserted-by":"crossref","first-page":"1427","DOI":"10.1080\/00207540410001733896","volume":"43","author":"J Won","year":"2005","unstructured":"Won J, Olafsson S (2005) Joint order batching and order picking in warehouse operations. Int J Prod Res 43(7):1427\u20131442","journal-title":"Int J Prod Res"},{"key":"10340_CR68","doi-asserted-by":"crossref","unstructured":"Wu L, You X, Liu S (2023) Multi-ant colony optimization based on bidirectional induction mechanism and cooperative game. Soft Comput 27(20):15075\u201315093","DOI":"10.1007\/s00500-023-08689-6"},{"key":"10340_CR69","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1155\/2021\/6668345","volume":"2021","author":"M Yousefikhoshbakht","year":"2021","unstructured":"Yousefikhoshbakht M (2021) Solving the traveling salesman problem: a modified metaheuristic algorithm. Complexity 2021:1\u201313","journal-title":"Complexity"},{"key":"10340_CR70","first-page":"372","volume":"24","author":"M Zbigniew","year":"1996","unstructured":"Zbigniew M (1996) Genetic algorithms + data structures = evolution programs. Comput Stat 24:372\u2013373","journal-title":"Comput Stat"}],"container-title":["Soft Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-024-10340-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00500-024-10340-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-024-10340-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,12,23]],"date-time":"2024-12-23T13:18:19Z","timestamp":1734959899000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00500-024-10340-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,12]]},"references-count":70,"journal-issue":{"issue":"23-24","published-print":{"date-parts":[[2024,12]]}},"alternative-id":["10340"],"URL":"https:\/\/doi.org\/10.1007\/s00500-024-10340-x","relation":{},"ISSN":["1432-7643","1433-7479"],"issn-type":[{"value":"1432-7643","type":"print"},{"value":"1433-7479","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,12]]},"assertion":[{"value":"15 June 2024","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"9 December 2024","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare that they have no conflict of interest.","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"}},{"value":"Not applicable.","order":4,"name":"Ethics","group":{"name":"EthicsHeading","label":"Informed consent"}}]}}