{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,3]],"date-time":"2026-07-03T06:42:36Z","timestamp":1783060956985,"version":"3.54.6"},"reference-count":68,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2025,10,1]],"date-time":"2025-10-01T00:00:00Z","timestamp":1759276800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2025,10,1]],"date-time":"2025-10-01T00:00:00Z","timestamp":1759276800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2025,10,1]],"date-time":"2025-10-01T00:00:00Z","timestamp":1759276800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2025,10,1]],"date-time":"2025-10-01T00:00:00Z","timestamp":1759276800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2025,10,1]],"date-time":"2025-10-01T00:00:00Z","timestamp":1759276800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2025,10,1]],"date-time":"2025-10-01T00:00:00Z","timestamp":1759276800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2025,10,1]],"date-time":"2025-10-01T00:00:00Z","timestamp":1759276800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Swarm and Evolutionary Computation"],"published-print":{"date-parts":[[2025,10]]},"DOI":"10.1016\/j.swevo.2025.102094","type":"journal-article","created":{"date-parts":[[2025,8,7]],"date-time":"2025-08-07T08:51:38Z","timestamp":1754556698000},"page":"102094","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":5,"special_numbering":"C","title":["Deep crossover schemes for genetic algorithms: Investigations on the travel salesman problem"],"prefix":"10.1016","volume":"98","author":[{"ORCID":"https:\/\/orcid.org\/0009-0009-4162-5633","authenticated-orcid":false,"given":"Hana","family":"Derouiche","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7220-9474","authenticated-orcid":false,"given":"Maha","family":"Elarbi","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1378-7415","authenticated-orcid":false,"given":"Slim","family":"Bechikh","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"issue":"4","key":"10.1016\/j.swevo.2025.102094_b1","first-page":"1765","article-title":"A survey of genetic programming and its applications","volume":"13","author":"Ahvanooey","year":"2019","journal-title":"KSII Trans. Internet Inf. Syst. (TIIS)"},{"key":"10.1016\/j.swevo.2025.102094_b2","doi-asserted-by":"crossref","unstructured":"K. De Jong, Evolutionary computation: A unified approach, in: Proceedings of the Genetic and Evolutionary Computation Conference Companion, 2017, pp. 373\u2013388.","DOI":"10.1145\/3067695.3067715"},{"issue":"7553","key":"10.1016\/j.swevo.2025.102094_b3","doi-asserted-by":"crossref","first-page":"476","DOI":"10.1038\/nature14544","article-title":"From evolutionary computation to the evolution of things","volume":"521","author":"Eiben","year":"2015","journal-title":"Nature"},{"key":"10.1016\/j.swevo.2025.102094_b4","doi-asserted-by":"crossref","first-page":"285","DOI":"10.1007\/s10710-010-9110-5","article-title":"Theoretical results in genetic programming: The next ten years?","volume":"11","author":"Poli","year":"2010","journal-title":"Genet. Program. Evolvable Mach."},{"key":"10.1016\/j.swevo.2025.102094_b5","series-title":"Proceedings of the World Congress on Engineering","first-page":"1","article-title":"Genetic algorithm performance with different selection strategies in solving TSP","volume":"vol. 2","author":"Razali","year":"2011"},{"issue":"7553","key":"10.1016\/j.swevo.2025.102094_b6","doi-asserted-by":"crossref","first-page":"436","DOI":"10.1038\/nature14539","article-title":"Deep learning","volume":"521","author":"LeCun","year":"2015","journal-title":"Nature"},{"key":"10.1016\/j.swevo.2025.102094_b7","doi-asserted-by":"crossref","first-page":"41180","DOI":"10.1109\/ACCESS.2024.3376441","article-title":"A comprehensive survey of convolutions in deep learning: Applications, challenges, and future trends","volume":"12","author":"Younesi","year":"2024","journal-title":"IEEE Access"},{"key":"10.1016\/j.swevo.2025.102094_b8","doi-asserted-by":"crossref","DOI":"10.1016\/j.swevo.2021.100864","article-title":"A memetic algorithm based on two_Arch2 for multi-depot heterogeneous-vehicle capacitated arc routing problem","volume":"63","author":"Cao","year":"2021","journal-title":"Swarm Evol. Comput."},{"key":"10.1016\/j.swevo.2025.102094_b9","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1007\/s12293-015-0166-x","article-title":"Memes as building blocks: a case study on evolutionary optimization+ transfer learning for routing problems","volume":"7","author":"Feng","year":"2015","journal-title":"Mem. Comput."},{"key":"10.1016\/j.swevo.2025.102094_b10","doi-asserted-by":"crossref","DOI":"10.1016\/j.cma.2024.117588","article-title":"Integrating differential evolution into gazelle optimization for advanced global optimization and engineering applications","volume":"434","author":"Biswas","year":"2025","journal-title":"Comput. Methods Appl. Mech. Engrg."},{"issue":"3","key":"10.1016\/j.swevo.2025.102094_b11","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1007\/s10462-024-11069-7","article-title":"Enhanced crayfish optimization algorithm with differential evolution\u2019s mutation and crossover strategies for global optimization and engineering applications","volume":"58","author":"Maiti","year":"2025","journal-title":"Artif. Intell. Rev."},{"key":"10.1016\/j.swevo.2025.102094_b12","doi-asserted-by":"crossref","DOI":"10.1016\/j.cam.2024.116475","article-title":"Hybridizing remora and aquila optimizer with dynamic oppositional learning for structural engineering design problems","volume":"462","author":"Varshney","year":"2025","journal-title":"J. Comput. Appl. Math."},{"key":"10.1016\/j.swevo.2025.102094_b13","doi-asserted-by":"crossref","DOI":"10.1016\/j.rineng.2024.103670","article-title":"Leader selection based multi-objective flow direction algorithm (MOFDA): A novel approach for engineering design problems","volume":"25","author":"Khodadadi","year":"2025","journal-title":"Results Eng."},{"key":"10.1016\/j.swevo.2025.102094_b14","doi-asserted-by":"crossref","unstructured":"R. Tin\u00f3s, M. Przewozniczek, D. Whitley, F. Chicano, Genetic algorithm with linkage learning, in: Proceedings of the Genetic and Evolutionary Computation Conference, 2023, pp. 981\u2013989.","DOI":"10.1145\/3583131.3590349"},{"issue":"3","key":"10.1016\/j.swevo.2025.102094_b15","doi-asserted-by":"crossref","first-page":"202","DOI":"10.1504\/IJCAT.2017.084774","article-title":"On enhancing genetic algorithms using new crossovers","volume":"55","author":"Hassanat","year":"2017","journal-title":"Int. J. Comput. Appl. Technol."},{"key":"10.1016\/j.swevo.2025.102094_b16","doi-asserted-by":"crossref","unstructured":"A. LaTorre, J.M. Pe\u00f1a, V. Robles, S. Muelas, Using multiple offspring sampling to guide genetic algorithms to solve permutation problems, in: Proceedings of the 10th Annual Conference on Genetic and Evolutionary Computation, 2008, pp. 1119\u20131120.","DOI":"10.1145\/1389095.1389307"},{"key":"10.1016\/j.swevo.2025.102094_b17","unstructured":"A. Newell, J.C. Shaw, H.A. Simon, Report on a general problem solving program, in: IFIP Congress, vol. 256, Pittsburgh, PA, 1959, p. 64."},{"issue":"3","key":"10.1016\/j.swevo.2025.102094_b18","doi-asserted-by":"crossref","first-page":"819","DOI":"10.1016\/j.ejor.2023.07.022","article-title":"A comprehensive survey on the generalized traveling salesman problem","volume":"314","author":"Pop","year":"2024","journal-title":"European J. Oper. Res."},{"key":"10.1016\/j.swevo.2025.102094_b19","series-title":"A comparative study of adaptive crossover operators for genetic algorithms to resolve the traveling salesman problem","author":"Abdoun","year":"2012"},{"key":"10.1016\/j.swevo.2025.102094_b20","series-title":"International Data Science Conference","first-page":"21","article-title":"CSRX: A novel crossover operator for a genetic algorithm applied to the traveling salesperson problem","author":"Uray","year":"2023"},{"key":"10.1016\/j.swevo.2025.102094_b21","series-title":"Proceedings of the First International Conference on Genetic Algorithms and their Applications","first-page":"154","article-title":"Alleles, loci, and the traveling salesman problem","author":"Goldberg","year":"2014"},{"key":"10.1016\/j.swevo.2025.102094_b22","series-title":"Proceedings of the First International Conference on Genetic Algorithms and their Applications","first-page":"136","article-title":"Job shop scheduling with genetic algorithms","author":"Davis","year":"2014"},{"key":"10.1016\/j.swevo.2025.102094_b23","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1016\/j.cie.2019.05.012","article-title":"A novel multi-parent order crossover in genetic algorithm for combinatorial optimization problems","volume":"133","author":"Arram","year":"2019","journal-title":"Comput. Ind. Eng."},{"issue":"6","key":"10.1016\/j.swevo.2025.102094_b24","doi-asserted-by":"crossref","DOI":"10.1002\/cmm4.1122","article-title":"A novel completely mapped crossover operator for genetic algorithm to facilitate the traveling salesman problem","volume":"2","author":"Iqbal","year":"2020","journal-title":"Comput. Math. Methods"},{"issue":"3","key":"10.1016\/j.swevo.2025.102094_b25","doi-asserted-by":"crossref","first-page":"1879","DOI":"10.1016\/j.eswa.2009.07.082","article-title":"Multi-parent extension of partially mapped crossover for combinatorial optimization problems","volume":"37","author":"Ting","year":"2010","journal-title":"Expert Syst. Appl."},{"key":"10.1016\/j.swevo.2025.102094_b26","unstructured":"I. Oliver, D. Smith, J.R. Holland, A study of permutation crossover operators on the traveling salesman problem, in: Proceedings of the Second International Conference on Genetic Algorithms on Genetic Algorithms and their Application, 1987, pp. 224\u2013230."},{"key":"10.1016\/j.swevo.2025.102094_b27","series-title":"International Conference on Parallel Problem Solving from Nature","first-page":"78","article-title":"Genetic algorithms with multi-parent recombination","author":"Eiben","year":"1994"},{"issue":"1","key":"10.1016\/j.swevo.2025.102094_b28","article-title":"Genetic algorithm for traveling salesman problem with modified cycle crossover operator","volume":"2017","author":"Hussain","year":"2017","journal-title":"Comput. Intell. Neurosci."},{"issue":"3","key":"10.1016\/j.swevo.2025.102094_b29","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1080\/10798587.2000.10642829","article-title":"Genetic algorithm solution of the TSP avoiding special crossover and mutation","volume":"8","author":"\u00dc\u00e7oluk","year":"2002","journal-title":"Intell. Autom. Soft Comput."},{"issue":"15","key":"10.1016\/j.swevo.2025.102094_b30","doi-asserted-by":"crossref","DOI":"10.4236\/jcc.2016.415009","article-title":"Solving travelling salesman problem with an improved hybrid genetic algorithm","volume":"4","author":"Lin","year":"2016","journal-title":"J. Comput. Commun."},{"key":"10.1016\/j.swevo.2025.102094_b31","doi-asserted-by":"crossref","first-page":"937","DOI":"10.1016\/j.procs.2018.04.230","article-title":"Application of a genetic algorithm with random crossover and dynamic mutation on the travelling salesman problem","volume":"131","author":"Xu","year":"2018","journal-title":"Procedia Comput. Sci."},{"key":"10.1016\/j.swevo.2025.102094_b32","series-title":"Proceedings of the First International Conference on Genetic Algorithms and their Applications","first-page":"160","article-title":"Genetic algorithms for the traveling salesman problem","author":"Grefenstette","year":"2014"},{"issue":"6","key":"10.1016\/j.swevo.2025.102094_b33","first-page":"96","article-title":"Genetic algorithm for the traveling salesman problem using sequential constructive crossover operator","volume":"3","author":"Ahmed","year":"2010","journal-title":"Int. J. Biom. Bioinform. (IJBB)"},{"key":"10.1016\/j.swevo.2025.102094_b34","series-title":"2015 5th International Conference on IT Convergence and Security","first-page":"1","article-title":"Bidirectional constructive crossover for evolutionary approach to travelling salesman problem","author":"Kang","year":"2015"},{"key":"10.1016\/j.swevo.2025.102094_b35","series-title":"2009 Fifth International Conference on Natural Computation","first-page":"92","article-title":"A new best-worst ant system with heuristic crossover operator for solving TSP","volume":"vol. 4","author":"Li","year":"2009"},{"key":"10.1016\/j.swevo.2025.102094_b36","series-title":"Introduction to Operations Research","author":"Hillier","year":"2015"},{"key":"10.1016\/j.swevo.2025.102094_b37","series-title":"Foundations of Genetic Algorithms","first-page":"69","article-title":"A comparative analysis of selection schemes used in genetic algorithms","volume":"vol. 1","author":"Goldberg","year":"1991"},{"key":"10.1016\/j.swevo.2025.102094_b38","doi-asserted-by":"crossref","DOI":"10.1016\/j.asoc.2022.109339","article-title":"A genetic algorithm with jumping gene and heuristic operators for traveling salesman problem","volume":"127","author":"Zhang","year":"2022","journal-title":"Appl. Soft Comput."},{"key":"10.1016\/j.swevo.2025.102094_b39","doi-asserted-by":"crossref","DOI":"10.1016\/j.asoc.2021.107439","article-title":"Ant colony optimization for traveling salesman problem based on parameters optimization","volume":"107","author":"Wang","year":"2021","journal-title":"Appl. Soft Comput."},{"issue":"4","key":"10.1016\/j.swevo.2025.102094_b40","doi-asserted-by":"crossref","first-page":"376","DOI":"10.1287\/ijoc.3.4.376","article-title":"TSPLIB\u2014A traveling salesman problem library","volume":"3","author":"Reinelt","year":"1991","journal-title":"ORSA J. Comput."},{"issue":"14","key":"10.1016\/j.swevo.2025.102094_b41","doi-asserted-by":"crossref","first-page":"3221","DOI":"10.3390\/math11143221","article-title":"A discrete JAYA algorithm based on reinforcement learning and simulated annealing for the traveling salesman problem","volume":"11","author":"Xu","year":"2023","journal-title":"Mathematics"},{"issue":"1","key":"10.1016\/j.swevo.2025.102094_b42","doi-asserted-by":"crossref","first-page":"44","DOI":"10.3390\/a16010044","article-title":"Evolutionary algorithm with geometrical heuristics for solving the close enough traveling salesman problem: Application to the trajectory planning of an unmanned aerial vehicle","volume":"16","author":"Cariou","year":"2023","journal-title":"Algorithms"},{"key":"10.1016\/j.swevo.2025.102094_b43","series-title":"Taguchi techniques for quality engineering: loss function, orthogonal experiments, parameter and tolerance design","author":"Ross","year":"1988"},{"key":"10.1016\/j.swevo.2025.102094_b44","doi-asserted-by":"crossref","DOI":"10.1016\/j.asoc.2024.111266","article-title":"An effective memetic algorithm for the close-enough traveling salesman problem","volume":"153","author":"Lei","year":"2024","journal-title":"Appl. Soft Comput."},{"key":"10.1016\/j.swevo.2025.102094_b45","doi-asserted-by":"crossref","DOI":"10.1016\/j.swevo.2020.100665","article-title":"Recent trends in the use of statistical tests for comparing swarm and evolutionary computing algorithms: Practical guidelines and a critical review","volume":"54","author":"Carrasco","year":"2020","journal-title":"Swarm Evol. Comput."},{"key":"10.1016\/j.swevo.2025.102094_b46","series-title":"Handbook of Parametric and Nonparametric Statistical Procedures","author":"Sheskin","year":"2003"},{"issue":"1","key":"10.1016\/j.swevo.2025.102094_b47","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1016\/j.swevo.2011.02.002","article-title":"A practical tutorial on the use of nonparametric statistical tests as a methodology for comparing evolutionary and swarm intelligence algorithms","volume":"1","author":"Derrac","year":"2011","journal-title":"Swarm Evol. Comput."},{"key":"10.1016\/j.swevo.2025.102094_b48","series-title":"Genetic Algorithms in Search, Optimization, and Machine Learning","author":"Goldberg","year":"1989"},{"issue":"2","key":"10.1016\/j.swevo.2025.102094_b49","doi-asserted-by":"crossref","first-page":"879","DOI":"10.1093\/genetics\/147.2.879","article-title":"The evolution of recombination: Removing the limits to natural selection","volume":"147","author":"Otto","year":"1997","journal-title":"Genetics"},{"key":"10.1016\/j.swevo.2025.102094_b50","series-title":"The Simple Genetic Algorithm: Foundations and Theory","author":"Vose","year":"1999"},{"key":"10.1016\/j.swevo.2025.102094_b51","series-title":"Introduction to Evolutionary Computing","author":"Eiben","year":"2015"},{"issue":"2","key":"10.1016\/j.swevo.2025.102094_b52","first-page":"115","article-title":"Simulated binary crossover for continuous search space","volume":"9","author":"Deb","year":"1995","journal-title":"Complex Systems"},{"key":"10.1016\/j.swevo.2025.102094_b53","doi-asserted-by":"crossref","first-page":"137902","DOI":"10.1109\/ACCESS.2021.3117987","article-title":"Ring-based crossovers in genetic algorithms: Characteristic decomposition and their generalization","volume":"9","author":"Rimcharoen","year":"2021","journal-title":"IEEE Access"},{"issue":"3","key":"10.1016\/j.swevo.2025.102094_b54","doi-asserted-by":"crossref","first-page":"345","DOI":"10.1016\/0377-2217(92)90192-C","article-title":"The vehicle routing problem: An overview of exact and approximate algorithms","volume":"59","author":"Laporte","year":"1992","journal-title":"European J. Oper. Res."},{"key":"10.1016\/j.swevo.2025.102094_b55","series-title":"Vehicle routing problem resources","author":"Dorronsoro","year":"2025"},{"key":"10.1016\/j.swevo.2025.102094_b56","article-title":"The vehicle routing problem","author":"Christofides","year":"1979","journal-title":"Comb. Optim."},{"key":"10.1016\/j.swevo.2025.102094_b57","series-title":"Fleet Management and Logistics","first-page":"33","article-title":"The impact of metaheuristics on solving the vehicle routing problem: algorithms, problem sets, and computational results","author":"Golden","year":"1998"},{"key":"10.1016\/j.swevo.2025.102094_b58","series-title":"Capacitated vehicle routing problem library","author":"CVRPLIB","year":"2025"},{"issue":"1","key":"10.1016\/j.swevo.2025.102094_b59","doi-asserted-by":"crossref","DOI":"10.1155\/2021\/8275714","article-title":"Research on logistics distribution vehicle scheduling based on heuristic genetic algorithm","volume":"2021","author":"Wang","year":"2021","journal-title":"Complexity"},{"issue":"2","key":"10.1016\/j.swevo.2025.102094_b60","doi-asserted-by":"crossref","first-page":"1321","DOI":"10.1007\/s10462-020-09882-x","article-title":"Evolutionary computation for solving search-based data analytics problems","volume":"54","author":"Cheng","year":"2021","journal-title":"Artif. Intell. Rev."},{"key":"10.1016\/j.swevo.2025.102094_b61","doi-asserted-by":"crossref","DOI":"10.1016\/j.apenergy.2022.119844","article-title":"Optimizing pipe network design and central plant positioning of district heating and cooling system: A graph-based multi-objective genetic algorithm approach","volume":"325","author":"Su","year":"2022","journal-title":"Appl. Energy"},{"key":"10.1016\/j.swevo.2025.102094_b62","doi-asserted-by":"crossref","DOI":"10.1016\/j.swevo.2025.101865","article-title":"Neuro-PSO algorithm for large-scale dynamic optimization","volume":"94","author":"Radwan","year":"2025","journal-title":"Swarm Evol. Comput."},{"issue":"1","key":"10.1016\/j.swevo.2025.102094_b63","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1007\/s10462-021-10042-y","article-title":"A survey on evolutionary computation for complex continuous optimization","volume":"55","author":"Zhan","year":"2022","journal-title":"Artif. Intell. Rev."},{"issue":"2","key":"10.1016\/j.swevo.2025.102094_b64","doi-asserted-by":"crossref","first-page":"405","DOI":"10.1016\/j.ejor.2020.07.063","article-title":"Machine learning for combinatorial optimization: A methodological tour d\u2019horizon","volume":"290","author":"Bengio","year":"2021","journal-title":"European J. Oper. Res."},{"key":"10.1016\/j.swevo.2025.102094_b65","doi-asserted-by":"crossref","first-page":"773","DOI":"10.1016\/j.ins.2021.10.025","article-title":"Adaptive operator selection with reinforcement learning","volume":"581","author":"Durgut","year":"2021","journal-title":"Inform. Sci."},{"key":"10.1016\/j.swevo.2025.102094_b66","doi-asserted-by":"crossref","DOI":"10.1016\/j.swevo.2024.101517","article-title":"Reinforcement learning-assisted evolutionary algorithm: A survey and research opportunities","volume":"86","author":"Song","year":"2024","journal-title":"Swarm Evol. Comput."},{"issue":"5","key":"10.1016\/j.swevo.2025.102094_b67","doi-asserted-by":"crossref","first-page":"945","DOI":"10.1109\/TEVC.2009.2014613","article-title":"JADE: Adaptive differential evolution with optional external archive","volume":"13","author":"Zhang","year":"2009","journal-title":"IEEE Trans. Evol. Comput."},{"key":"10.1016\/j.swevo.2025.102094_b68","series-title":"2011 IEEE 23rd International Conference on Tools with Artificial Intelligence","first-page":"215","article-title":"Cooperative co-evolution with weighted random grouping for large-scale crossing waypoints locating in air route network","author":"Mingming","year":"2011"}],"container-title":["Swarm and Evolutionary Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S2210650225002524?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S2210650225002524?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,9,17]],"date-time":"2025-09-17T21:14:27Z","timestamp":1758143667000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S2210650225002524"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,10]]},"references-count":68,"alternative-id":["S2210650225002524"],"URL":"https:\/\/doi.org\/10.1016\/j.swevo.2025.102094","relation":{},"ISSN":["2210-6502"],"issn-type":[{"value":"2210-6502","type":"print"}],"subject":[],"published":{"date-parts":[[2025,10]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Deep crossover schemes for genetic algorithms: Investigations on the travel salesman problem","name":"articletitle","label":"Article Title"},{"value":"Swarm and Evolutionary Computation","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.swevo.2025.102094","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2025 Elsevier B.V. All rights are reserved, including those for text and data mining, AI training, and similar technologies.","name":"copyright","label":"Copyright"}],"article-number":"102094"}}