{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,16]],"date-time":"2026-02-16T10:24:26Z","timestamp":1771237466503,"version":"3.50.1"},"reference-count":29,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2025,2,1]],"date-time":"2025-02-01T00:00:00Z","timestamp":1738368000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2025,2,13]],"date-time":"2025-02-13T00:00:00Z","timestamp":1739404800000},"content-version":"vor","delay-in-days":12,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"name":"Ministero delle Imprese e del Made in Italy","award":["D33B22000060001"],"award-info":[{"award-number":["D33B22000060001"]}]},{"DOI":"10.13039\/501100021856","name":"Ministero dell\u2019Universit\u00e0 e della Ricerca","doi-asserted-by":"publisher","award":["D.M. 10\/08\/2021 n.1062"],"award-info":[{"award-number":["D.M. 10\/08\/2021 n.1062"]}],"id":[{"id":"10.13039\/501100021856","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100012305","name":"Universit\u00e0 degli Studi del Molise","doi-asserted-by":"crossref","id":[{"id":"10.13039\/501100012305","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Soft Comput"],"published-print":{"date-parts":[[2025,2]]},"abstract":"<jats:title>Abstract<\/jats:title>\n          <jats:p>This paper introduces a novel meta-heuristic for addressing a variant of the classical Capacitated Vehicle Routing Problem (CVRP) known as the Generalized Vehicle Routing Problem (GVRP). In the GVRP, nodes are organized into clusters, with the constraint that only one node from each cluster must be visited. The proposed meta-heuristic is a Hybrid Genetic Search (HGS) that leverages recent advancements in CVRP methodologies, adapting successful strategies and techniques from CVRP to the GVRP context. To evaluate the performance of the HGS meta-heuristic, we perform an extensive computational analysis on numerous benchmark instances ranging from small to large sizes. To thoroughly analyze the algorithm\u2019s average behavior, convergence profiles over time are reported for the considered instances. Results show that the proposed algorithm achieves 174 new best solutions out of the 498 instances considered. In only six instances out of 498, the algorithm is unable to reach or improve upon the best-known solution in the literature. These results suggest that the proposed meta-heuristic has significant potential in addressing real-world generalized vehicle routing challenges. Code available at: <jats:ext-link xmlns:xlink=\"http:\/\/www.w3.org\/1999\/xlink\" xlink:href=\"https:\/\/github.com\/vlatorre847\/HGSGVRP\" ext-link-type=\"uri\">https:\/\/github.com\/vlatorre847\/HGSGVRP<\/jats:ext-link>.<\/jats:p>","DOI":"10.1007\/s00500-025-10507-0","type":"journal-article","created":{"date-parts":[[2025,2,13]],"date-time":"2025-02-13T07:37:31Z","timestamp":1739432251000},"page":"1553-1566","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["A hybrid genetic search based approach for the generalized vehicle routing problem"],"prefix":"10.1007","volume":"29","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-4644-848X","authenticated-orcid":false,"given":"Vittorio","family":"Latorre","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,2,13]]},"reference":[{"issue":"1","key":"10507_CR1","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1093\/jigpal\/jzx037","volume":"26","author":"H-M Andrei","year":"2018","unstructured":"Andrei H-M, Levente F, Pop Petric\u0103 C, Daniela D (2018) A decomposition-based method for solving the clustered vehicle routing problem. Logic Journal of the IGPL 26(1):83\u201395","journal-title":"Logic Journal of the IGPL"},{"issue":"1","key":"10507_CR2","doi-asserted-by":"publisher","first-page":"58","DOI":"10.1287\/opre.2013.1227","volume":"62","author":"M Battarra","year":"2014","unstructured":"Battarra M, Erdo\u011fan G, Vigo D (2014) Exact algorithms for the clustered vehicle routing problem. Oper Res 62(1):58\u201371","journal-title":"Oper Res"},{"issue":"3","key":"10507_CR3","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1287\/trsc.1100.0352","volume":"45","author":"T Bekta\u015f","year":"2011","unstructured":"Bekta\u015f T, Erdo\u011fan G, R\u00f8pke S (2011) Formulations and branch-and-cut algorithms for the generalized vehicle routing problem. Transp Sci 45(3):299\u2013316","journal-title":"Transp Sci"},{"issue":"5","key":"10507_CR4","doi-asserted-by":"publisher","first-page":"771","DOI":"10.3390\/math8050771","volume":"8","author":"S Cosmin","year":"2020","unstructured":"Cosmin S, Pop Petric\u0103 C, Andrei H-M (2020) On the selective vehicle routing problem. Mathematics 8(5):771","journal-title":"Mathematics"},{"key":"10507_CR5","doi-asserted-by":"publisher","first-page":"78","DOI":"10.1016\/j.cor.2017.02.007","volume":"83","author":"C Defryn","year":"2017","unstructured":"Defryn C, S\u00f6rensen K (2017) A fast two-level variable neighborhood search for the clustered vehicle routing problem. Comput Oper Res 83:78\u201394","journal-title":"Comput Oper Res"},{"key":"10507_CR6","doi-asserted-by":"publisher","first-page":"274","DOI":"10.1016\/j.cie.2015.11.022","volume":"91","author":"C Exp\u00f3sito-Izquierdo","year":"2016","unstructured":"Exp\u00f3sito-Izquierdo C, Rossi A, Sevaux M (2016) A two-level solution approach to solve the clustered capacitated vehicle routing problem. Comput Ind Eng 91:274\u2013289","journal-title":"Comput Ind Eng"},{"issue":"1","key":"10507_CR7","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1016\/S0377-2217(99)00073-9","volume":"122","author":"G Ghiani","year":"2000","unstructured":"Ghiani G, Improta G (2000) An efficient transformation of the generalized vehicle routing problem. Eur J Oper Res 122(1):11\u201317","journal-title":"Eur J Oper Res"},{"key":"10507_CR8","doi-asserted-by":"crossref","unstructured":"Golden Bruce\u00a0L, Wasil Edward\u00a0A, Kelly James\u00a0P, Chao I-Ming (1998) The impact of metaheuristics on solving the vehicle routing problem: algorithms, problem sets, and computational results. In Fleet management and logistics, pages 33\u201356. Springer","DOI":"10.1007\/978-1-4615-5755-5_2"},{"issue":"1","key":"10507_CR9","doi-asserted-by":"publisher","first-page":"118","DOI":"10.1016\/j.ejor.2018.02.056","volume":"270","author":"T Hintsch","year":"2018","unstructured":"Hintsch T, Irnich S (2018) Large multiple neighborhood search for the clustered vehicle-routing problem. Eur J Oper Res 270(1):118\u2013131","journal-title":"Eur J Oper Res"},{"key":"10507_CR10","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2021.107655","volume":"110","author":"Md Islam","year":"2021","unstructured":"Islam Md, Anisul GY, ElMekkawy TY (2021) Hybrid particle swarm optimization algorithm for solving the clustered vehicle routing problem. Appl Soft Comput 110:107655","journal-title":"Appl Soft Comput"},{"key":"10507_CR11","doi-asserted-by":"crossref","unstructured":"Jolfaei Ali Aghadavoudi (2023) Mahdi Alinaghian, Roghayeh Bahrami, and Erfan Babaee Tirkolaee. Contemporary trends and research directions. Heliyon, Generalized vehicle routing problem","DOI":"10.1016\/j.heliyon.2023.e22733"},{"key":"10507_CR12","unstructured":"Latorre Vittorio, Salvatore Donato, Tazzioli Federico (2023) An effective reduction method for selective vehicle routing problems in order picking warehouse optimization. Submited to Optimization Letters"},{"key":"10507_CR13","unstructured":"Oliver I, Smith D, Holland J, C, (1987) a study of permutation crossover operators on the travelling salesman problem. In Genetic Algorithms and their Application: Proceedings of the 2nd International Conference on Genetic Algorithms"},{"issue":"1","key":"10507_CR14","first-page":"117","volume":"38","author":"C Ovidiu","year":"2022","unstructured":"Ovidiu C, Pop Petric\u0103 C, Pop SC (2022) A two-level based genetic algorithm for solving the soft-clustered vehicle routing problem. Carpathian Journal of Mathematics 38(1):117\u2013128","journal-title":"Carpathian Journal of Mathematics"},{"issue":"1","key":"10507_CR15","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1016\/j.apm.2011.05.037","volume":"36","author":"C Pop Petric\u0103","year":"2012","unstructured":"Pop Petric\u0103 C, Imdat K, Horvat MA (2012) New mathematical models of the generalized vehicle routing problem and extensions. Appl Math Model 36(1):97\u2013107","journal-title":"Appl Math Model"},{"key":"10507_CR16","doi-asserted-by":"publisher","first-page":"76","DOI":"10.1016\/j.neucom.2012.03.032","volume":"109","author":"C Pop Petric\u0103","year":"2013","unstructured":"Pop Petric\u0103 C, Oliviu M, Pop SC (2013) An improved hybrid algorithm for solving the generalized vehicle routing problem. Neurocomputing 109:76\u201383","journal-title":"Neurocomputing"},{"key":"10507_CR17","doi-asserted-by":"crossref","unstructured":"Pop Petrica\u00a0C, Fuksz Levente, Marc Andrei\u00a0Horvat, Sabo Cosmin (2018) A novel two-level optimization approach for clustered vehicle routing problem. Computers & Industrial Engineering, 115:304\u2013318","DOI":"10.1016\/j.cie.2017.11.018"},{"issue":"3","key":"10507_CR18","doi-asserted-by":"publisher","first-page":"435","DOI":"10.1016\/j.ejor.2012.08.014","volume":"224","author":"V Schmid","year":"2013","unstructured":"Schmid V, Doerner KF, Laporte G (2013) Rich routing problems arising in supply chain management. Eur J Oper Res 224(3):435\u2013448","journal-title":"Eur J Oper Res"},{"key":"10507_CR19","unstructured":"Sevaux Marc, S\u00f6rensen Kenneth, et\u00a0al (2008) Hamiltonian paths in large clustered routing problems. In Proceedings of the EU\/MEeting 2008 workshop on Metaheuristics for Logistics and Vehicle Routing, EU\/ME, volume\u00a08, pages 411\u2013417"},{"issue":"3","key":"10507_CR20","doi-asserted-by":"publisher","first-page":"611","DOI":"10.1287\/opre.1120.1048","volume":"60","author":"V Thibaut","year":"2012","unstructured":"Thibaut V, Gabriel CT, Michel G, Nadia L, Walter R (2012) A hybrid genetic algorithm for multidepot and periodic vehicle routing problems. Oper Res 60(3):611\u2013624","journal-title":"Oper Res"},{"issue":"3","key":"10507_CR21","doi-asserted-by":"publisher","first-page":"658","DOI":"10.1016\/j.ejor.2013.09.045","volume":"234","author":"V Thibaut","year":"2014","unstructured":"Thibaut V, Gabriel CT, Michel G, Christian P (2014) A unified solution framework for multi-attribute vehicle routing problems. Eur J Oper Res 234(3):658\u2013673","journal-title":"Eur J Oper Res"},{"key":"10507_CR22","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1016\/j.cor.2014.10.019","volume":"58","author":"V Thibaut","year":"2015","unstructured":"Thibaut V, Maria B, Anand S, Erdog\u01cen G (2015) Hybrid metaheuristics for the clustered vehicle routing problem. Computers & Operations Research 58:87\u201399","journal-title":"Computers & Operations Research"},{"issue":"2","key":"10507_CR23","doi-asserted-by":"publisher","first-page":"720","DOI":"10.1287\/trsc.2015.0584","volume":"50","author":"V Thibaut","year":"2016","unstructured":"Thibaut V, Nelson M, Satoru OL, Huachi VPP (2016) Large neighborhoods with implicit customer selection for vehicle routing problems with profits. Transp Sci 50(2):720\u2013734","journal-title":"Transp Sci"},{"issue":"3","key":"10507_CR24","doi-asserted-by":"publisher","first-page":"706","DOI":"10.1287\/trsc.2020.1035","volume":"55","author":"V Thibaut","year":"2021","unstructured":"Thibaut V, Rafael M, Anh PT, Ho\u00e0ng HM (2021) Arc routing with time-dependent travel times and paths. Transp Sci 55(3):706\u2013724","journal-title":"Transp Sci"},{"key":"10507_CR25","doi-asserted-by":"crossref","unstructured":"Toth Paolo, Vigo Daniele (2002) The vehicle routing problem. SIAM","DOI":"10.1137\/1.9780898718515"},{"key":"10507_CR26","doi-asserted-by":"publisher","first-page":"40","DOI":"10.1016\/j.cor.2015.11.012","volume":"69","author":"T Vidal","year":"2016","unstructured":"Vidal T (2016) Split algorithm in o (n) for the capacitated vehicle routing problem. Computers & Operations Research 69:40\u201347","journal-title":"Computers & Operations Research"},{"issue":"4","key":"10507_CR27","doi-asserted-by":"publisher","first-page":"992","DOI":"10.1287\/opre.2017.1595","volume":"65","author":"T Vidal","year":"2017","unstructured":"Vidal T (2017) Node, edge, arc routing and turn penalties: Multiple problems-one neighborhood extension. Oper Res 65(4):992\u20131010","journal-title":"Oper Res"},{"key":"10507_CR28","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2021.105643","volume":"140","author":"T Vidal","year":"2022","unstructured":"Vidal T (2022) Hybrid genetic search for the cvrp: Open-source implementation and swap* neighborhood. Computers & Operations Research 140:105643","journal-title":"Computers & Operations Research"},{"issue":"21","key":"10507_CR29","doi-asserted-by":"publisher","first-page":"15699","DOI":"10.1007\/s00500-023-08811-8","volume":"27","author":"F Wan","year":"2023","unstructured":"Wan F, Guo H, Pan W, Hou J, Chen S (2023) A mathematical method for solving multi-depot vehicle routing problem. Soft Comput 27(21):15699\u201315717","journal-title":"Soft Comput"}],"container-title":["Soft Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-025-10507-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00500-025-10507-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-025-10507-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,27]],"date-time":"2025-02-27T21:42:26Z","timestamp":1740692546000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00500-025-10507-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,2]]},"references-count":29,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2025,2]]}},"alternative-id":["10507"],"URL":"https:\/\/doi.org\/10.1007\/s00500-025-10507-0","relation":{},"ISSN":["1432-7643","1433-7479"],"issn-type":[{"value":"1432-7643","type":"print"},{"value":"1433-7479","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,2]]},"assertion":[{"value":"8 November 2024","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"13 February 2025","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 have no relevant financial or non-financial interests to disclose. All the authors declare that they have no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}},{"value":"Not applicable.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethical Statement"}}]}}