{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,31]],"date-time":"2026-03-31T21:53:55Z","timestamp":1774994035725,"version":"3.50.1"},"reference-count":62,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T00:00:00Z","timestamp":1785542400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T00:00:00Z","timestamp":1785542400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T00:00:00Z","timestamp":1785542400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T00:00:00Z","timestamp":1785542400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T00:00:00Z","timestamp":1785542400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T00:00:00Z","timestamp":1785542400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T00:00:00Z","timestamp":1785542400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"funder":[{"DOI":"10.13039\/100023444","name":"Scale AI","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100023444","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100020785","name":"Shenzhen Research Institute of Big Data","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100020785","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["72571234"],"award-info":[{"award-number":["72571234"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["European Journal of Operational Research"],"published-print":{"date-parts":[[2026,8]]},"DOI":"10.1016\/j.ejor.2025.11.021","type":"journal-article","created":{"date-parts":[[2025,11,26]],"date-time":"2025-11-26T00:36:53Z","timestamp":1764117413000},"page":"808-821","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":1,"title":["Large neighborhood and hybrid genetic search for inventory routing problems"],"prefix":"10.1016","volume":"332","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-8648-2319","authenticated-orcid":false,"given":"Jingyi","family":"Zhao","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3524-1600","authenticated-orcid":false,"given":"Claudia","family":"Archetti","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0007-1031-2859","authenticated-orcid":false,"given":"Tuan Anh","family":"Pham","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5183-8485","authenticated-orcid":false,"given":"Thibaut","family":"Vidal","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"issue":"21","key":"10.1016\/j.ejor.2025.11.021_bib0001","doi-asserted-by":"crossref","first-page":"4445","DOI":"10.1080\/00207540600597138","article-title":"A genetic algorithm approach to the integrated inventory-distribution problem","volume":"44","author":"Abdelmaguid","year":"2006","journal-title":"International Journal of Production Research"},{"issue":"1","key":"10.1016\/j.ejor.2025.11.021_bib0002","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1287\/ijoc.2013.0550","article-title":"Formulations and branch-and-cut algorithms for multivehicle production and inventory routing problems","volume":"26","author":"Adulyasak","year":"2014","journal-title":"INFORMS Journal on Computing"},{"issue":"1","key":"10.1016\/j.ejor.2025.11.021_bib0003","doi-asserted-by":"crossref","first-page":"20","DOI":"10.1287\/trsc.1120.0443","article-title":"Optimization-based adaptive large neighborhood search for the production routing problem","volume":"48","author":"Adulyasak","year":"2014","journal-title":"Transportation Science"},{"issue":"1-3","key":"10.1016\/j.ejor.2025.11.021_bib0004","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1016\/S0166-218X(01)00338-9","article-title":"A survey of very large-scale neighborhood search techniques","volume":"123","author":"Ahuja","year":"2002","journal-title":"Discrete Applied Mathematics"},{"issue":"6","key":"10.1016\/j.ejor.2025.11.021_bib0005","doi-asserted-by":"crossref","first-page":"1785","DOI":"10.1111\/itor.12547","article-title":"Iterated local search and simulated annealing algorithms for the inventory routing problem","volume":"25","author":"Alvarez","year":"2018","journal-title":"International Transactions in Operational Research"},{"issue":"9","key":"10.1016\/j.ejor.2025.11.021_bib0006","doi-asserted-by":"crossref","first-page":"1515","DOI":"10.1016\/j.cor.2009.11.009","article-title":"Industrial aspects and literature survey: Combined inventory management and routing","volume":"37","author":"Andersson","year":"2010","journal-title":"Computers & Operations Research"},{"issue":"1","key":"10.1016\/j.ejor.2025.11.021_bib0007","first-page":"1","article-title":"A new bound on the traveling salesman problem","volume":"32","author":"Applegate","year":"2003","journal-title":"SIAM Journal on Computing"},{"issue":"1","key":"10.1016\/j.ejor.2025.11.021_bib0008","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1287\/ijoc.1100.0439","article-title":"A hybrid heuristic for an inventory routing problem","volume":"24","author":"Archetti","year":"2012","journal-title":"INFORMS Journal on Computing"},{"issue":"3","key":"10.1016\/j.ejor.2025.11.021_bib0009","doi-asserted-by":"crossref","first-page":"382","DOI":"10.1287\/trsc.1060.0188","article-title":"A branch-and-cut algorithm for a vendor-managed inventory-routing problem","volume":"41","author":"Archetti","year":"2007","journal-title":"Transportation Science"},{"issue":"3","key":"10.1016\/j.ejor.2025.11.021_bib0010","doi-asserted-by":"crossref","first-page":"353","DOI":"10.1111\/itor.12076","article-title":"Formulations for an inventory routing problem","volume":"21","author":"Archetti","year":"2014","journal-title":"International Transactions in Operational Research"},{"issue":"3","key":"10.1016\/j.ejor.2025.11.021_bib0011","doi-asserted-by":"crossref","first-page":"377","DOI":"10.1287\/ijoc.2016.0737","article-title":"A matheuristic for the multivehicle inventory routing problem","volume":"29","author":"Archetti","year":"2017","journal-title":"INFORMS Journal on Computing"},{"issue":"6","key":"10.1016\/j.ejor.2025.11.021_bib0012","doi-asserted-by":"crossref","first-page":"2984","DOI":"10.1111\/itor.12945","article-title":"A kernel search heuristic for the multivehicle inventory routing problem","volume":"28","author":"Archetti","year":"2021","journal-title":"International Transactions in Operational Research"},{"issue":"3","key":"10.1016\/j.ejor.2025.11.021_bib0013","doi-asserted-by":"crossref","first-page":"997","DOI":"10.1016\/j.ejor.2021.12.051","article-title":"Comparison of formulations for the inventory routing problem","volume":"303","author":"Archetti","year":"2022","journal-title":"European Journal of Operational Research"},{"issue":"1","key":"10.1016\/j.ejor.2025.11.021_bib0014","doi-asserted-by":"crossref","first-page":"56","DOI":"10.1287\/ijoc.13.1.56.9748","article-title":"Linear time dynamic-programming algorithms for new classes of restricted TSPs: A computational study","volume":"13","author":"Balas","year":"2001","journal-title":"INFORMS Journal on Computing"},{"key":"10.1016\/j.ejor.2025.11.021_bib0015","series-title":"Infimal convolution","first-page":"203","author":"Bauschke","year":"2017"},{"issue":"6","key":"10.1016\/j.ejor.2025.11.021_bib0016","doi-asserted-by":"crossref","first-page":"4","DOI":"10.1287\/inte.13.6.4","article-title":"Improving the distribution of industrial gases with an on-line computerized routing and scheduling optimizer","volume":"13","author":"Bell","year":"1983","journal-title":"Interfaces"},{"issue":"1","key":"10.1016\/j.ejor.2025.11.021_bib0017","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1287\/trsc.2022.0342","article-title":"Solving a continent-scale inventory routing problem at renault","volume":"58","author":"Bouvier","year":"2024","journal-title":"Transportation Science"},{"issue":"1","key":"10.1016\/j.ejor.2025.11.021_bib0018","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1287\/trsc.2022.0342","article-title":"Solving a continent-scale inventory routing problem at renault","volume":"58","author":"Bouvier","year":"2024","journal-title":"Transportation Science"},{"issue":"4","key":"10.1016\/j.ejor.2025.11.021_bib0019","doi-asserted-by":"crossref","first-page":"488","DOI":"10.1287\/trsc.1030.0054","article-title":"A decomposition approach for the inventory-routing problem","volume":"38","author":"Campbell","year":"2004","journal-title":"Transportation Science"},{"issue":"4","key":"10.1016\/j.ejor.2025.11.021_bib0020","doi-asserted-by":"crossref","first-page":"667","DOI":"10.1007\/s10732-018-9372-2","article-title":"A study on exponential-size neighborhoods for the bin packing problem with conflicts","volume":"24","author":"Capua","year":"2018","journal-title":"Journal of Heuristics"},{"issue":"4","key":"10.1016\/j.ejor.2025.11.021_bib0021","first-page":"290","article-title":"Solving an integrated logistics problem arising in grocery distribution","volume":"34","author":"Carter","year":"1996","journal-title":"INFOR: Information Systems and Operational Research"},{"issue":"1","key":"10.1016\/j.ejor.2025.11.021_bib0022","doi-asserted-by":"crossref","first-page":"134","DOI":"10.1287\/ijoc.2018.0817","article-title":"A unified decomposition matheuristic for assembly, production, and inventory routing","volume":"31","author":"Chitsaz","year":"2019","journal-title":"INFORMS Journal on Computing"},{"issue":"2","key":"10.1016\/j.ejor.2025.11.021_bib0023","doi-asserted-by":"crossref","first-page":"417","DOI":"10.1287\/trsc.2019.0914","article-title":"Slack induction by string removals for vehicle routing problems","volume":"54","author":"Christiaens","year":"2020","journal-title":"Transportation Science"},{"issue":"1","key":"10.1016\/j.ejor.2025.11.021_bib0024","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1287\/trsc.33.1.3","article-title":"Decomposition of a combined inventory and time constrained ship routing problem","volume":"33","author":"Christiansen","year":"1999","journal-title":"Transportation Science"},{"issue":"1","key":"10.1016\/j.ejor.2025.11.021_bib0025","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1287\/trsc.2013.0472","article-title":"Thirty years of inventory routing","volume":"48","author":"Coelho","year":"2014","journal-title":"Transportation Science"},{"issue":"11","key":"10.1016\/j.ejor.2025.11.021_bib0026","doi-asserted-by":"crossref","first-page":"2537","DOI":"10.1016\/j.cor.2011.12.020","article-title":"The inventory-routing problem with transshipment","volume":"39","author":"Coelho","year":"2012","journal-title":"Computers & Operations Research"},{"key":"10.1016\/j.ejor.2025.11.021_bib0027","doi-asserted-by":"crossref","DOI":"10.1016\/j.tre.2020.102137","article-title":"A variable MIP neighborhood descent for the multi-attribute inventory routing problem","volume":"144","author":"Coelho","year":"2020","journal-title":"Transportation Research Part E: Logistics and Transportation Review"},{"issue":"23\u201324","key":"10.1016\/j.ejor.2025.11.021_bib0028","doi-asserted-by":"crossref","first-page":"7156","DOI":"10.1080\/00207543.2012.757668","article-title":"A branch-and-cut algorithm for the multi-product multi-vehicle inventory-routing problem","volume":"51","author":"Coelho","year":"2013","journal-title":"International Journal of Production Research"},{"issue":"2","key":"10.1016\/j.ejor.2025.11.021_bib0029","doi-asserted-by":"crossref","first-page":"558","DOI":"10.1016\/j.cor.2012.08.012","article-title":"The exact solution of several classes of inventory-routing problems","volume":"40","author":"Coelho","year":"2013","journal-title":"Computers & Operations Research"},{"key":"10.1016\/j.ejor.2025.11.021_bib0030","doi-asserted-by":"crossref","first-page":"391","DOI":"10.1016\/j.ijpe.2013.11.019","article-title":"Improved solutions for inventory-routing problems through valid inequalities and input ordering","volume":"155","author":"Coelho","year":"2014","journal-title":"International Journal of Production Economics"},{"issue":"3","key":"10.1016\/j.ejor.2025.11.021_bib0031","doi-asserted-by":"crossref","first-page":"1060","DOI":"10.1287\/trsc.2015.0635","article-title":"A branch-price-and-cut algorithm for the inventory routing problem","volume":"50","author":"Desaulniers","year":"2016","journal-title":"Transportation Science"},{"key":"10.1016\/j.ejor.2025.11.021_bib0032","doi-asserted-by":"crossref","DOI":"10.1002\/net.22276","article-title":"Matheuristic algorithms for the inventory routing problem with unsplit and split deliveries","author":"Dinh","year":"2025","journal-title":"Networks"},{"key":"10.1016\/j.ejor.2025.11.021_bib0033","series-title":"Combinatorial optimization: 6th international symposium, ISCO 2020, montreal, QC, canada, may 4\u20136, 2020, revised selected papers 6","first-page":"273","article-title":"An efficient matheuristic for the inventory routing problem","author":"Diniz","year":"2020"},{"issue":"11","key":"10.1016\/j.ejor.2025.11.021_bib0034","doi-asserted-by":"crossref","first-page":"3885","DOI":"10.1080\/00207543.2024.2432464","article-title":"Bi-objective inventory routing problem with uncertain demand: A data-driven robust optimisation approach","volume":"63","author":"Feng","year":"2025","journal-title":"International Journal of Production Research"},{"issue":"6","key":"10.1016\/j.ejor.2025.11.021_bib0035","doi-asserted-by":"crossref","first-page":"813","DOI":"10.1287\/opre.1040.0150","article-title":"A periodic inventory routing problem at a supermarket chain","volume":"52","author":"Gaur","year":"2004","journal-title":"Operations Research"},{"key":"10.1016\/j.ejor.2025.11.021_bib0036","unstructured":"Greif, T., Bouvier, L., Flath, C. M., Parmentier, A., Rohmer, S. U., & Vidal, T. (2024). Combinatorial optimization and machine learning for dynamic inventory routing. arXiv preprint arXiv:2402.04463."},{"key":"10.1016\/j.ejor.2025.11.021_bib0037","doi-asserted-by":"crossref","first-page":"220","DOI":"10.1016\/j.cor.2018.07.024","article-title":"The two-echelon multi-depot inventory-routing problem","volume":"101","author":"Guimar\u00e3es","year":"2019","journal-title":"Computers & Operations Research"},{"key":"10.1016\/j.ejor.2025.11.021_bib0038","series-title":"2019\u202fIEEE 15Th international conference on automation science and engineering (CASE)","first-page":"691","article-title":"Simulated annealing for the multi-vehicle cyclic inventory routing problem","author":"Gunawan","year":"2019"},{"issue":"2","key":"10.1016\/j.ejor.2025.11.021_bib0039","doi-asserted-by":"crossref","first-page":"185","DOI":"10.1007\/s12532-021-00209-7","article-title":"Adaptive large neighborhood search for mixed integer programming","volume":"14","author":"Hendel","year":"2022","journal-title":"Mathematical Programming Computation"},{"key":"10.1016\/j.ejor.2025.11.021_bib0040","series-title":"Proceedings of the neurIPS 2022 competitions track","first-page":"35","article-title":"The EURO Meets NeurIPS 2022 vehicle routing competition","volume":"vol. 220","author":"Kool","year":"2022"},{"key":"10.1016\/j.ejor.2025.11.021_bib0041","doi-asserted-by":"crossref","first-page":"22","DOI":"10.1016\/j.cor.2017.03.010","article-title":"A variable MIP neighborhood descent algorithm for managing inventory and distribution of cash in automated teller machines","volume":"85","author":"Larrain","year":"2017","journal-title":"Computers & Operations Research"},{"issue":"2","key":"10.1016\/j.ejor.2025.11.021_bib0042","doi-asserted-by":"crossref","first-page":"498","DOI":"10.1287\/opre.21.2.498","article-title":"An effective heuristic algorithm for the traveling salesman problem","volume":"21","author":"Lin","year":"1973","journal-title":"Operations Research"},{"key":"10.1016\/j.ejor.2025.11.021_bib0043","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.susoc.2021.08.002","article-title":"A modified adaptive genetic algorithm for multi-product multi-period inventory routing problem","volume":"3","author":"Mahjoob","year":"2022","journal-title":"Sustainable Operations and Computers"},{"issue":"2","key":"10.1016\/j.ejor.2025.11.021_bib0044","doi-asserted-by":"crossref","first-page":"351","DOI":"10.5267\/j.uscm.2021.2.007","article-title":"Multi-product multi-vehicle inventory routing problem with vehicle compatibility and site dependency: A case study in the restaurant chain industry","volume":"9","author":"Ohmori","year":"2021","journal-title":"Uncertain Supply Chain Management"},{"issue":"2","key":"10.1016\/j.ejor.2025.11.021_bib0045","doi-asserted-by":"crossref","first-page":"463","DOI":"10.1287\/trsc.2022.1176","article-title":"Exponential-size neighborhoods for the pickup-and-delivery traveling salesman problem","volume":"57","author":"Pacheco","year":"2023","journal-title":"Transportation Science"},{"issue":"12","key":"10.1016\/j.ejor.2025.11.021_bib0046","doi-asserted-by":"crossref","first-page":"1985","DOI":"10.1016\/S0305-0548(03)00158-8","article-title":"A simple and effective evolutionary algorithm for the vehicle routing problem","volume":"31","author":"Prins","year":"2004","journal-title":"Computers & Operations Research"},{"issue":"4","key":"10.1016\/j.ejor.2025.11.021_bib0047","doi-asserted-by":"crossref","first-page":"455","DOI":"10.1287\/trsc.1050.0135","article-title":"An adaptive large neighborhood search heuristic for the pickup and delivery problem with time windows","volume":"40","author":"Ropke","year":"2006","journal-title":"Transportation Science"},{"issue":"3","key":"10.1016\/j.ejor.2025.11.021_bib0048","doi-asserted-by":"crossref","first-page":"421","DOI":"10.1016\/j.jfoodeng.2004.05.073","article-title":"An integrated model of the periodic delivery problems for vending-machine supply chains","volume":"70","author":"Rusdiansyah","year":"2005","journal-title":"Journal of Food Engineering"},{"issue":"3","key":"10.1016\/j.ejor.2025.11.021_bib0049","doi-asserted-by":"crossref","first-page":"992","DOI":"10.1016\/j.ejor.2023.08.010","article-title":"New benchmark instances for the inventory routing problem","volume":"313","author":"Sk\u00e5lnes","year":"2024","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/j.ejor.2025.11.021_bib0050","doi-asserted-by":"crossref","DOI":"10.1016\/j.cor.2023.106353","article-title":"A branch-and-cut embedded matheuristic for the inventory routing problem","volume":"159","author":"Sk\u00e5lnes","year":"2023","journal-title":"Computers & Operations Research"},{"issue":"5","key":"10.1016\/j.ejor.2025.11.021_bib0051","doi-asserted-by":"crossref","first-page":"935","DOI":"10.1287\/opre.41.5.935","article-title":"Cyclic transfer algorithms for multi-vehicle routing and scheduling problems","volume":"41","author":"Thompson","year":"1993","journal-title":"Operations Research"},{"key":"10.1016\/j.ejor.2025.11.021_bib0052","doi-asserted-by":"crossref","first-page":"118","DOI":"10.1016\/j.cor.2018.12.023","article-title":"Heuristics for vehicle routing problems: Sequence or set optimization?","volume":"105","author":"Toffolo","year":"2019","journal-title":"Computers & Operations Research"},{"key":"10.1016\/j.ejor.2025.11.021_bib0053","series-title":"The vehicle routing problem: latest advances and new challenges","first-page":"275","article-title":"An integer linear programming local search for capacitated vehicle routing problems","author":"Toth","year":"2008"},{"key":"10.1016\/j.ejor.2025.11.021_bib0054","doi-asserted-by":"crossref","first-page":"40","DOI":"10.1016\/j.cor.2015.11.012","article-title":"Technical note: Split algorithm in o(n) for the capacitated vehicle routing problem","volume":"69","author":"Vidal","year":"2016","journal-title":"Computers & Operations Research"},{"issue":"4","key":"10.1016\/j.ejor.2025.11.021_bib0055","doi-asserted-by":"crossref","first-page":"992","DOI":"10.1287\/opre.2017.1595","article-title":"Node, edge, arc routing and turn penalties: Multiple problems \u2013 One neighborhood extension","volume":"65","author":"Vidal","year":"2017","journal-title":"Operations Research"},{"key":"10.1016\/j.ejor.2025.11.021_bib0056","doi-asserted-by":"crossref","DOI":"10.1016\/j.cor.2021.105643","article-title":"Hybrid genetic search for the CVRP: Open-source implementation and SWAP* neighborhood","volume":"140","author":"Vidal","year":"2022","journal-title":"Computers & Operations Research"},{"issue":"3","key":"10.1016\/j.ejor.2025.11.021_bib0057","doi-asserted-by":"crossref","first-page":"611","DOI":"10.1287\/opre.1120.1048","article-title":"A hybrid genetic algorithm for multidepot and periodic vehicle routing problems","volume":"60","author":"Vidal","year":"2012","journal-title":"Operations Research"},{"issue":"1","key":"10.1016\/j.ejor.2025.11.021_bib0058","doi-asserted-by":"crossref","first-page":"475","DOI":"10.1016\/j.cor.2012.07.018","article-title":"A hybrid genetic algorithm with adaptive diversity management for a large class of vehicle routing problems with time-windows","volume":"40","author":"Vidal","year":"2013","journal-title":"Computers & Operations Research"},{"issue":"3","key":"10.1016\/j.ejor.2025.11.021_bib0059","doi-asserted-by":"crossref","first-page":"658","DOI":"10.1016\/j.ejor.2013.09.045","article-title":"A unified solution framework for multi-attribute vehicle routing problems","volume":"234","author":"Vidal","year":"2014","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/j.ejor.2025.11.021_bib0060","doi-asserted-by":"crossref","first-page":"401","DOI":"10.1016\/j.ejor.2019.10.010","article-title":"A concise guide to existing and emerging vehicle routing problem variants","volume":"286","author":"Vidal","year":"2020","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/j.ejor.2025.11.021_bib0061","article-title":"A three-stage matheuristic for the blood stochastic inventory routing problem","volume":"200","author":"Vincent","year":"2025","journal-title":"Transportation Research Part E: Logistics and Transportation Review"},{"key":"10.1016\/j.ejor.2025.11.021_bib0062","article-title":"The multi-vehicle cyclic inventory routing problem: Formulation and a metaheuristic approach","volume":"157","author":"Vincent","year":"2021","journal-title":"Computers & Industrial Engineering"}],"container-title":["European Journal of Operational Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221725009300?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221725009300?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,3,31]],"date-time":"2026-03-31T21:13:51Z","timestamp":1774991631000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0377221725009300"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,8]]},"references-count":62,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2026,8]]}},"alternative-id":["S0377221725009300"],"URL":"https:\/\/doi.org\/10.1016\/j.ejor.2025.11.021","relation":{},"ISSN":["0377-2217"],"issn-type":[{"value":"0377-2217","type":"print"}],"subject":[],"published":{"date-parts":[[2026,8]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Large neighborhood and hybrid genetic search for inventory routing problems","name":"articletitle","label":"Article Title"},{"value":"European Journal of Operational Research","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.ejor.2025.11.021","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2025 Elsevier B.V. All rights are reserved, including those for text and data mining, AI training, and similar technologies.","name":"copyright","label":"Copyright"}]}}