{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,10]],"date-time":"2026-10-10T15:35:42Z","timestamp":1791646542622,"version":"4.3.4"},"reference-count":86,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2025,1,20]],"date-time":"2025-01-20T00:00:00Z","timestamp":1737331200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0"},{"start":{"date-parts":[[2025,1,20]],"date-time":"2025-01-20T00:00:00Z","timestamp":1737331200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Sci Rep"],"DOI":"10.1038\/s41598-025-86695-4","type":"journal-article","created":{"date-parts":[[2025,1,20]],"date-time":"2025-01-20T01:26:15Z","timestamp":1737336375000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":21,"title":["Trip route optimization based on bus transit using genetic algorithm with different crossover techniques: a case study in Konya\/T\u00fcrkiye"],"prefix":"10.1038","volume":"15","author":[{"given":"Akylai","family":"Bolotbekova","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Huseyin","family":"Hakli","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ayse","family":"Beskirli","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2025,1,20]]},"reference":[{"issue":"4","key":"86695_CR1","doi-asserted-by":"publisher","first-page":"2627","DOI":"10.1007\/s00366-022-01604-x","volume":"39","author":"A Seyyedabbasi","year":"2023","unstructured":"Seyyedabbasi, A. & Kiani, F. Sand cat swarm optimization: a nature-inspired algorithm to solve global optimization problems. Eng. Comput. 39 (4), 2627\u20132651 (2023).","journal-title":"Eng. Comput."},{"key":"86695_CR2","doi-asserted-by":"publisher","first-page":"112220","DOI":"10.1016\/j.asoc.2024.112220","volume":"167","author":"A Be\u015fkirli","year":"2024","unstructured":"Be\u015fkirli, A., Da\u011f, \u0130. & Kiran, M. S. A tree seed algorithm with multi-strategy for parameter estimation of solar photovoltaic models. Appl. Soft Comput. 167, 112220 (2024).","journal-title":"Appl. Soft Comput."},{"key":"86695_CR3","doi-asserted-by":"publisher","first-page":"113698","DOI":"10.1016\/j.eswa.2020.113698","volume":"161","author":"A Shabani","year":"2020","unstructured":"Shabani, A. et al. Search and rescue optimization algorithm: a new optimization method for solving constrained engineering optimization problems. Expert Syst. Appl. 161, 113698 (2020).","journal-title":"Expert Syst. Appl."},{"issue":"2","key":"86695_CR4","first-page":"142","volume":"5","author":"A Co\u015fkun","year":"2007","unstructured":"Co\u015fkun, A. The artificial intelligence optimization tecnicals: a literature review. Res. East. Anatolia Reg. 5 (2), 142\u2013146 (2007).","journal-title":"Res. East. Anatolia Reg."},{"issue":"1","key":"86695_CR5","doi-asserted-by":"publisher","first-page":"2376","DOI":"10.1038\/s41598-023-47729-x","volume":"14","author":"B Khurshid","year":"2024","unstructured":"Khurshid, B. et al. A hybridization of evolution strategies with iterated greedy algorithm for no-wait flow shop scheduling problems. Sci. Rep. 14 (1), 2376 (2024).","journal-title":"Sci. Rep."},{"key":"86695_CR6","doi-asserted-by":"publisher","first-page":"108016","DOI":"10.1016\/j.engappai.2024.108016","volume":"133","author":"B Khurshid","year":"2024","unstructured":"Khurshid, B. & Maqsood, S. A hybrid evolution strategies-simulated annealing algorithm for job shop scheduling problems. Eng. Appl. Artif. Intell. 133, 108016 (2024).","journal-title":"Eng. Appl. Artif. Intell."},{"issue":"5","key":"86695_CR7","doi-asserted-by":"publisher","first-page":"3935","DOI":"10.1007\/s12065-024-00965-0","volume":"17","author":"O Nejjarou","year":"2024","unstructured":"Nejjarou, O., Aqil, S. & Lahby, M. Hybrid meta-heuristic solving no-wait flow shop scheduling minimizing maximum tardiness. Evol. Intel. 17 (5), 3935\u20133959 (2024).","journal-title":"Evol. Intel."},{"issue":"3","key":"86695_CR8","first-page":"1","volume":"80","author":"Q Zhu","year":"2024","unstructured":"Zhu, Q. et al. Q-learning-assisted meta-heuristics for scheduling distributed hybrid flow shop problems. Comput. Mater. Continua 80 (3), 1 (2024).","journal-title":"Comput. Mater. Continua"},{"issue":"2","key":"86695_CR9","first-page":"1","volume":"15","author":"B Khurshid","year":"2020","unstructured":"Khurshid, B. et al. Hybrid evolution strategy approach for robust permutation flowshop scheduling. Adv. Prod. Eng. Manag. 15 (2), 1 (2020).","journal-title":"Adv. Prod. Eng. Manag."},{"issue":"7","key":"86695_CR10","doi-asserted-by":"publisher","first-page":"5283","DOI":"10.1007\/s00521-022-06941-y","volume":"34","author":"SM Taleb","year":"2022","unstructured":"Taleb, S. M. et al. Nodes placement in wireless mesh networks using optimization approaches: a survey. Neural Comput. Appl. 34 (7), 5283\u20135319 (2022).","journal-title":"Neural Comput. Appl."},{"key":"86695_CR11","doi-asserted-by":"crossref","unstructured":"Liu, L. et al. IEEE,. Energy-efficient capacity optimization in wireless networks. In IEEE INFOCOM 2014-IEEE Conference on Computer Communications (2014).","DOI":"10.1109\/INFOCOM.2014.6848072"},{"key":"86695_CR12","first-page":"1086","volume":"48","author":"S Ijaz","year":"2018","unstructured":"Ijaz, S. et al. Vector based genetic algorithm to optimize predictive analysis in network security. Appl. Intell. 48, 1086\u20131096 (2018).","journal-title":"Appl. Intell."},{"key":"86695_CR13","doi-asserted-by":"publisher","first-page":"115351","DOI":"10.1016\/j.eswa.2021.115351","volume":"183","author":"S Gupta","year":"2021","unstructured":"Gupta, S. et al. Comparison of metaheuristic optimization algorithms for solving constrained mechanical design optimization problems. Expert Syst. Appl. 183, 115351 (2021).","journal-title":"Expert Syst. Appl."},{"key":"86695_CR14","unstructured":"G\u00fcl, B. Analysis and Optimization of Production Efficiencies of Automation Systems (Marmara University, 2022)."},{"issue":"2","key":"86695_CR15","first-page":"13","volume":"11","author":"LI Scurtu","year":"2016","unstructured":"Scurtu, L. I., Bodea, S. M. & Jurco, A. N. Design optimization method used in mechanical engineering. J. Ind. Des. Eng. Graph. 11 (2), 13\u201317 (2016).","journal-title":"J. Ind. Des. Eng. Graph."},{"key":"86695_CR16","doi-asserted-by":"crossref","unstructured":"K\u00e1n, P. & Kaufmann, H. Automated interior design using a genetic algorithm. In Proceedings of the 23rd ACM Symposium on Virtual Reality Software and Technology (2017).","DOI":"10.1145\/3139131.3139135"},{"issue":"7","key":"86695_CR17","first-page":"2571","volume":"11","author":"MV Petrovskaya","year":"2016","unstructured":"Petrovskaya, M. V. et al. Scientific methodological basis of the risk management implementation for companies\u2019 capital structure optimization. Int. Electron. J. Math. Educ. 11 (7), 2571\u20132580 (2016).","journal-title":"Int. Electron. J. Math. Educ."},{"issue":"1","key":"86695_CR18","first-page":"1","volume":"8","author":"V Acar","year":"2022","unstructured":"Acar, V. & \u00dcnal, S. Multi-theoretical portfolio optimization: a game theory application. Balkan Near East. J. Soc. Sci. 8 (1), 1 (2022).","journal-title":"Balkan Near East. J. Soc. Sci."},{"key":"86695_CR19","doi-asserted-by":"crossref","unstructured":"Shan, J. Optimization strategy of tax planning system in the context of artificial intelligence and big data. J. Phys. Conf. Ser.  (2019).","DOI":"10.1088\/1742-6596\/1345\/5\/052006"},{"key":"86695_CR20","unstructured":"Bostan, S. et al. 7th International Conference on Computer Science and Engineering (UBMK) (IEEE, 2022)."},{"key":"86695_CR21","doi-asserted-by":"publisher","first-page":"1008","DOI":"10.1016\/j.sbspro.2013.08.115","volume":"96","author":"Y Ji","year":"2013","unstructured":"Ji, Y. et al. Location optimization model of regional express distribution center. Procedia-Soc. Behav. Sci. 96, 1008\u20131013 (2013).","journal-title":"Procedia-Soc. Behav. Sci."},{"issue":"3","key":"86695_CR22","doi-asserted-by":"publisher","first-page":"200","DOI":"10.1061\/(ASCE)0733-9496(2003)129:3(200)","volume":"129","author":"HR Maier","year":"2003","unstructured":"Maier, H. R. et al. Ant colony optimization for design of water distribution systems. J. Water Resour. Plan. Manag. 129 (3), 200\u2013209 (2003).","journal-title":"J. Water Resour. Plan. Manag."},{"issue":"1","key":"86695_CR23","first-page":"1102","volume":"6","author":"M G\u00fcm\u00fc\u015f","year":"2022","unstructured":"G\u00fcm\u00fc\u015f, M. et al. Route optimization in the collection of recycling wastes: an application in Alanya district. J. Turk. Oper. Manag. 6 (1), 1102\u20131112 (2022).","journal-title":"J. Turk. Oper. Manag."},{"key":"86695_CR24","doi-asserted-by":"crossref","unstructured":"Qing, L. et al. IET,. Aircraft route optimization using genetic algorithms. In Second International Conference on Genetic Algorithms in Engineering Systems: Innovations and Applications (1997).","DOI":"10.1049\/cp:19971212"},{"issue":"1","key":"86695_CR25","doi-asserted-by":"publisher","first-page":"52","DOI":"10.1016\/j.coldregions.2008.07.003","volume":"55","author":"V Kotovirta","year":"2009","unstructured":"Kotovirta, V. et al. A system for route optimization in ice-covered waters. Cold Reg. Sci. Technol. 55 (1), 52\u201362 (2009).","journal-title":"Cold Reg. Sci. Technol."},{"key":"86695_CR26","unstructured":"Solutions, M. L. A. Rota Optimizasyonunun 5 Temel Kullan\u0131m Alan\u0131. https:\/\/www.linkedin.com\/pulse\/rota-optimizasyonunun-5-temel-kullan%C4%B1m-alan%C4%B1-maptriks\/?originalSubdomain=tr (2022)."},{"issue":"1","key":"86695_CR27","first-page":"29","volume":"6","author":"F Di\u015fkaya","year":"2018","unstructured":"Di\u015fkaya, F. & Din\u00e7er, S. E. A model proposal for green logistics management vehicle routing optimization. Beykoz Acad. J. 6 (1), 29\u201346 (2018).","journal-title":"Beykoz Acad. J."},{"key":"86695_CR28","doi-asserted-by":"publisher","first-page":"113123","DOI":"10.1016\/j.eswa.2019.113123","volume":"145","author":"S Zhang","year":"2020","unstructured":"Zhang, S. et al. Fuzzy optimization model for electric vehicle routing problem with time windows and recharging stations. Expert Syst. Appl. 145, 113123 (2020).","journal-title":"Expert Syst. Appl."},{"key":"86695_CR29","unstructured":"Fendo\u011flu, E. Metasezgisel Y\u00f6ntemlerle Rotalama Problemlerinin \u00c7\u00f6z\u00fcm\u00fc i\u00e7in \u00c7ok A\u015famal\u0131 Bir Yakla\u015f\u0131m (2020)."},{"key":"86695_CR30","doi-asserted-by":"publisher","first-page":"106750","DOI":"10.1016\/j.cor.2024.106750","volume":"169","author":"CB Cunha","year":"2024","unstructured":"Cunha, C. B. et al. An ALNS metaheuristic for the family multiple traveling salesman problem. Comput. Oper. Res. 169, 106750 (2024).","journal-title":"Comput. Oper. Res."},{"key":"86695_CR31","doi-asserted-by":"publisher","first-page":"107275","DOI":"10.1016\/j.asoc.2021.107275","volume":"105","author":"M Gunduz","year":"2021","unstructured":"Gunduz, M. & Aslan, M. A discrete Jaya algorithm for solving traveling salesman problem. Appl. Soft Comput. 105, 107275 (2021).","journal-title":"Appl. Soft Comput."},{"issue":"9","key":"86695_CR32","doi-asserted-by":"publisher","first-page":"11547","DOI":"10.1016\/j.eswa.2011.03.032","volume":"38","author":"S MirHassani","year":"2011","unstructured":"MirHassani, S. & Abolghasemi, N. A particle swarm optimization algorithm for open vehicle routing problem. Expert Syst. Appl. 38 (9), 11547\u201311551 (2011).","journal-title":"Expert Syst. Appl."},{"issue":"2","key":"86695_CR33","doi-asserted-by":"publisher","first-page":"367","DOI":"10.1007\/s11831-017-9247-y","volume":"26","author":"AH Halim","year":"2019","unstructured":"Halim, A. H. & Ismail, I. Combinatorial optimization: comparison of heuristic algorithms in travelling salesman problem. Arch. Comput. Methods Eng. 26 (2), 367\u2013380 (2019).","journal-title":"Arch. Comput. Methods Eng."},{"key":"86695_CR34","unstructured":"Papadimitriou, C. H. & Steiglitz, K. Combinatorial Optimization: Algorithms and Complexity (Courier Corporation, 1998)."},{"key":"86695_CR35","doi-asserted-by":"publisher","first-page":"102156","DOI":"10.1016\/j.jocs.2023.102156","volume":"74","author":"S Carmesin","year":"2023","unstructured":"Carmesin, S. et al. The hamiltonian cycle and travelling salesperson problems with traversal-dependent edge deletion. J. Comput. Sci. 74, 102156 (2023).","journal-title":"J. Comput. Sci."},{"key":"86695_CR36","first-page":"225","volume":"7","author":"M J\u00fcnger","year":"1995","unstructured":"J\u00fcnger, M., Reinelt, G. & Rinaldi, G. The traveling salesman problem. Handb. Oper. Res. Manag. Sci. 7, 225\u2013330 (1995).","journal-title":"Handb. Oper. Res. Manag. Sci."},{"issue":"2","key":"86695_CR37","doi-asserted-by":"publisher","first-page":"520","DOI":"10.1016\/j.future.2012.07.008","volume":"29","author":"JS Sartakhti","year":"2013","unstructured":"Sartakhti, J. S., Jalili, S. & Rudi, A. G. A new light-based solution to the hamiltonian path problem. Future Gener. Comput. Syst. 29 (2), 520\u2013527 (2013).","journal-title":"Future Gener. Comput. Syst."},{"key":"86695_CR38","doi-asserted-by":"publisher","first-page":"497","DOI":"10.1016\/j.asoc.2018.08.034","volume":"73","author":"GS Yadav","year":"2018","unstructured":"Yadav, G. S. & Ojha, A. Hamiltonian path based image steganography scheme with improved imperceptibility and undetectability. Appl. Soft Comput. 73, 497\u2013507 (2018).","journal-title":"Appl. Soft Comput."},{"key":"86695_CR39","doi-asserted-by":"crossref","unstructured":"Garey, M. R. & Johnson, D. S. Computers and Intractability: A Guide to the Theory of NP-Completeness in Bulletin of the American Mathematical Society 898\u2013904 (1980).","DOI":"10.1090\/S0273-0979-1980-14848-X"},{"key":"86695_CR40","doi-asserted-by":"publisher","first-page":"100554","DOI":"10.1016\/j.disopt.2019.100554","volume":"35","author":"F Keshavarz-Kohjerdi","year":"2020","unstructured":"Keshavarz-Kohjerdi, F. & Bagheri, A. Linear-time algorithms for finding hamiltonian and longest (s,t)-paths in C-shaped grid graphs. Discret. Optim. 35, 100554 (2020).","journal-title":"Discret. Optim."},{"key":"86695_CR41","unstructured":"Kapamadzin, N. NP Completeness of Hamiltonian Circuits and Paths (2015)."},{"key":"86695_CR42","doi-asserted-by":"publisher","first-page":"108746","DOI":"10.1016\/j.asoc.2022.108746","volume":"121","author":"P Karakostas","year":"2022","unstructured":"Karakostas, P. & Sifaleras, A. A double-adaptive general variable neighborhood search algorithm for the solution of the traveling salesman problem. Appl. Soft Comput. 121, 108746 (2022).","journal-title":"Appl. Soft Comput."},{"issue":"3","key":"86695_CR43","doi-asserted-by":"publisher","first-page":"402","DOI":"10.1057\/jors.2012.24","volume":"64","author":"A Subramanian","year":"2013","unstructured":"Subramanian, A. & Battarra, M. An iterated local search algorithm for the travelling salesman problem with pickups and deliveries. J. Oper. Res. Soc. 64 (3), 402\u2013409 (2013).","journal-title":"J. Oper. Res. Soc."},{"key":"86695_CR44","doi-asserted-by":"publisher","first-page":"100029","DOI":"10.1016\/j.ejco.2022.100029","volume":"10","author":"J Schmidt","year":"2022","unstructured":"Schmidt, J. & Irnich, S. New neighborhoods and an iterated local search algorithm for the generalized traveling salesman problem. EURO. J. Comput. Optim. 10, 100029 (2022).","journal-title":"EURO. J. Comput. Optim."},{"key":"86695_CR45","doi-asserted-by":"publisher","first-page":"109339","DOI":"10.1016\/j.asoc.2022.109339","volume":"127","author":"P Zhang","year":"2022","unstructured":"Zhang, P. et al. A genetic algorithm with jumping gene and heuristic operators for traveling salesman problem. Appl. Soft Comput. 127, 109339 (2022).","journal-title":"Appl. Soft Comput."},{"issue":"1","key":"86695_CR46","first-page":"24","volume":"6","author":"M \u015eahin","year":"2023","unstructured":"\u015eahin, M. Traveling salesman problem optimization with local search section updated bees algorithm. J. Intell. Syst. Theory Appl. 6 (1), 24\u201333 (2023).","journal-title":"J. Intell. Syst. Theory Appl."},{"issue":"1","key":"86695_CR47","doi-asserted-by":"crossref","first-page":"1","DOI":"10.5505\/pajes.2015.17048","volume":"22","author":"T Y\u0131ld\u0131r\u0131m","year":"2016","unstructured":"Y\u0131ld\u0131r\u0131m, T., Kalayc\u0131, C. B. & Mutlu, \u00d6. A novel metaheuristic for traveling salesman problem: blind mole-rat algorithm. Pamukkale Univ. J. Eng. Sci. 22 (1), 1 (2016).","journal-title":"Pamukkale Univ. J. Eng. Sci."},{"key":"86695_CR48","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1007\/BF02022093","volume":"21","author":"M Malek","year":"1989","unstructured":"Malek, M. et al. Serial and parallel simulated annealing and tabu search algorithms for the traveling salesman problem. Ann. Oper. Res. 21, 59\u201384 (1989).","journal-title":"Ann. Oper. Res."},{"issue":"2","key":"86695_CR49","doi-asserted-by":"publisher","first-page":"118","DOI":"10.3390\/biomimetics9020118","volume":"9","author":"MS Kiran","year":"2024","unstructured":"Kiran, M. S. & Beskirli, M. A new approach based on collective intelligence to solve traveling salesman problems. Biomimetics 9 (2), 118 (2024).","journal-title":"Biomimetics"},{"key":"86695_CR50","doi-asserted-by":"publisher","first-page":"107816","DOI":"10.1016\/j.engappai.2023.107816","volume":"131","author":"X Li","year":"2024","unstructured":"Li, X., Zhang, S. & Shao, P. Discrete artificial bee colony algorithm with fixed neighborhood search for traveling salesman problem. Eng. Appl. Artif. Intell. 131, 107816 (2024).","journal-title":"Eng. Appl. Artif. Intell."},{"issue":"14","key":"86695_CR51","doi-asserted-by":"publisher","first-page":"3210","DOI":"10.3390\/math11143210","volume":"11","author":"HM Nayyef","year":"2023","unstructured":"Nayyef, H. M. et al. A novel hybrid algorithm based on jellyfish search and particle swarm optimization. Mathematics 11 (14), 3210 (2023).","journal-title":"Mathematics"},{"issue":"3","key":"86695_CR52","first-page":"933","volume":"9","author":"RZ Zheng","year":"2022","unstructured":"Zheng, R. Z., Zhang, Y. & Yang, K. A transfer learning-based particle swarm optimization algorithm for travelling salesman problem. J. Comput. Des. Eng. 9 (3), 933\u2013948 (2022).","journal-title":"J. Comput. Des. Eng."},{"key":"86695_CR53","doi-asserted-by":"publisher","first-page":"110219","DOI":"10.1016\/j.asoc.2023.110219","volume":"139","author":"GK Jati","year":"2023","unstructured":"Jati, G. K. et al. Discrete komodo algorithm for traveling salesman problem. Appl. Soft Comput. 139, 110219 (2023).","journal-title":"Appl. Soft Comput."},{"key":"86695_CR54","doi-asserted-by":"crossref","unstructured":"Zhan, S. et al. List-based simulated annealing algorithm for traveling salesman problem. Comput. Intell. Neurosci. 2016, 1 (2016).","DOI":"10.1155\/2016\/1712630"},{"issue":"1","key":"86695_CR55","first-page":"44","volume":"267","author":"H John","year":"1992","unstructured":"John, H. Genetic algorithms. Sci. Am. 267 (1), 44\u201350 (1992).","journal-title":"Sci. Am."},{"issue":"3","key":"86695_CR56","first-page":"423","volume":"19","author":"S \u00c7olak","year":"2010","unstructured":"\u00c7olak, S. An application on solving the travelling salesman problem using genetic algorithms. \u00c7ukurova Univ. J. Inst. Soc. Sci. 19 (3), 423\u2013438 (2010).","journal-title":"\u00c7ukurova Univ. J. Inst. Soc. Sci."},{"key":"86695_CR57","unstructured":"Berkaya, M. F. A New Hybrid Metaheuristic Method Based on Cuckoo Search Algorithm for Solving the Traveling Salesman Problem (Konya Technical University, 2021)."},{"issue":"2","key":"86695_CR58","first-page":"1","volume":"20","author":"F Nuriyeva","year":"2016","unstructured":"Nuriyeva, F. & K\u0131z\u0131late\u015f, G. A new hyper-heuristic method for traveling salesman problem from center to margins. S\u00fcleyman Demirel Univ. J. Nat. Appl. Sci. 20 (2), 1 (2016).","journal-title":"S\u00fcleyman Demirel Univ. J. Nat. Appl. Sci."},{"issue":"12","key":"86695_CR59","doi-asserted-by":"publisher","first-page":"3357","DOI":"10.3390\/su11123357","volume":"11","author":"S Malik","year":"2019","unstructured":"Malik, S. & Kim, D. Optimal travel route recommendation mechanism based on neural networks and particle swarm optimization for efficient tourism using tourist vehicular data. Sustainability 11 (12), 3357 (2019).","journal-title":"Sustainability"},{"key":"86695_CR60","doi-asserted-by":"crossref","unstructured":"Cao, S. An optimal round-trip route planning method for tourism based on improved genetic algorithm. Comput. Intell. Neurosci. 2022, 1 (2022).","DOI":"10.1155\/2022\/7665874"},{"key":"86695_CR61","doi-asserted-by":"crossref","unstructured":"Sun, H. et al. Multi-objective optimal travel route recommendation for tourists by improved ant colony optimization algorithm. J. Adv. Transport. 2022, 1 (2022).","DOI":"10.1155\/2022\/6386119"},{"key":"86695_CR62","doi-asserted-by":"crossref","unstructured":"Han, Y., Guan, H. & Duan, J. Tour route multiobjective optimization design based on the tourist satisfaction. Discret. Dyn. Nat. Soc. 2014, 1 (2014).","DOI":"10.1155\/2014\/603494"},{"key":"86695_CR63","doi-asserted-by":"crossref","unstructured":"Fang, S. IEEE,. Research on the travel route based on optimization schedule. In 2013 Fourth International Conference on Intelligent Systems Design and Engineering Applications (2013).","DOI":"10.1109\/ISDEA.2013.529"},{"issue":"8","key":"86695_CR64","doi-asserted-by":"publisher","first-page":"133","DOI":"10.3390\/pr6080133","volume":"6","author":"L Hang","year":"2018","unstructured":"Hang, L. et al. Design and implementation of an optimal travel route recommender system on big data for tourists in Jeju. Processes 6 (8), 133 (2018).","journal-title":"Processes"},{"key":"86695_CR65","doi-asserted-by":"publisher","first-page":"90760","DOI":"10.1109\/ACCESS.2019.2926675","volume":"7","author":"S Ahmad","year":"2019","unstructured":"Ahmad, S. et al. A stochastic approach towards travel route optimization and recommendation based on users constraints using Markov chain. IEEE Access 7, 90760\u201390776 (2019).","journal-title":"IEEE Access"},{"key":"86695_CR66","unstructured":"Chia, W. C. et al. 11th International Conference on Computer Science & Education (ICCSE) (IEEE, 2016)."},{"issue":"3","key":"86695_CR67","doi-asserted-by":"publisher","first-page":"910","DOI":"10.1016\/j.ejor.2021.07.008","volume":"299","author":"MA Nguyen","year":"2022","unstructured":"Nguyen, M. A. et al. The min-cost parallel drone scheduling vehicle routing problem. Eur. J. Oper. Res. 299 (3), 910\u2013930 (2022).","journal-title":"Eur. J. Oper. Res."},{"key":"86695_CR68","doi-asserted-by":"publisher","first-page":"122485","DOI":"10.1016\/j.eswa.2023.122485","volume":"241","author":"M Roytvand Ghiasvand","year":"2024","unstructured":"Roytvand Ghiasvand, M., Rahmani, D. & Moshref-Javadi, M. Data-driven robust optimization for a multi-trip truck-drone routing problem. Expert Syst. Appl. 241, 122485 (2024).","journal-title":"Expert Syst. Appl."},{"issue":"4","key":"86695_CR69","first-page":"879","volume":"23","author":"AC Cinar","year":"2020","unstructured":"Cinar, A. C., Korkmaz, S. & Kiran, M. S. A discrete tree-seed algorithm for solving symmetric traveling salesman problem. Eng. Sci. Technol. Int. J. 23 (4), 879\u2013890 (2020).","journal-title":"Eng. Sci. Technol. Int. J."},{"issue":"8","key":"86695_CR70","doi-asserted-by":"publisher","first-page":"152","DOI":"10.3390\/a12080152","volume":"12","author":"SR Ait Haddadene","year":"2019","unstructured":"Ait Haddadene, S. R., Labadie, N. & Prodhon, C. Bicriteria vehicle routing problem with preferences and timing constraints in home health care services. Algorithms 12 (8), 152 (2019).","journal-title":"Algorithms"},{"key":"86695_CR71","doi-asserted-by":"publisher","first-page":"363","DOI":"10.1057\/jors.1979.77","volume":"30","author":"JP Norback","year":"1979","unstructured":"Norback, J. P. & Love, R. F. Heuristic for the hamiltonian path problem in Euclidian two space. J. Oper. Res. Soc. 30, 363\u2013368 (1979).","journal-title":"J. Oper. Res. Soc."},{"key":"86695_CR72","doi-asserted-by":"crossref","unstructured":"Ma, Y. et al. Mudanjiang travel routing problem by simulated annealing approach. In. 3rd International Conference on Public Management and Intelligent Society (PMIS 2023) (Atlantis Press, 2023).","DOI":"10.2991\/978-94-6463-200-2_51"},{"key":"86695_CR73","unstructured":"Elmas, \u00c7. Yapay Zeka uygulamalar\u0131 (Se\u00e7kin Yay\u0131nc\u0131l\u0131k, 2018)."},{"key":"86695_CR74","unstructured":"Konya, M. M. Bus Line Information. https:\/\/acikveri.konya.bel.tr\/dataset\/otobus-hat-bilgisi\/resource\/b00b7406-70a6-4a6b-be83-16f96d5367ac (2023)."},{"key":"86695_CR75","unstructured":"Konya, M. M. Bus Line-Destination Information. https:\/\/acikveri.konya.bel.tr\/dataset\/otobus-hat-durak-bilgisi\/resource\/14150713-11b6-4528-97d3-5e2e49dc421f (2023)."},{"key":"86695_CR76","doi-asserted-by":"crossref","unstructured":"Gunawan, S., Susyanto, N. & Bahar, S. Vehicle routing problem with pick-up and deliveries using genetic algorithm in express delivery services. AIP Conf. Proc. 2192 (1), 060009 (2019).","DOI":"10.1063\/1.5139155"},{"issue":"2","key":"86695_CR77","first-page":"29","volume":"2","author":"WMA Alashheb","year":"2019","unstructured":"Alashheb, W. M. A. et al. Comparision of ant colony and genetic algorithms for the solution of travel salesman problem. AURUM J. Eng. Syst. Archit. 2 (2), 29\u201343 (2019).","journal-title":"AURUM J. Eng. Syst. Archit."},{"key":"86695_CR78","unstructured":"Webster, B. Crossover Technique: Cycle Crossover. https:\/\/rubicite.com\/Tutorials\/GeneticAlgorithms\/CrossoverOperators\/CycleCrossoverOperator.aspx (2023)."},{"key":"86695_CR79","unstructured":"Varnamkhasti, M. J. Fuzzy Genetic Algorithms for Combinatorial Optimisation Problems (Universiti Putra Malaysia, 2012)."},{"key":"86695_CR80","unstructured":"Crossley, M., Nisbet, A. & Amos, A. Quantifying the impact of parameter tuning on nature-inspired algorithms. Preprint at http:\/\/arxiv.org\/1305.0763 (2013)."},{"key":"86695_CR81","unstructured":"Lavesson, N. & Davidsson, P. Quantifying the Impact of Learning Algorithm Parameter Tuning (AAAI, 2006)."},{"key":"86695_CR82","unstructured":"Karaboga, D. An Idea Based on Honey Bee Swarm for Numerical Optimization. Technical Report (Erciyes University, 2005)."},{"issue":"4","key":"86695_CR83","doi-asserted-by":"publisher","first-page":"28","DOI":"10.1109\/MCI.2006.329691","volume":"1","author":"M Dorigo","year":"2006","unstructured":"Dorigo, M., Birattari, M. & Stutzle, T. Ant colony optimization. IEEE Comput. Intell. Mag. 1 (4), 28\u201339 (2006).","journal-title":"IEEE Comput. Intell. Mag."},{"issue":"4598","key":"86695_CR84","doi-asserted-by":"publisher","first-page":"671","DOI":"10.1126\/science.220.4598.671","volume":"220","author":"S Kirkpatrick","year":"1983","unstructured":"Kirkpatrick, S., Gelatt, C. D. & Vecchi, M. P. Optimization by simulated annealing. Science 220 (4598), 671\u2013680 (1983).","journal-title":"Science"},{"issue":"19","key":"86695_CR85","doi-asserted-by":"publisher","first-page":"6686","DOI":"10.1016\/j.eswa.2015.04.055","volume":"42","author":"MS Kiran","year":"2015","unstructured":"Kiran, M. S. & TSA Tree-seed algorithm for continuous optimization. Expert Syst. Appl. 42 (19), 6686\u20136698 (2015).","journal-title":"Expert Syst. Appl."},{"key":"86695_CR86","unstructured":"Kennedy, J. & Eberhart, R. Particle swarm optimization. In Proceedings of ICNN\u201995\u2014International Conference on Neural Networks (1995)."}],"container-title":["Scientific Reports"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.nature.com\/articles\/s41598-025-86695-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.nature.com\/articles\/s41598-025-86695-4","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.nature.com\/articles\/s41598-025-86695-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,20]],"date-time":"2025-01-20T01:52:40Z","timestamp":1737337960000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.nature.com\/articles\/s41598-025-86695-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,1,20]]},"references-count":86,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2025,12]]}},"alternative-id":["86695"],"URL":"https:\/\/doi.org\/10.1038\/s41598-025-86695-4","relation":{},"ISSN":["2045-2322"],"issn-type":[{"value":"2045-2322","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,1,20]]},"assertion":[{"value":"2 September 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"13 January 2025","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"20 January 2025","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"}}],"article-number":"2491"}}