{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,14]],"date-time":"2026-02-14T13:35:04Z","timestamp":1771076104960,"version":"3.50.1"},"reference-count":28,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2025,7,5]],"date-time":"2025-07-05T00:00:00Z","timestamp":1751673600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,7,5]],"date-time":"2025-07-05T00:00:00Z","timestamp":1751673600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"name":"Ministero delle Imprese e del Made in Italy","award":["CUP: D33B22000060001"],"award-info":[{"award-number":["CUP: D33B22000060001"]}]},{"DOI":"10.13039\/501100021856","name":"Ministero dell'Universit\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"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Evol. Intel."],"published-print":{"date-parts":[[2025,8]]},"DOI":"10.1007\/s12065-025-01063-5","type":"journal-article","created":{"date-parts":[[2025,7,5]],"date-time":"2025-07-05T00:00:34Z","timestamp":1751673634000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["An application of a two-level genetic search for the soft-clustered vehicle routing problem"],"prefix":"10.1007","volume":"18","author":[{"given":"Vittorio","family":"Latorre","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,7,5]]},"reference":[{"issue":"1","key":"1063_CR1","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. https:\/\/doi.org\/10.1287\/opre.2013.1227","journal-title":"Oper Res"},{"issue":"4","key":"1063_CR2","doi-asserted-by":"publisher","first-page":"708","DOI":"10.1287\/trsc.2023.0107","volume":"58","author":"L Baty","year":"2024","unstructured":"Baty L et al (2024) Combinatorial optimization-enriched machine learning to solve the dynamic vehicle routing problem with time windows. Transp Sci 58(4):708\u2013725","journal-title":"Transp Sci"},{"issue":"1","key":"1063_CR3","doi-asserted-by":"publisher","first-page":"117","DOI":"10.37193\/CJM.2022.01.09","volume":"38","author":"O Cosma","year":"2022","unstructured":"Cosma O, Pop PC, Sitar CP (2022) A two-level based genetic algorithm for solving the soft-clustered vehicle routing problem. Carpathian J Math 38(1):117\u2013128","journal-title":"Carpathian J Math"},{"key":"1063_CR4","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, Kenneth S (2017) A fast two-level variable neighborhood search for the clustered vehicle routing problem. Comput Oper Res 83:78\u201394. https:\/\/doi.org\/10.1016\/j.cor.2017.02.007","journal-title":"Comput Oper Res"},{"key":"1063_CR5","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, Andr\u00e9 R, Marc S (2016) A two-level solution approach to solve the clustered capacitated vehicle routing problem. Comput Ind Eng 91:274\u2013289. https:\/\/doi.org\/10.1016\/j.cie.2015.11.022","journal-title":"Comput Ind Eng"},{"key":"1063_CR6","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2020.105132","volume":"129","author":"T Hintsch","year":"2021","unstructured":"Hintsch T (2021) Large multiple neighborhood search for the soft-clustered vehicle-routing problem. Comput Oper Res 129:105132. https:\/\/doi.org\/10.1016\/j.cor.2020.105132","journal-title":"Comput Oper Res"},{"issue":"1","key":"1063_CR7","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1093\/jigpal\/jzx037","volume":"26","author":"A Horvat-Marc","year":"2018","unstructured":"Horvat-Marc A et al (2018) A decomposition-based method for solving the clustered vehicle routing problem. Logic J IGPL 26(1):83\u201395. https:\/\/doi.org\/10.1093\/jigpal\/jzx037","journal-title":"Logic J IGPL"},{"key":"1063_CR8","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2021.107655","volume":"110","author":"MA Islam","year":"2021","unstructured":"Islam MA, Yuvraj G, Tarek YE (2021) Hybrid particle swarm optimization algorithm for solving the clustered vehicle routing problem. Appl Soft Comput 110:107655. https:\/\/doi.org\/10.1016\/j.asoc.2021.107655","journal-title":"Appl Soft Comput"},{"key":"1063_CR9","doi-asserted-by":"crossref","unstructured":"Latorre V (2024) A two-level of hybrid genetic search for the clustered vehicle routing problem. Comput Oper Res (submitted to)","DOI":"10.1007\/s12065-025-01063-5"},{"key":"1063_CR10","doi-asserted-by":"publisher","DOI":"10.1007\/s00500-025-10507-0","author":"V Latorre","year":"2025","unstructured":"Latorre V (2025) A hybrid genetic search based approach for the generalized vehicle routing problem. Soft Comput. https:\/\/doi.org\/10.1007\/s00500-025-10507-0","journal-title":"Soft Comput"},{"key":"1063_CR11","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1007\/BF01889983","volume":"1","author":"Z Michalewicz","year":"1991","unstructured":"Michalewicz Z, Janikow CZ (1991) Genetic algorithms for numerical optimization. Stat Comput 1:75\u201391","journal-title":"Stat Comput"},{"key":"1063_CR12","unstructured":"Oliver I Smith D, Holland J (1987) A study of permutation crossover operators on the travelling salesman problem. In: Genet. Algorithms Their Appl.: Proc. 2nd Int. Conf. Genet. Algorithms"},{"key":"1063_CR13","doi-asserted-by":"publisher","first-page":"76","DOI":"10.1016\/j.neucom.2012.03.032","volume":"109","author":"PC Pop","year":"2013","unstructured":"Pop PC, Matei O, Sitar CP (2013) An improved hybrid algorithm for solving the generalized vehicle routing problem. Neurocomputing 109:76\u201383","journal-title":"Neurocomputing"},{"key":"1063_CR14","doi-asserted-by":"publisher","first-page":"304","DOI":"10.1016\/j.cie.2017.11.018","volume":"115","author":"PC Pop","year":"2018","unstructured":"Pop PC et al (2018) A novel two-level optimization approach for clustered vehicle routing problem. Comput Ind Eng 115:304\u2013318. https:\/\/doi.org\/10.1016\/j.cie.2017.11.018","journal-title":"Comput Ind Eng"},{"key":"1063_CR15","doi-asserted-by":"crossref","unstructured":"Rarit\u00e0 L, et al (2020) Optimization approaches to manage congestions for the phenomenon \u201cLuci D\u2019Artista\u201d in Salerno. In: Proceedings of 32nd European modeling and simulation symposium, EMSS 2020, pp 319\u2013324","DOI":"10.46354\/i3m.2020.emss.046"},{"key":"1063_CR16","volume":"388","author":"L Rarit\u00e0","year":"2021","unstructured":"Rarit\u00e0 L, Stamova I, Tomasiello S (2021) Numerical schemes and genetic algorithms for the optimal control of a continuous model of supply chains. Appl Math Comput 388:125464","journal-title":"Appl Math Comput"},{"key":"1063_CR17","unstructured":"Sevaux M, S\u00f6rensen K et al (2008) Hamiltonian paths in large clustered routing problems. In: Proc. EU\/MEeting 2008 workshop metaheuristics logist. Veh. Routing, EU\/ME, vol 8, pp 411\u2013417"},{"key":"1063_CR18","doi-asserted-by":"publisher","DOI":"10.1137\/1.9780898718515","volume-title":"The vehicle routing problem","author":"P Toth","year":"2002","unstructured":"Toth P, Daniele V (2002) The vehicle routing problem. SIAM, Philadelphia"},{"key":"1063_CR19","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. Comput Oper Res 69:40\u201347. https:\/\/doi.org\/10.1016\/j.cor.2015.11.012","journal-title":"Comput Oper Res"},{"issue":"4","key":"1063_CR20","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\u2013one neighborhood extension. Oper Res 65(4):992\u20131010. https:\/\/doi.org\/10.1287\/opre.2017.1595","journal-title":"Oper Res"},{"key":"1063_CR21","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. Comput Oper Res 140:105643. https:\/\/doi.org\/10.1016\/j.cor.2021.105643","journal-title":"Comput Oper Res"},{"issue":"3","key":"1063_CR22","doi-asserted-by":"publisher","first-page":"611","DOI":"10.1287\/opre.1120.1048","volume":"60","author":"T Vidal","year":"2012","unstructured":"Vidal T et al (2012) A hybrid genetic algorithm for multidepot and periodic vehicle routing problems. Oper Res 60(3):611\u2013624. https:\/\/doi.org\/10.1287\/opre.1120.1048","journal-title":"Oper Res"},{"issue":"3","key":"1063_CR23","doi-asserted-by":"publisher","first-page":"658","DOI":"10.1016\/j.ejor.2013.09.045","volume":"234","author":"T Vidal","year":"2014","unstructured":"Vidal T et al (2014) A unified solution framework for multi-attribute vehicle routing problems. Eur J Oper Res 234(3):658\u2013673. https:\/\/doi.org\/10.1016\/j.ejor.2013.09.045","journal-title":"Eur J Oper Res"},{"key":"1063_CR24","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1016\/j.cor.2014.10.019","volume":"58","author":"T Vidal","year":"2015","unstructured":"Vidal T et al (2015) Hybrid metaheuristics for the clustered vehicle routing problem. Comput Oper Res 58:87\u201399. https:\/\/doi.org\/10.1016\/j.cor.2014.10.019","journal-title":"Comput Oper Res"},{"issue":"2","key":"1063_CR25","doi-asserted-by":"publisher","first-page":"720","DOI":"10.1287\/trsc.2015.0584","volume":"50","author":"T Vidal","year":"2016","unstructured":"Vidal T et al (2016) Large neighborhoods with implicit customer selection for vehicle routing problems with profits. Transp Sci 50(2):720\u2013734. https:\/\/doi.org\/10.1287\/trsc.2015.0584","journal-title":"Transp Sci"},{"issue":"3","key":"1063_CR26","doi-asserted-by":"publisher","first-page":"706","DOI":"10.1287\/trsc.2020.1035","volume":"55","author":"T Vidal","year":"2021","unstructured":"Vidal T et al (2021) Arc routing with time-dependent travel times and paths. Transp Sci 55(3):706\u2013724. https:\/\/doi.org\/10.1287\/trsc.2020.1035","journal-title":"Transp Sci"},{"issue":"4","key":"1063_CR27","doi-asserted-by":"publisher","first-page":"943","DOI":"10.1287\/ijoc.2023.0055","volume":"36","author":"NA Wouda","year":"2024","unstructured":"Wouda NA, Lan L, Kool W (2024) PyVRP: a high-performance VRP solver package. INFORMS J Comput 36(4):943\u2013955","journal-title":"INFORMS J Comput"},{"issue":"3","key":"1063_CR28","doi-asserted-by":"publisher","first-page":"701","DOI":"10.1287\/trsc.2022.1186","volume":"57","author":"Y Zhou","year":"2023","unstructured":"Zhou Y, Kou Y, Zhou MC (2023) Bilevel memetic search approach to the soft-clustered vehicle routing problem. Transp Sci 57(3):701\u2013716. https:\/\/doi.org\/10.1287\/trsc.2022.1186","journal-title":"Transp Sci"}],"container-title":["Evolutionary Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12065-025-01063-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s12065-025-01063-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12065-025-01063-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,9,7]],"date-time":"2025-09-07T00:55:44Z","timestamp":1757206544000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s12065-025-01063-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,7,5]]},"references-count":28,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2025,8]]}},"alternative-id":["1063"],"URL":"https:\/\/doi.org\/10.1007\/s12065-025-01063-5","relation":{},"ISSN":["1864-5909","1864-5917"],"issn-type":[{"value":"1864-5909","type":"print"},{"value":"1864-5917","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,7,5]]},"assertion":[{"value":"27 February 2025","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"18 April 2025","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"11 June 2025","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"5 July 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 statement"}},{"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":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"78"}}