{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,10]],"date-time":"2026-03-10T01:57:46Z","timestamp":1773107866776,"version":"3.50.1"},"reference-count":28,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2026,2,14]],"date-time":"2026-02-14T00:00:00Z","timestamp":1771027200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,2,14]],"date-time":"2026-02-14T00:00:00Z","timestamp":1771027200000},"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\/501100003407","name":"Ministero dell\u2019Istruzione, 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\/501100003407","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Heuristics"],"published-print":{"date-parts":[[2026,3]]},"DOI":"10.1007\/s10732-026-09584-7","type":"journal-article","created":{"date-parts":[[2026,2,14]],"date-time":"2026-02-14T12:00:22Z","timestamp":1771070422000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A Hybrid Genetic Search for Selective Routing with Overlapping Clusters: A Case Study in Order Picking"],"prefix":"10.1007","volume":"32","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-4644-848X","authenticated-orcid":false,"given":"Vittorio","family":"Latorre","sequence":"first","affiliation":[]},{"given":"Donato","family":"Salvatore","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2026,2,14]]},"reference":[{"issue":"1","key":"9584_CR1","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1111\/itor.12041","volume":"21","author":"HM Afsar","year":"2014","unstructured":"Afsar, H.M., Prins, C., Santos, A.C.: Exact and heuristic algorithms for solving the generalized vehicle routing problem with flexible fleet size. Int. Trans. Oper. Res. 21(1), 153\u2013175 (2014)","journal-title":"Int. Trans. Oper. Res."},{"issue":"1","key":"9584_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.: Exact algorithms for the clustered vehicle routing problem. Oper. Res. 62(1), 58\u201371 (2014). https:\/\/doi.org\/10.1287\/opre.2013.1227","journal-title":"Oper. Res."},{"issue":"4","key":"9584_CR3","doi-asserted-by":"publisher","first-page":"708","DOI":"10.1287\/trsc.2023.0107","volume":"58","author":"L Baty","year":"2024","unstructured":"Baty, L., Jungel, K., Klein, P.S., Parmentier, A., Schiffer, M.: Combinatorial optimization-enriched machine learning to solve the dynamic vehicle routing problem with time windows. Transp. Sci. 58(4), 708\u2013725 (2024)","journal-title":"Transp. Sci."},{"issue":"3","key":"9584_CR4","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.: Formulations and branch-and-cut algorithms for the generalized vehicle routing problem. Transp. Sci. 45(3), 299\u2013316 (2011)","journal-title":"Transp. Sci."},{"issue":"2","key":"9584_CR5","doi-asserted-by":"publisher","first-page":"481","DOI":"10.1016\/j.ejor.2006.07.009","volume":"182","author":"R De Koster","year":"2007","unstructured":"De Koster, R., Le-Duc, T., Roodbergen, K.J.: Design and control of warehouse order picking: A literature review. Eur. J. Oper. Res. 182(2), 481\u2013501 (2007)","journal-title":"Eur. J. Oper. Res."},{"key":"9584_CR6","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.: A fast two-level variable neighborhood search for the clustered vehicle routing problem. Computers & Operations Research 83, 78\u201394 (2017). https:\/\/doi.org\/10.1016\/j.cor.2017.02.007","journal-title":"Computers & Operations Research"},{"key":"9584_CR7","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2024.106762","volume":"170","author":"R D\u2019Haen","year":"2024","unstructured":"D\u2019Haen, R., Ramaekers, K., Archetti, C., Braekers, K.: Integrating order picking and vehicle routing decisions in a dynamic e-commerce setting. Computers & Operations Research 170, 106762 (2024). https:\/\/doi.org\/10.1016\/j.cor.2024.106762","journal-title":"Computers & Operations Research"},{"key":"9584_CR8","doi-asserted-by":"publisher","DOI":"10.1016\/j.tre.2023.103131","volume":"175","author":"J Du","year":"2023","unstructured":"Du, J., Zhang, Z., Wang, X., Lau, H.C.: A hierarchical optimization approach for dynamic pickup and delivery problem with lifo constraints. Transportation Research Part E: Logistics and Transportation Review 175, 103131 (2023). https:\/\/doi.org\/10.1016\/j.tre.2023.103131","journal-title":"Transportation Research Part E: Logistics and Transportation Review"},{"issue":"1","key":"9584_CR9","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.: An efficient transformation of the generalized vehicle routing problem. Eur. J. Oper. Res. 122(1), 11\u201317 (2000)","journal-title":"Eur. J. Oper. Res."},{"key":"9584_CR10","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2020.105132","volume":"129","author":"T Hintsch","year":"2021","unstructured":"Hintsch, T.: Large multiple neighborhood search for the soft-clustered vehicle-routing problem. Computers & Operations Research 129, 105132 (2021). https:\/\/doi.org\/10.1016\/j.cor.2020.105132","journal-title":"Computers & Operations Research"},{"issue":"12","key":"9584_CR11","doi-asserted-by":"publisher","first-page":"1461","DOI":"10.1057\/jors.1996.190","volume":"47","author":"G Laporte","year":"1996","unstructured":"Laporte, G., Asef-Vaziri, A., Sriskandarajah, C.: Some applications of the generalized travelling salesman problem. Journal of the Operational Research Society 47(12), 1461\u20131467 (1996)","journal-title":"Journal of the Operational Research Society"},{"issue":"3","key":"9584_CR12","doi-asserted-by":"publisher","first-page":"1553","DOI":"10.1007\/s00500-025-10507-0","volume":"29","author":"V Latorre","year":"2025","unstructured":"Latorre, V.: A hybrid genetic search based approach for the generalized vehicle routing problem. Soft. Comput. 29(3), 1553\u20131566 (2025)","journal-title":"Soft. Comput."},{"issue":"4","key":"9584_CR13","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s12065-025-01063-5","volume":"18","author":"V Latorre","year":"2025","unstructured":"Latorre, V.: An application of a two-level genetic search for the soft-clustered vehicle routing problem. Evol. Intel. 18(4), 1\u201319 (2025)","journal-title":"Evol. Intel."},{"issue":"3","key":"9584_CR14","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, M.: Bilevel memetic search approach to the soft-clustered vehicle routing problem. Transp. Sci. 57(3), 701\u2013716 (2023). https:\/\/doi.org\/10.1287\/trsc.2022.1186","journal-title":"Transp. Sci."},{"key":"9584_CR15","doi-asserted-by":"publisher","unstructured":"Vidal, T., Battarra, M., Subramanian, A., Erdogan, G.: Hybrid metaheuristics for the clustered vehicle routing problem. Computers & Operations Research 58, 87\u201399 (2015) https:\/\/doi.org\/10.1016\/j.cor.2014.10.019","DOI":"10.1016\/j.cor.2014.10.019"},{"issue":"5","key":"9584_CR16","doi-asserted-by":"publisher","first-page":"771","DOI":"10.3390\/math8050771","volume":"8","author":"C Sabo","year":"2020","unstructured":"Sabo, C., Pop, P.C., Horvat-Marc, A.: On the selective vehicle routing problem. Mathematics 8(5), 771 (2020). https:\/\/doi.org\/10.3390\/math8050771","journal-title":"Mathematics"},{"key":"9584_CR17","doi-asserted-by":"crossref","unstructured":"Baty, L., Jungel, K., Klein, P.S., Parmentier, A., Schiffer, M.: Combinatorial optimization-enriched machine learning to solve the dynamic vehicle routing problem with time windows. Transportation Science 58(4), 708\u2013725 (2024)","DOI":"10.1287\/trsc.2023.0107"},{"key":"9584_CR18","doi-asserted-by":"publisher","DOI":"10.1137\/1.9780898718515","volume-title":"The Vehicle Routing Problem","author":"P Toth","year":"2002","unstructured":"Toth, P., Vigo, D.: The Vehicle Routing Problem. SIAM, Philadelphia (2002)"},{"key":"9584_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.: Split algorithm in o (n) for the capacitated vehicle routing problem. Computers & Operations Research 69, 40\u201347 (2016). https:\/\/doi.org\/10.1016\/j.cor.2015.11.012","journal-title":"Computers & Operations Research"},{"issue":"4","key":"9584_CR20","doi-asserted-by":"publisher","first-page":"992","DOI":"10.1287\/opre.2017.1595","volume":"65","author":"T Vidal","year":"2017","unstructured":"Vidal, T.: Node, edge, arc routing and turn penalties: Multiple problems-one neighborhood extension. Oper. Res. 65(4), 992\u20131010 (2017). https:\/\/doi.org\/10.1287\/opre.2017.1595","journal-title":"Oper. Res."},{"key":"9584_CR21","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2021.105643","volume":"140","author":"T Vidal","year":"2022","unstructured":"Vidal, T.: Hybrid genetic search for the cvrp: Open-source implementation and swap* neighborhood. Computers & Operations Research 140, 105643 (2022). https:\/\/doi.org\/10.1016\/j.cor.2021.105643","journal-title":"Computers & Operations Research"},{"issue":"3","key":"9584_CR22","doi-asserted-by":"publisher","first-page":"611","DOI":"10.1287\/opre.1120.1048","volume":"60","author":"T Vidal","year":"2012","unstructured":"Vidal, T., Crainic, T.G., Gendreau, M., Lahrichi, N., Rei, W.: A hybrid genetic algorithm for multidepot and periodic vehicle routing problems. Oper. Res. 60(3), 611\u2013624 (2012). https:\/\/doi.org\/10.1287\/opre.1120.1048","journal-title":"Oper. Res."},{"issue":"3","key":"9584_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., Crainic, T.G., Gendreau, M., Prins, C.: A unified solution framework for multi-attribute vehicle routing problems. Eur. J. Oper. Res. 234(3), 658\u2013673 (2014). https:\/\/doi.org\/10.1016\/j.ejor.2013.09.045","journal-title":"Eur. J. Oper. Res."},{"key":"9584_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., Battarra, M., Subramanian, A., Erdogan, G.: Hybrid metaheuristics for the clustered vehicle routing problem. Computers & Operations Research 58, 87\u201399 (2015). https:\/\/doi.org\/10.1016\/j.cor.2014.10.019","journal-title":"Computers & Operations Research"},{"issue":"2","key":"9584_CR25","doi-asserted-by":"publisher","first-page":"720","DOI":"10.1287\/trsc.2015.0584","volume":"50","author":"T Vidal","year":"2016","unstructured":"Vidal, T., Maculan, N., Ochi, L.S., Vaz Penna, P.H.: Large neighborhoods with implicit customer selection for vehicle routing problems with profits. Transp. Sci. 50(2), 720\u2013734 (2016). https:\/\/doi.org\/10.1287\/trsc.2015.0584","journal-title":"Transp. Sci."},{"issue":"3","key":"9584_CR26","doi-asserted-by":"publisher","first-page":"706","DOI":"10.1287\/trsc.2020.1035","volume":"55","author":"T Vidal","year":"2021","unstructured":"Vidal, T., Martinelli, R., Pham, T.A., H\u00e0, M.H.: Arc routing with time-dependent travel times and paths. Transp. Sci. 55(3), 706\u2013724 (2021). https:\/\/doi.org\/10.1287\/trsc.2020.1035","journal-title":"Transp. Sci."},{"issue":"4","key":"9584_CR27","doi-asserted-by":"publisher","first-page":"943","DOI":"10.1287\/ijoc.2023.0055","volume":"36","author":"NA Wouda","year":"2024","unstructured":"Wouda, N.A., Lan, L., Kool, W.: Pyvrp: A high-performance vrp solver package. INFORMS J. Comput. 36(4), 943\u2013955 (2024)","journal-title":"INFORMS J. Comput."},{"issue":"3","key":"9584_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, M.: Bilevel memetic search approach to the soft-clustered vehicle routing problem. Transp. Sci. 57(3), 701\u2013716 (2023). https:\/\/doi.org\/10.1287\/trsc.2022.1186","journal-title":"Transp. Sci."}],"container-title":["Journal of Heuristics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10732-026-09584-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10732-026-09584-7","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10732-026-09584-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,9]],"date-time":"2026-03-09T14:21:37Z","timestamp":1773066097000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10732-026-09584-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,2,14]]},"references-count":28,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2026,3]]}},"alternative-id":["9584"],"URL":"https:\/\/doi.org\/10.1007\/s10732-026-09584-7","relation":{},"ISSN":["1381-1231","1572-9397"],"issn-type":[{"value":"1381-1231","type":"print"},{"value":"1572-9397","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,2,14]]},"assertion":[{"value":"9 June 2025","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"1 February 2026","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"3 February 2026","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"14 February 2026","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The author declares that there is 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 approval"}}],"article-number":"8"}}