{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,20]],"date-time":"2026-02-20T20:43:46Z","timestamp":1771620226283,"version":"3.50.1"},"reference-count":48,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["European Journal of Operational Research"],"published-print":{"date-parts":[[2026,1]]},"DOI":"10.1016\/j.ejor.2025.05.044","type":"journal-article","created":{"date-parts":[[2025,6,27]],"date-time":"2025-06-27T23:20:21Z","timestamp":1751066421000},"page":"91-104","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":1,"title":["A split-embedded metaheuristic for the heterogeneous inventory routing problem with batch size"],"prefix":"10.1016","volume":"328","author":[{"given":"Diego Perdig\u00e3o","family":"Martino","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6328-9479","authenticated-orcid":false,"given":"Philippe","family":"Lacomme","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6894-7397","authenticated-orcid":false,"given":"Katyanne","family":"Farias","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"issue":"1","key":"10.1016\/j.ejor.2025.05.044_b1","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"},{"key":"10.1016\/j.ejor.2025.05.044_b2","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1016\/j.cor.2014.01.011","article-title":"The production routing problem: A review of formulations and solution algorithms","volume":"55","author":"Adulyasak","year":"2015","journal-title":"Computers & Operations Research"},{"key":"10.1016\/j.ejor.2025.05.044_b3","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1016\/j.omega.2017.10.005","article-title":"Lot sizing problem with multi-mode replenishment and batch delivery","volume":"81","author":"Akbalik","year":"2018","journal-title":"Omega"},{"issue":"2","key":"10.1016\/j.ejor.2025.05.044_b4","doi-asserted-by":"crossref","first-page":"413","DOI":"10.1016\/j.ejor.2014.05.043","article-title":"An adaptive large neighborhood search algorithm for a selective and periodic inventory routing problem","volume":"239","author":"Aksen","year":"2014","journal-title":"European Journal of Operational Research"},{"issue":"2","key":"10.1016\/j.ejor.2025.05.044_b5","doi-asserted-by":"crossref","first-page":"511","DOI":"10.1016\/j.ejor.2019.11.015","article-title":"Formulations, branch-and-cut and a hybrid heuristic algorithm for an inventory routing problem with perishable products","volume":"283","author":"Alvarez","year":"2020","journal-title":"European Journal of Operational Research"},{"issue":"9","key":"10.1016\/j.ejor.2025.05.044_b6","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.05.044_b7","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.05.044_b8","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.05.044_b9","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":"1","key":"10.1016\/j.ejor.2025.05.044_b10","doi-asserted-by":"crossref","first-page":"314","DOI":"10.1016\/j.ejor.2018.01.010","article-title":"Inventory routing with pickups and deliveries","volume":"268","author":"Archetti","year":"2018","journal-title":"European Journal of Operational Research"},{"issue":"3","key":"10.1016\/j.ejor.2025.05.044_b11","doi-asserted-by":"crossref","first-page":"886","DOI":"10.1016\/j.ejor.2019.09.056","article-title":"A branch-and-cut algorithm for the inventory routing problem with pickups and deliveries","volume":"282","author":"Archetti","year":"2020","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/j.ejor.2025.05.044_b12","doi-asserted-by":"crossref","first-page":"124","DOI":"10.1016\/j.cie.2016.12.019","article-title":"A genetic algorithm-Taguchi based approach to inventory routing problem of a single perishable product with transshipment","volume":"104","author":"Azadeh","year":"2017","journal-title":"Computers & Industrial Engineering"},{"issue":"4","key":"10.1016\/j.ejor.2025.05.044_b13","doi-asserted-by":"crossref","first-page":"403","DOI":"10.1016\/0305-0483(83)90033-6","article-title":"Route first\u2014Cluster second methods for vehicle routing","volume":"11","author":"Beasley","year":"1983","journal-title":"Omega"},{"key":"10.1016\/j.ejor.2025.05.044_b14","doi-asserted-by":"crossref","first-page":"524","DOI":"10.1016\/j.tre.2019.01.005","article-title":"A matheuristic algorithm for the multi-depot inventory routing problem","volume":"122","author":"Bertazzi","year":"2019","journal-title":"Transportation Research Part E: Logistics and Transportation Review"},{"key":"10.1016\/j.ejor.2025.05.044_b15","series-title":"Hybrid metaheuristics: 4th international workshop, HM 2007, Dortmund, Germany, October 8\u20139, 2007. Proceedings 4","first-page":"16","article-title":"An effective memetic algorithm with population management for the split delivery vehicle routing problem","author":"Boudia","year":"2007"},{"key":"10.1016\/j.ejor.2025.05.044_b16","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1016\/j.engappai.2015.10.002","article-title":"An ELS-based approach with dynamic probabilities management in local search for the Dial-A-Ride problem","volume":"48","author":"Chassaing","year":"2016","journal-title":"Engineering Applications of Artificial Intelligence"},{"key":"10.1016\/j.ejor.2025.05.044_b17","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1016\/j.tre.2016.11.001","article-title":"Modeling a green inventory routing problem with a heterogeneous fleet","volume":"97","author":"Cheng","year":"2017","journal-title":"Transportation Research Part E: Logistics and Transportation Review"},{"issue":"11","key":"10.1016\/j.ejor.2025.05.044_b18","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"},{"issue":"1","key":"10.1016\/j.ejor.2025.05.044_b19","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":"2013","journal-title":"Transportation Science"},{"issue":"2","key":"10.1016\/j.ejor.2025.05.044_b20","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"},{"issue":"Supplement C","key":"10.1016\/j.ejor.2025.05.044_b21","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":"1","key":"10.1016\/j.ejor.2025.05.044_b22","doi-asserted-by":"crossref","first-page":"80","DOI":"10.1287\/mnsc.6.1.80","article-title":"The truck dispatching problem","volume":"6","author":"Dantzig","year":"1959","journal-title":"Management Science"},{"issue":"3","key":"10.1016\/j.ejor.2025.05.044_b23","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"},{"issue":"2","key":"10.1016\/j.ejor.2025.05.044_b24","doi-asserted-by":"crossref","first-page":"345","DOI":"10.1016\/j.engappai.2011.10.002","article-title":"A hybrid evolutionary local search with depth first search split procedure for the heterogeneous vehicle routing problems","volume":"25","author":"Duhamel","year":"2012","journal-title":"Engineering Applications of Artificial Intelligence"},{"issue":"3","key":"10.1016\/j.ejor.2025.05.044_b25","doi-asserted-by":"crossref","first-page":"617","DOI":"10.1016\/j.cor.2010.08.017","article-title":"A multi-start evolutionary local search for the two-dimensional loading capacitated vehicle routing problem","volume":"38","author":"Duhamel","year":"2011","journal-title":"Computers & Operations Research"},{"key":"10.1016\/j.ejor.2025.05.044_b26","doi-asserted-by":"crossref","first-page":"377","DOI":"10.1007\/s10288-016-0315-1","article-title":"GRASP-based heuristic algorithm for the multi-product multi-vehicle inventory routing problem","volume":"14","author":"Guemri","year":"2016","journal-title":"4OR. A Quarterly Journal of Operations Research"},{"issue":"1","key":"10.1016\/j.ejor.2025.05.044_b27","doi-asserted-by":"crossref","first-page":"156","DOI":"10.1016\/j.ejor.2023.02.024","article-title":"The stochastic inventory routing problem on electric roads","volume":"310","author":"Gutierrez Alcoba","year":"2023","journal-title":"European Journal of Operational Research"},{"issue":"3","key":"10.1016\/j.ejor.2025.05.044_b28","doi-asserted-by":"crossref","first-page":"1014","DOI":"10.1016\/j.ejor.2018.04.017","article-title":"Large neighborhood-based metaheuristic and branch-and-price for the pickup and delivery problem with split loads","volume":"270","author":"Haddad","year":"2018","journal-title":"European Journal of Operational Research"},{"issue":"3","key":"10.1016\/j.ejor.2025.05.044_b29","doi-asserted-by":"crossref","first-page":"775","DOI":"10.1016\/j.ejor.2016.01.060","article-title":"An iterative two-phase hybrid matheuristic for a multi-product short sea inventory-routing problem","volume":"252","author":"Hemmati","year":"2016","journal-title":"European Journal of Operational Research"},{"issue":"1","key":"10.1016\/j.ejor.2025.05.044_b30","doi-asserted-by":"crossref","first-page":"10","DOI":"10.1287\/ijoc.7.1.10","article-title":"A GRASP for the vehicle routing problem with time windows","volume":"7","author":"Kontoravdis","year":"1995","journal-title":"ORSA Journal on Computing"},{"key":"10.1016\/j.ejor.2025.05.044_b31","series-title":"Applications of evolutionary computing, EvoWorkshops 2001: EvoCOP, EvoFlight, EvoIASP, EvoLearn, and EvoSTIM, Como, Italy, April 18\u201320, 2001, Proceedings","first-page":"473","article-title":"A genetic algorithm for the capacitated arc routing problem and its extensions","volume":"Vol. 2037","author":"Lacomme","year":"2001"},{"key":"10.1016\/j.ejor.2025.05.044_b32","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1016\/j.cor.2018.05.023","article-title":"Analysis of an improved branch-and-cut formulation for the inventory-routing problem with transshipment","volume":"98","author":"Lefever","year":"2018","journal-title":"Computers & Operations Research"},{"issue":"4","key":"10.1016\/j.ejor.2025.05.044_b33","doi-asserted-by":"crossref","first-page":"639","DOI":"10.1287\/opre.1040.0121","article-title":"Dynamic lot sizing with batch ordering and truckload discounts","volume":"52","author":"Li","year":"2004","journal-title":"Operations Research"},{"issue":"3","key":"10.1016\/j.ejor.2025.05.044_b34","doi-asserted-by":"crossref","first-page":"870","DOI":"10.1016\/j.ejor.2020.08.047","article-title":"Improved branch-and-cut for the inventory routing problem based on a two-commodity flow formulation","volume":"290","author":"Manousakis","year":"2021","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/j.ejor.2025.05.044_b35","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1016\/j.cor.2018.05.004","article-title":"A decomposition heuristic for a rich production routing problem","volume":"98","author":"Miranda","year":"2018","journal-title":"Computers & Operations Research"},{"key":"10.1016\/j.ejor.2025.05.044_b36","doi-asserted-by":"crossref","first-page":"748","DOI":"10.1016\/j.ijpe.2017.09.002","article-title":"Optimization in inventory-routing problem with planned transshipment: A case study in the retail industry","volume":"193","author":"Peres","year":"2017","journal-title":"International Journal of Production Economics"},{"issue":"4","key":"10.1016\/j.ejor.2025.05.044_b37","doi-asserted-by":"crossref","first-page":"767","DOI":"10.1287\/moor.18.4.767","article-title":"Lot-sizing with constant batches: Formulation and valid inequalities","volume":"18","author":"Pochet","year":"1993","journal-title":"Mathematics of Operations Research"},{"issue":"12","key":"10.1016\/j.ejor.2025.05.044_b38","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"},{"key":"10.1016\/j.ejor.2025.05.044_b39","doi-asserted-by":"crossref","first-page":"179","DOI":"10.1016\/j.trc.2014.01.011","article-title":"Order-first split-second methods for vehicle routing problems: A review","volume":"40","author":"Prins","year":"2014","journal-title":"Transportation Research Part C: Emerging Technologies"},{"key":"10.1016\/j.ejor.2025.05.044_b40","doi-asserted-by":"crossref","first-page":"413","DOI":"10.1007\/s12597-012-0087-0","article-title":"Mixed integer linear programming model for multi-commodity multi-depot inventory routing problem","volume":"49","author":"Ramkumar","year":"2012","journal-title":"Opsearch"},{"issue":"Part A","key":"10.1016\/j.ejor.2025.05.044_b41","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1016\/j.jal.2016.11.010","article-title":"A survey on the inventory-routing problem with stochastic lead times and demands","volume":"24","author":"Rold\u00e1n","year":"2017","journal-title":"Journal of Applied Logic"},{"key":"10.1016\/j.ejor.2025.05.044_b42","article-title":"New benchmark instances for the inventory routing problem","author":"Sk\u00e5lnes","year":"2023","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/j.ejor.2025.05.044_b43","doi-asserted-by":"crossref","first-page":"118","DOI":"10.1016\/j.ijpe.2015.03.008","article-title":"Modeling an inventory routing problem for perishable products with environmental considerations and demand uncertainty","volume":"164","author":"Soysal","year":"2015","journal-title":"International Journal of Production Economics"},{"key":"10.1016\/j.ejor.2025.05.044_b44","doi-asserted-by":"crossref","first-page":"395","DOI":"10.1016\/j.cie.2019.04.026","article-title":"A review on sustainable inventory routing","volume":"132","author":"Soysal","year":"2019","journal-title":"Computers & Industrial Engineering"},{"issue":"3","key":"10.1016\/j.ejor.2025.05.044_b45","doi-asserted-by":"crossref","first-page":"1081","DOI":"10.1016\/j.ejor.2021.09.025","article-title":"An assign-and-route matheuristic for the time-dependent inventory routing problem","volume":"300","author":"Touzout","year":"2022","journal-title":"European Journal of Operational Research"},{"issue":"9","key":"10.1016\/j.ejor.2025.05.044_b46","doi-asserted-by":"crossref","first-page":"1319","DOI":"10.1016\/j.cor.2010.11.011","article-title":"A GRASP with evolutionary path relinking for the truck and trailer routing problem","volume":"38","author":"Villegas","year":"2011","journal-title":"Computers & Operations Research"},{"issue":"9","key":"10.1016\/j.ejor.2025.05.044_b47","doi-asserted-by":"crossref","first-page":"64","DOI":"10.1108\/EUM0000000001286","article-title":"Supplier credit in the economic order quantity model","volume":"11","author":"Wilson","year":"1991","journal-title":"International Journal of Operations & Production Management"},{"key":"10.1016\/j.ejor.2025.05.044_b48","doi-asserted-by":"crossref","first-page":"20","DOI":"10.1016\/j.trb.2015.10.001","article-title":"An evolutionary local search for the capacitated vehicle routing problem minimizing fuel consumption under three-dimensional loading constraints","volume":"82","author":"Zhang","year":"2015","journal-title":"Transportation Research Part B: Methodological"}],"container-title":["European Journal of Operational Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221725004424?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221725004424?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,9,25]],"date-time":"2025-09-25T07:18:50Z","timestamp":1758784730000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0377221725004424"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,1]]},"references-count":48,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2026,1]]}},"alternative-id":["S0377221725004424"],"URL":"https:\/\/doi.org\/10.1016\/j.ejor.2025.05.044","relation":{},"ISSN":["0377-2217"],"issn-type":[{"value":"0377-2217","type":"print"}],"subject":[],"published":{"date-parts":[[2026,1]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"A split-embedded metaheuristic for the heterogeneous inventory routing problem with batch size","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.05.044","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"}]}}