{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,11,6]],"date-time":"2026-11-06T14:47:34Z","timestamp":1793976454326,"version":"4.8.0"},"reference-count":38,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2026,3,17]],"date-time":"2026-03-17T00:00:00Z","timestamp":1773705600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0"},{"start":{"date-parts":[[2026,4,30]],"date-time":"2026-04-30T00:00:00Z","timestamp":1777507200000},"content-version":"vor","delay-in-days":44,"URL":"https:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0"}],"funder":[{"name":"Committee of Science of the Ministry of Science and Higher Education of the Republic of Kazakhstan","award":["No.BR24992852"],"award-info":[{"award-number":["No.BR24992852"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Sci Rep"],"DOI":"10.1038\/s41598-026-43898-7","type":"journal-article","created":{"date-parts":[[2026,3,17]],"date-time":"2026-03-17T09:48:36Z","timestamp":1773740916000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["A comparative analysis of crossovers in genetic algorithms for route optimization: case studies from Astana and Shymkent, Kazakhstan"],"prefix":"10.1038","volume":"16","author":[{"given":"Rakhymzhan","family":"Kazbek","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Muslim","family":"Sergaziyev","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Damir","family":"Kenzhe","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Azamat","family":"Raissov","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Didar","family":"Yedilkhan","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2026,3,17]]},"reference":[{"key":"43898_CR1","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, J. H. Adaptation in natural and artificial systems: an introductory analysis with applications to biology, control, and artificial intelligence (MIT press, 1992)."},{"key":"43898_CR2","unstructured":"Goldberg, D.\u00a0E. Genetic Algorithms in Search, Optimization, and Machine Learning (Addison-Wesley, 1989)."},{"key":"43898_CR3","doi-asserted-by":"crossref","unstructured":"Toogood, R., Hao, H. & Wong, C. Robot path planning using genetic algorithms. In 1995 IEEE International Conference on Systems, Man and Cybernetics. Intelligent Systems for the 21st Century, vol.\u00a01, 489\u2013494 (IEEE, 1995).","DOI":"10.1109\/ICSMC.1995.537808"},{"key":"43898_CR4","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1002\/atr.5670360103","volume":"36","author":"P Shrivastava","year":"2002","unstructured":"Shrivastava, P., Dhingra, S. & Gundaliya, P. Application of genetic algorithm for scheduling and schedule coordination problems. J. Adv. Transp. 36, 23\u201341 (2002).","journal-title":"J. Adv. Transp."},{"key":"43898_CR5","doi-asserted-by":"crossref","unstructured":"Holst, T. & Pulliam, T. Aerodynamic shape optimization using a real-number-encoded genetic algorithm. In 19th AIAA Applied Aerodynamics Conference, 2001\u20132473 (2001).","DOI":"10.2514\/6.2001-2473"},{"key":"43898_CR6","doi-asserted-by":"crossref","unstructured":"Fang, H.-L., Corne, D. & Ross, P. A genetic algorithm for job-shop problems with various schedule quality criteria. In AISB Workshop on Evolutionary Computing, 39\u201349 (Springer, 1996).","DOI":"10.1007\/BFb0032771"},{"key":"43898_CR7","doi-asserted-by":"publisher","first-page":"887","DOI":"10.1016\/j.pnsc.2008.01.030","volume":"18","author":"J Yang","year":"2008","unstructured":"Yang, J., Wu, C., Lee, H. P. & Liang, Y. Solving traveling salesman problems using generalized chromosome genetic algorithm. Prog. Nat. Sci. 18, 887\u2013892 (2008).","journal-title":"Prog. Nat. Sci."},{"key":"43898_CR8","doi-asserted-by":"publisher","first-page":"497","DOI":"10.1134\/S105466181603007X","volume":"26","author":"P Jedlicka","year":"2016","unstructured":"Jedlicka, P. & Ryba, T. Genetic algorithm application in image segmentation. Pattern Recognit. Image Anal. 26, 497\u2013501 (2016).","journal-title":"Pattern Recognit. Image Anal."},{"key":"43898_CR9","doi-asserted-by":"publisher","first-page":"347","DOI":"10.1016\/0167-8191(90)90086-O","volume":"14","author":"D Whitley","year":"1990","unstructured":"Whitley, D., Starkweather, T. & Bogart, C. Genetic algorithms and neural networks: Optimizing connections and connectivity. Parallel Comput. 14, 347\u2013361 (1990).","journal-title":"Parallel Comput."},{"key":"43898_CR10","unstructured":"Chen, S.-H. Genetic algorithms and genetic programming in computational finance (Springer Science & Business Media, 2012)."},{"key":"43898_CR11","doi-asserted-by":"publisher","first-page":"162","DOI":"10.1109\/TPWRD.2012.2219598","volume":"28","author":"A Arabali","year":"2012","unstructured":"Arabali, A., Ghofrani, M., Etezadi-Amoli, M., Fadali, M. S. & Baghzouz, Y. Genetic-algorithm-based optimization approach for energy management. IEEE Trans. Power Deliv. 28, 162\u2013170 (2012).","journal-title":"IEEE Trans. Power Deliv."},{"key":"43898_CR12","doi-asserted-by":"publisher","first-page":"268","DOI":"10.1145\/937503.937505","volume":"35","author":"C Blum","year":"2003","unstructured":"Blum, C. & Roli, A. Metaheuristics in combinatorial optimization: Overview and conceptual comparison. ACM computing surveys (CSUR) 35, 268\u2013308 (2003).","journal-title":"ACM computing surveys (CSUR)"},{"key":"43898_CR13","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-349-03521-2","volume-title":"Graph Theory with Applications","author":"JA Bondy","year":"1976","unstructured":"Bondy, J. A. & Murty, U. S. R. Graph Theory with Applications (Macmillan, 1976)."},{"key":"43898_CR14","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1016\/0304-3975(77)90012-3","volume":"4","author":"CH Papadimitriou","year":"1977","unstructured":"Papadimitriou, C. H. The Euclidean travelling salesman problem is np-complete. Theor. Comput. Sci. 4, 237\u2013244 (1977).","journal-title":"Theor. Comput. Sci."},{"key":"43898_CR15","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"MR Garey","year":"1979","unstructured":"Garey, M. R. & Johnson, D. S. Computers and Intractability: A Guide to the Theory of NP-Completeness (W. H. Freeman, 1979)."},{"key":"43898_CR16","doi-asserted-by":"publisher","DOI":"10.1515\/9781400839599","volume-title":"In Pursuit of the Traveling Salesman: Mathematics at the Limits of Computation","author":"WJ Cook","year":"2015","unstructured":"Cook, W. J. In Pursuit of the Traveling Salesman: Mathematics at the Limits of Computation (Princeton University Press, 2015)."},{"key":"43898_CR17","doi-asserted-by":"crossref","unstructured":"Traub, V., Vygen, J. & Zenklusen, R. Reducing path tsp to tsp. In Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing, 14\u201327 (2020).","DOI":"10.1145\/3357713.3384256"},{"key":"43898_CR18","doi-asserted-by":"publisher","first-page":"8404231","DOI":"10.1155\/2017\/8404231","volume":"2017","author":"B Crawford","year":"2017","unstructured":"Crawford, B. et al. Putting continuous metaheuristics to work in binary search spaces. Complexity 2017, 1\u201319. https:\/\/doi.org\/10.1155\/2017\/8404231 (2017).","journal-title":"Complexity"},{"key":"43898_CR19","doi-asserted-by":"publisher","DOI":"10.1038\/s41598-025-86695-4","volume":"15","author":"A Bolotbekova","year":"2025","unstructured":"Bolotbekova, A., Hakli, H. & Beskirli, A. Trip route optimization based on bus transit using genetic algorithm with different crossover techniques: A case study in Konya\/T\u00fcrkiye. Sci. Rep. 15, 2491 (2025).","journal-title":"Sci. Rep."},{"key":"43898_CR20","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1016\/j.swevo.2011.02.001","volume":"1","author":"AE Eiben","year":"2011","unstructured":"Eiben, A. E. & Smit, S. K. Parameter tuning for configuring and analyzing evolutionary algorithms. Swarm Evol. Comput. 1, 19\u201331 (2011).","journal-title":"Swarm Evol. Comput."},{"key":"43898_CR21","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3009966","volume":"49","author":"G Pavai","year":"2016","unstructured":"Pavai, G. & Geetha, T. A survey on crossover operators. ACM Computing Surveys (CSUR) 49, 1\u201343 (2016).","journal-title":"ACM Computing Surveys (CSUR)"},{"key":"43898_CR22","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1162\/EVCO_a_00137","volume":"23","author":"KL Mills","year":"2015","unstructured":"Mills, K. L., Filliben, J. J. & Haines, A. Determining relative importance and effective settings for genetic algorithm control parameters. Evol. Comput. 23, 309\u2013342 (2015).","journal-title":"Evol. Comput."},{"key":"43898_CR23","doi-asserted-by":"publisher","first-page":"390","DOI":"10.3390\/info10120390","volume":"10","author":"A Hassanat","year":"2019","unstructured":"Hassanat, A. et al. Choosing mutation and crossover ratios for genetic algorithms-a review with a new dynamic approach. Information 10, 390 (2019).","journal-title":"Information"},{"key":"43898_CR24","doi-asserted-by":"publisher","DOI":"10.1063\/5.0244484","author":"C Liu","year":"2025","unstructured":"Liu, C. et al. Out of randomness: How evolution benefits from modularity. AIP Adv. https:\/\/doi.org\/10.1063\/5.0244484 (2025).","journal-title":"AIP Adv."},{"key":"43898_CR25","doi-asserted-by":"publisher","first-page":"751","DOI":"10.35378\/gujs.1582521","volume":"38","author":"\u015eB Dalk\u0131l\u0131\u00e7","year":"2025","unstructured":"Dalk\u0131l\u0131\u00e7, \u015eB., \u00d6zg\u00fcr, A. & Erdem, H. Comparison of genetic crossover operators for traveling salesman problem. Gazi Univ. J. Sci. 38, 751\u2013778 (2025).","journal-title":"Gazi Univ. J. Sci."},{"key":"43898_CR26","first-page":"359","volume":"18","author":"K Pulji\u0107","year":"2013","unstructured":"Pulji\u0107, K. & Manger, R. Comparison of eight evolutionary crossover operators for the vehicle routing problem. Math. Commun. 18, 359\u2013375 (2013).","journal-title":"Math. Commun."},{"key":"43898_CR27","doi-asserted-by":"crossref","unstructured":"Bye, R.\u00a0T., Gribbestad, M., Chandra, R. & Osen, O.\u00a0L. A comparison of ga crossover and mutation methods for the traveling salesman problem. In Innovations in Computational Intelligence and Computer Vision: Proceedings of ICICV 2020, 529\u2013542 (Springer, 2020).","DOI":"10.1007\/978-981-15-6067-5_60"},{"key":"43898_CR28","first-page":"129","volume":"30","author":"P Curkovic","year":"2025","unstructured":"Curkovic, P. Optimization for sustainability: A comparative analysis of evolutionary crossover operators for the traveling salesman problem (TSP) with a case study on Croatia. Math. Comput. Appl. 30, 129 (2025).","journal-title":"Math. Comput. Appl."},{"key":"43898_CR29","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1371\/journal.pone.0137724","volume":"10","author":"C Contreras-Bolton","year":"2015","unstructured":"Contreras-Bolton, C. & Parada, V. Automatic combination of operators in a genetic algorithm to solve the traveling salesman problem. PLoS One 10, 1\u201325 (2015).","journal-title":"PLoS One"},{"key":"43898_CR30","unstructured":"Innoforce. Innovative products and it solutions \u2013 innoforce. https:\/\/innoforce.kz\/. Accessed: 11\/01\/2025."},{"key":"43898_CR31","unstructured":"Goldberg, D.\u00a0E. & Lingle, R. Alleles, loci, and the traveling salesman problem. In Proceedings of the first international conference on genetic algorithms and their applications, 154\u2013159 (Psychology Press, 2014)."},{"key":"43898_CR32","unstructured":"Oliver, I., Smith, D. & Holland, J.\u00a0R. 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, 224\u2013230 (1987)."},{"key":"43898_CR33","first-page":"162","volume":"85","author":"L Davis","year":"1985","unstructured":"Davis, L. Applying adaptive algorithms to epistatic domains. In IJCAI 85, 162\u2013164 (1985).","journal-title":"In IJCAI"},{"key":"43898_CR34","unstructured":"Syswerda, G. Schedule optimization using genetic algorithms. Handbook of genetic algorithms (1991)."},{"key":"43898_CR35","unstructured":"Rajasekaran, S. & Pai, G.\u00a0V. Neural networks, fuzzy logic and genetic algorithm: synthesis and applications (with cd) (PHI Learning Pvt. Ltd., 2003)."},{"key":"43898_CR36","unstructured":"Whitley, L.\u00a0D., Starkweather, T. & Fuquay, D. Scheduling problems and traveling salesmen: The genetic edge recombination operator. In Proceedings of the 3rd international conference on genetic algorithms, 133\u2013140 (1989)."},{"key":"43898_CR37","doi-asserted-by":"publisher","first-page":"6487","DOI":"10.29020\/nybg.ejpam.v18i3.6487","volume":"18","author":"K Danach","year":"2025","unstructured":"Danach, K., Aly, W. H. F. & Haddad, S. Mathematical modeling and genetic algorithm-based hyperheuristic optimization for quality of service and load balancing in cloud communication networks. Eur. J. Pure Appl. Math. 18, 6487\u20136487 (2025).","journal-title":"Eur. J. Pure Appl. Math."},{"key":"43898_CR38","first-page":"580","volume":"16","author":"K Danach","year":"2024","unstructured":"Danach, K. Reinforcement learning for dynamic vehicle routing problem: A case study with real-world scenarios. Int. J. Commun. Netw. Inf. Secur. 16, 580\u2013589 (2024).","journal-title":"Int. J. Commun. Netw. Inf. Secur."}],"container-title":["Scientific Reports"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.nature.com\/articles\/s41598-026-43898-7","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.nature.com\/articles\/s41598-026-43898-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.nature.com\/articles\/s41598-026-43898-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,29]],"date-time":"2026-04-29T22:56:33Z","timestamp":1777503393000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.nature.com\/articles\/s41598-026-43898-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,3,17]]},"references-count":38,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2026,12]]}},"alternative-id":["43898"],"URL":"https:\/\/doi.org\/10.1038\/s41598-026-43898-7","relation":{},"ISSN":["2045-2322"],"issn-type":[{"value":"2045-2322","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,3,17]]},"assertion":[{"value":"7 November 2025","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"9 March 2026","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"17 March 2026","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 no competing interests.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing interests"}},{"value":"Not applicable.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethical approval"}}],"article-number":"13816"}}