{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,2]],"date-time":"2026-04-02T03:22:04Z","timestamp":1775100124111,"version":"3.50.1"},"reference-count":24,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2025,6,1]],"date-time":"2025-06-01T00:00:00Z","timestamp":1748736000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0"},{"start":{"date-parts":[[2025,6,13]],"date-time":"2025-06-13T00:00:00Z","timestamp":1749772800000},"content-version":"vor","delay-in-days":12,"URL":"https:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Int J Netw Distrib Comput"],"published-print":{"date-parts":[[2025,6]]},"DOI":"10.1007\/s44227-025-00062-3","type":"journal-article","created":{"date-parts":[[2025,6,13]],"date-time":"2025-06-13T04:35:30Z","timestamp":1749789330000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Enhancing Green Vehicle Routing Efficiency Through Machine Learning-Optimized Genetic Algorithms"],"prefix":"10.1007","volume":"13","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-6489-7222","authenticated-orcid":false,"given":"Lahcene","family":"Guezouli","sequence":"first","affiliation":[]},{"given":"Lyamine","family":"Guezouli","sequence":"additional","affiliation":[]},{"given":"Sara","family":"Ameghchouche","sequence":"additional","affiliation":[]},{"given":"Hilal","family":"Menzer","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,6,13]]},"reference":[{"key":"62_CR1","unstructured":"Sauer J (2015) Energy-optimal routes for electric vehicles with charging stops. Bachelor thesis, Karlsruhe Institute of Technology"},{"issue":"1","key":"62_CR2","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1007\/s40866-020-00086-4","volume":"5","author":"D Chandramohan","year":"2020","unstructured":"Chandramohan D, Dumka A, Jayakumar L (2020) 2M2C-R2ED: Multi-metric cooperative clustering based routing for energy efficient data dissemination in green-VANETs. Technol Econ Smart Grids Sustainable Energy 5(1):15","journal-title":"Technol Econ Smart Grids Sustainable Energy"},{"issue":"4","key":"62_CR3","doi-asserted-by":"publisher","first-page":"361","DOI":"10.1080\/08839510151087293","volume":"15","author":"SR Thangiah","year":"2001","unstructured":"Thangiah SR, Salhi S (2001) Genetic clustering: an adaptive heuristic for the multidepot vehicle routing problem. Appl Artif Intell 15(4):361\u2013383","journal-title":"Appl Artif Intell"},{"issue":"3","key":"62_CR4","doi-asserted-by":"publisher","first-page":"332","DOI":"10.1504\/IJMOR.2018.094850","volume":"13","author":"L Guezouli","year":"2018","unstructured":"Guezouli L, Abdelhamid S (2018) Multi-objective optimisation using genetic algorithm based clustering for multi-depot heterogeneous fleet vehicle routing problem with time windows. Int J Math Oper Res 13(3):332\u2013349","journal-title":"Int J Math Oper Res"},{"key":"62_CR5","doi-asserted-by":"crossref","unstructured":"Ma L et al (2023) Pareto-wise ranking classifier for multi-objective evolutionary neural architecture search. IEEE Transactions on Evolutionary Computation","DOI":"10.1109\/TEVC.2023.3314766"},{"key":"62_CR6","doi-asserted-by":"publisher","first-page":"48","DOI":"10.1016\/j.comcom.2022.04.005","volume":"190","author":"R Yesodha","year":"2022","unstructured":"Yesodha R, Amudha T (2022) A bio-inspired approach: firefly algorithm for multi-depot vehicle routing problem with time windows. Comput Commun 190:48\u201356","journal-title":"Comput Commun"},{"issue":"1","key":"62_CR7","first-page":"141","volume":"8","author":"N Rincon-Garcia","year":"2017","unstructured":"Rincon-Garcia N, Waterson B, Cherrett T (2017) A hybrid metaheuristic for the time-dependent vehicle routing problem with hard time windows. Int J Ind Eng Comput 8(1):141\u2013160","journal-title":"Int J Ind Eng Comput"},{"key":"62_CR8","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1007\/s10951-008-0072-x","volume":"12","author":"A-S Pepin","year":"2009","unstructured":"Pepin A-S et al (2009) A comparison of five heuristics for the multiple depot vehicle scheduling problem. J Sched 12:17\u201330","journal-title":"J Sched"},{"issue":"4","key":"62_CR9","doi-asserted-by":"publisher","first-page":"548","DOI":"10.1016\/j.engappai.2007.06.001","volume":"21","author":"W Ho","year":"2008","unstructured":"Ho W et al (2008) A hybrid genetic algorithm for the multi-depot vehicle routing problem. Eng Appl Artif Intell 21(4):548\u2013557","journal-title":"Eng Appl Artif Intell"},{"issue":"1","key":"62_CR10","doi-asserted-by":"publisher","first-page":"100","DOI":"10.1016\/j.tre.2011.08.001","volume":"48","author":"S Erdo\u011fan","year":"2012","unstructured":"Erdo\u011fan S, Miller-Hooks E (2012) A green vehicle routing problem. Transp Res E 48(1):100\u2013114","journal-title":"Transp Res E"},{"key":"62_CR11","doi-asserted-by":"crossref","unstructured":"Cooray P, Rupasinghe TD (2017) Machine learning-based parameter tuned genetic algorithm for energy minimizing vehicle routing problem. Journal of Industrial Engineering, 2017","DOI":"10.1155\/2017\/3019523"},{"issue":"1","key":"62_CR12","first-page":"19","volume":"2","author":"AM Aminu","year":"2021","unstructured":"Aminu AM, Nura A (2021) A genetic clustering algorithm for Multi-Depot vehicle routing. SLU J Sci Technol 2(1):19\u201329","journal-title":"SLU J Sci Technol"},{"key":"62_CR13","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1016\/j.disopt.2014.03.001","volume":"12","author":"C Contardo","year":"2014","unstructured":"Contardo C, Martinelli R (2014) A new exact algorithm for the multi-depot vehicle routing problem under capacity and route length constraints. Discrete Optim 12:129\u2013146","journal-title":"Discrete Optim"},{"key":"62_CR14","doi-asserted-by":"crossref","unstructured":"Baum M et al (2013) Energy-optimal routes for electric vehicles. In Proceedings of the 21st ACM SIGSPATIAL international conference on advances in geographic information systems","DOI":"10.1145\/2525314.2525361"},{"issue":"3","key":"62_CR15","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1145\/321127.321128","volume":"9","author":"JH Holland","year":"1962","unstructured":"Holland JH (1962) Outline for a logical theory of adaptive systems. J ACM (JACM) 9(3):297\u2013314","journal-title":"J ACM (JACM)"},{"key":"62_CR16","volume-title":"Cenetic algorithms in search","author":"DE Goldberg","year":"1989","unstructured":"Goldberg DE (1989) Cenetic algorithms in search. Optimization, Machine Learning"},{"key":"62_CR17","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1007\/s12532-010-0013-5","volume":"2","author":"C Gro\u00ebr","year":"2010","unstructured":"Gro\u00ebr C, Golden B, Wasil E (2010) A library of local search heuristics for the vehicle routing problem. Math Program Comput 2:79\u2013101","journal-title":"Math Program Comput"},{"key":"62_CR18","doi-asserted-by":"publisher","first-page":"80716","DOI":"10.1109\/ACCESS.2020.2988796","volume":"8","author":"KP Sinaga","year":"2020","unstructured":"Sinaga KP, Yang M-S (2020) Unsupervised K-means clustering algorithm. IEEE Access 8:80716\u201380727","journal-title":"IEEE Access"},{"issue":"2","key":"62_CR19","doi-asserted-by":"publisher","first-page":"735","DOI":"10.32604\/iasc.2021.019067","volume":"30","author":"TM Ghazal","year":"2021","unstructured":"Ghazal TM (2021) Performances of K-means clustering algorithm with different distance metrics. Intell Autom Soft Comput 30(2):735\u2013742","journal-title":"Intell Autom Soft Comput"},{"key":"62_CR20","doi-asserted-by":"crossref","unstructured":"Stevi\u0107 \u017d, Gavranovi\u0107 M (2023) Choosing the optimal route for a delivery vehicle in X express company using Clarke and Wright algorithm. In: Computational intelligence for modern business systems: emerging applications and strategies. Springer, pp 407\u2013418","DOI":"10.1007\/978-981-99-5354-7_21"},{"key":"62_CR21","doi-asserted-by":"crossref","unstructured":"Amal M-A, Baba-Ali AR (2011) Survey of nearest neighbor condensing techniques. Int J Adv Comput Sci Appl, 2(11)","DOI":"10.14569\/IJACSA.2011.021110"},{"issue":"6","key":"62_CR22","doi-asserted-by":"publisher","first-page":"846","DOI":"10.7763\/IJCTE.2013.V5.809","volume":"5","author":"P Chand","year":"2013","unstructured":"Chand P, Mohanty J (2013) Multi objective genetic approach for solving vehicle routing problem. Int J Comput Theory Eng 5(6):846","journal-title":"Int J Comput Theory Eng"},{"issue":"3","key":"62_CR23","doi-asserted-by":"publisher","first-page":"37","DOI":"10.3390\/computation10030037","volume":"10","author":"LA Bejarano","year":"2022","unstructured":"Bejarano LA, Espitia HE, Montenegro CE (2022) Clustering analysis for the Pareto optimal front in multi-objective optimization. Computation 10(3):37","journal-title":"Computation"},{"key":"62_CR24","doi-asserted-by":"crossref","unstructured":"Fogel DB (1998) Evolutionary computation. The fossil record. Selected readings on the history of evolutionary computation. Classifier Systems","DOI":"10.1109\/9780470544600"}],"container-title":["International Journal of Networked and Distributed Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s44227-025-00062-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s44227-025-00062-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s44227-025-00062-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,9,6]],"date-time":"2025-09-06T19:16:52Z","timestamp":1757186212000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s44227-025-00062-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,6]]},"references-count":24,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2025,6]]}},"alternative-id":["62"],"URL":"https:\/\/doi.org\/10.1007\/s44227-025-00062-3","relation":{},"ISSN":["2211-7938","2211-7946"],"issn-type":[{"value":"2211-7938","type":"print"},{"value":"2211-7946","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,6]]},"assertion":[{"value":"29 May 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"19 March 2025","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"19 May 2025","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"13 June 2025","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"Not applicable.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethical Approval"}},{"value":"Not applicable.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Consent to Participate"}},{"value":"Not applicable.","order":4,"name":"Ethics","group":{"name":"EthicsHeading","label":"Consent for Publication"}},{"value":"The authors declare that they have no competing interests.","order":5,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of Interest"}}],"article-number":"21"}}