{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,8]],"date-time":"2026-05-08T00:11:50Z","timestamp":1778199110630,"version":"3.51.4"},"reference-count":150,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[2026,10,1]],"date-time":"2026-10-01T00:00:00Z","timestamp":1790812800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,10,1]],"date-time":"2026-10-01T00:00:00Z","timestamp":1790812800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,10,1]],"date-time":"2026-10-01T00:00:00Z","timestamp":1790812800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2026,10,1]],"date-time":"2026-10-01T00:00:00Z","timestamp":1790812800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2026,10,1]],"date-time":"2026-10-01T00:00:00Z","timestamp":1790812800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2026,10,1]],"date-time":"2026-10-01T00:00:00Z","timestamp":1790812800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,10,1]],"date-time":"2026-10-01T00:00:00Z","timestamp":1790812800000},"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,10]]},"DOI":"10.1016\/j.ejor.2026.04.044","type":"journal-article","created":{"date-parts":[[2026,4,30]],"date-time":"2026-04-30T07:15:36Z","timestamp":1777533336000},"page":"1-22","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"title":["Inventory-routing problems: Review, challenges, and innovations"],"prefix":"10.1016","volume":"334","author":[{"ORCID":"https:\/\/orcid.org\/0009-0000-7287-2762","authenticated-orcid":false,"given":"Ayb\u00fcke","family":"Ek\u015fi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4277-4114","authenticated-orcid":false,"given":"Milad","family":"Elyasi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6127-8223","authenticated-orcid":false,"given":"Stefan","family":"Minner","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4766-2346","authenticated-orcid":false,"given":"Tom Van","family":"Woensel","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Okan \u00d6rsan","family":"\u00d6zener","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9627-4780","authenticated-orcid":false,"given":"Ali","family":"Ekici","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"issue":"4","key":"10.1016\/j.ejor.2026.04.044_b1","doi-asserted-by":"crossref","first-page":"1519","DOI":"10.1016\/j.cie.2008.09.032","article-title":"Heuristic approaches for the inventory-routing problem with backlogging","volume":"56","author":"Abdelmaguid","year":"2009","journal-title":"Computers & Industrial Engineering"},{"issue":"20","key":"10.1016\/j.ejor.2026.04.044_b2","doi-asserted-by":"crossref","first-page":"6187","DOI":"10.1080\/00207543.2021.1987549","article-title":"Solving inventory routing with transshipment and substitution under dynamic and stochastic demands using genetic algorithm and deep reinforcement learning","volume":"60","author":"Achamrah","year":"2022","journal-title":"International Journal of Production Research"},{"issue":"1","key":"10.1016\/j.ejor.2026.04.044_b3","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.2026.04.044_b4","doi-asserted-by":"crossref","first-page":"1048","DOI":"10.1016\/j.ejor.2005.02.008","article-title":"Modeling inventory routing problems in supply chains of high consumption products","volume":"169","author":"Aghezzaf","year":"2006","journal-title":"European Journal of Operational Research"},{"issue":"4","key":"10.1016\/j.ejor.2026.04.044_b5","doi-asserted-by":"crossref","first-page":"297","DOI":"10.1002\/net.21518","article-title":"A maritime inventory routing problem: Discrete time formulations and valid inequalities","volume":"62","author":"Agra","year":"2013","journal-title":"Networks"},{"key":"10.1016\/j.ejor.2026.04.044_b6","doi-asserted-by":"crossref","first-page":"18","DOI":"10.1016\/j.cor.2015.01.008","article-title":"A maritime inventory routing problem with stochastic sailing and port times","volume":"61","author":"Agra","year":"2015","journal-title":"Computers & Operations Research"},{"issue":"3","key":"10.1016\/j.ejor.2026.04.044_b7","doi-asserted-by":"crossref","first-page":"924","DOI":"10.1016\/j.ejor.2013.06.042","article-title":"Hybrid heuristics for a short sea inventory routing problem","volume":"236","author":"Agra","year":"2014","journal-title":"European Journal of Operational Research"},{"issue":"3","key":"10.1016\/j.ejor.2026.04.044_b8","doi-asserted-by":"crossref","first-page":"509","DOI":"10.1287\/trsc.2017.0814","article-title":"Robust optimization for a maritime inventory routing problem","volume":"52","author":"Agra","year":"2018","journal-title":"Transportation Science"},{"issue":"1","key":"10.1016\/j.ejor.2026.04.044_b9","doi-asserted-by":"crossref","first-page":"164","DOI":"10.1016\/j.ejor.2021.04.027","article-title":"Improved models for a single vehicle continuous-time inventory routing problem with pickups and deliveries","volume":"297","author":"Agra","year":"2022","journal-title":"European Journal of Operational Research"},{"issue":"2","key":"10.1016\/j.ejor.2026.04.044_b10","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"},{"key":"10.1016\/j.ejor.2026.04.044_b11","doi-asserted-by":"crossref","DOI":"10.1016\/j.cor.2022.106129","article-title":"A sampling-based matheuristic for the continuous-time stochastic inventory routing problem with time-windows","volume":"152","author":"Alarcon Ortega","year":"2023","journal-title":"Computers & Operations Research"},{"key":"10.1016\/j.ejor.2026.04.044_b12","doi-asserted-by":"crossref","DOI":"10.1016\/j.cor.2023.106503","article-title":"Stochastic inventory routing with dynamic demands and intra-day depletion","volume":"163","author":"Alarcon Ortega","year":"2024","journal-title":"Computers & Operations Research"},{"key":"10.1016\/j.ejor.2026.04.044_b13","doi-asserted-by":"crossref","DOI":"10.1016\/j.swevo.2020.100802","article-title":"An augmented Tabu search algorithm for the green inventory-routing problem with time windows","volume":"60","author":"Alinaghian","year":"2021","journal-title":"Swarm and Evolutionary Computation"},{"issue":"2","key":"10.1016\/j.ejor.2026.04.044_b14","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":"6","key":"10.1016\/j.ejor.2026.04.044_b15","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":"2","key":"10.1016\/j.ejor.2026.04.044_b16","doi-asserted-by":"crossref","first-page":"564","DOI":"10.1080\/00207543.2015.1037024","article-title":"A new decomposition algorithm for a liquefied natural gas inventory routing problem","volume":"54","author":"Andersson","year":"2016","journal-title":"International Journal of Production Research"},{"issue":"2","key":"10.1016\/j.ejor.2026.04.044_b17","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1002\/net.21995","article-title":"Recent challenges in routing and inventory routing: E-commerce and last-mile delivery","volume":"77","author":"Archetti","year":"2021","journal-title":"Networks"},{"issue":"1","key":"10.1016\/j.ejor.2026.04.044_b18","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.2026.04.044_b19","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":"12","key":"10.1016\/j.ejor.2026.04.044_b20","doi-asserted-by":"crossref","first-page":"1731","DOI":"10.1016\/j.cor.2011.03.002","article-title":"Analysis of the maximum level policy in a production-distribution system","volume":"38","author":"Archetti","year":"2011","journal-title":"Computers & Operations Research"},{"issue":"3","key":"10.1016\/j.ejor.2026.04.044_b21","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.2026.04.044_b22","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":"1","key":"10.1016\/j.ejor.2026.04.044_b23","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"},{"key":"10.1016\/j.ejor.2026.04.044_b24","doi-asserted-by":"crossref","first-page":"96","DOI":"10.1016\/j.tre.2019.09.016","article-title":"An exact algorithm for the inventory routing problem with logistic ratio","volume":"131","author":"Archetti","year":"2019","journal-title":"Transportation Research Part E: Logistics and Transportation Review"},{"issue":"3","key":"10.1016\/j.ejor.2026.04.044_b25","doi-asserted-by":"crossref","first-page":"393","DOI":"10.1111\/itor.12226","article-title":"The inventory routing problem: The value of integration","volume":"23","author":"Archetti","year":"2016","journal-title":"International Transactions in Operational Research"},{"issue":"3","key":"10.1016\/j.ejor.2026.04.044_b26","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"},{"issue":"3","key":"10.1016\/j.ejor.2026.04.044_b27","doi-asserted-by":"crossref","first-page":"497","DOI":"10.1287\/trsc.2016.0729","article-title":"Single-period cutting planes for inventory routing problems","volume":"52","author":"Avella","year":"2017","journal-title":"Transportation Science"},{"key":"10.1016\/j.ejor.2026.04.044_b28","doi-asserted-by":"crossref","DOI":"10.1016\/j.tre.2025.104491","article-title":"Inventory routing with heterogeneous vehicles and hazardous material backhauling","volume":"205","author":"Avishan","year":"2026","journal-title":"Transportation Research Part E: Logistics and Transportation Review"},{"key":"10.1016\/j.ejor.2026.04.044_b29","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":"2","key":"10.1016\/j.ejor.2026.04.044_b30","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1287\/trsc.32.2.189","article-title":"A decomposition approach to the inventory routing problem with satellite facilities","volume":"32","author":"Bard","year":"1998","journal-title":"Transportation Science"},{"issue":"3","key":"10.1016\/j.ejor.2026.04.044_b31","doi-asserted-by":"crossref","first-page":"713","DOI":"10.1016\/j.cie.2009.01.020","article-title":"Heuristics for a multiperiod inventory routing problem with production decisions","volume":"57","author":"Bard","year":"2009","journal-title":"Computers & Industrial Engineering"},{"issue":"12","key":"10.1016\/j.ejor.2026.04.044_b32","doi-asserted-by":"crossref","first-page":"2202","DOI":"10.1016\/j.cor.2010.03.010","article-title":"A branch-and-price algorithm for an integrated production and inventory routing problem","volume":"37","author":"Bard","year":"2010","journal-title":"Computers & Operations Research"},{"issue":"2","key":"10.1016\/j.ejor.2026.04.044_b33","doi-asserted-by":"crossref","first-page":"192","DOI":"10.1287\/trsc.35.2.192.10134","article-title":"Deliveries in an inventory\/routing problem using stochastic dynamic programming","volume":"35","author":"Berman","year":"2001","journal-title":"Transportation Science"},{"key":"10.1016\/j.ejor.2026.04.044_b34","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1016\/j.trc.2011.06.003","article-title":"A stochastic inventory routing problem with stock-out","volume":"27","author":"Bertazzi","year":"2013","journal-title":"Transportation Research Part C: Emerging Technologies"},{"key":"10.1016\/j.ejor.2026.04.044_b35","doi-asserted-by":"crossref","first-page":"112","DOI":"10.1016\/j.omega.2014.09.010","article-title":"Managing stochastic demand in an inventory routing problem with transportation procurement","volume":"56","author":"Bertazzi","year":"2015","journal-title":"Omega"},{"key":"10.1016\/j.ejor.2026.04.044_b36","doi-asserted-by":"crossref","DOI":"10.1016\/j.trc.2024.104892","article-title":"Online algorithms for the multi-vehicle inventory-routing problem with real-time demands","volume":"170","author":"Bertazzi","year":"2025","journal-title":"Transportation Research Part C: Emerging Technologies"},{"key":"10.1016\/j.ejor.2026.04.044_b37","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"},{"issue":"1","key":"10.1016\/j.ejor.2026.04.044_b38","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1287\/trsc.36.1.119.573","article-title":"Deterministic order-up-to level policies in an inventory routing problem","volume":"36","author":"Bertazzi","year":"2002","journal-title":"Transportation Science"},{"issue":"4","key":"10.1016\/j.ejor.2026.04.044_b39","doi-asserted-by":"crossref","first-page":"307","DOI":"10.1007\/s13676-012-0016-7","article-title":"Inventory routing problems: An introduction","volume":"1","author":"Bertazzi","year":"2012","journal-title":"EURO Journal on Transportation and Logistics"},{"issue":"3","key":"10.1016\/j.ejor.2026.04.044_b40","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1007\/s13676-013-0027-z","article-title":"Inventory routing problems with multiple customers","volume":"2","author":"Bertazzi","year":"2013","journal-title":"EURO Journal on Transportation and Logistics"},{"issue":"1","key":"10.1016\/j.ejor.2026.04.044_b41","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.2026.04.044_b42","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"},{"key":"10.1016\/j.ejor.2026.04.044_b43","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1007\/s10479-018-2781-7","article-title":"Humanitarian relief supplies distribution: An application of inventory routing problem","volume":"283","author":"\u00c7ankaya","year":"2019","journal-title":"Annals of Operations Research"},{"key":"10.1016\/j.ejor.2026.04.044_b44","doi-asserted-by":"crossref","DOI":"10.1016\/j.cor.2025.107376","article-title":"A hybrid genetic search for the inventory routing problem","volume":"189","author":"Castro","year":"2026","journal-title":"Computers & Operations Research"},{"issue":"3","key":"10.1016\/j.ejor.2026.04.044_b45","doi-asserted-by":"crossref","first-page":"1117","DOI":"10.1016\/j.ejor.2021.11.056","article-title":"Inventory routing in a warehouse: The storage replenishment routing problem","volume":"301","author":"\u00c7elik","year":"2022","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/j.ejor.2026.04.044_b46","doi-asserted-by":"crossref","DOI":"10.1016\/j.cie.2024.110463","article-title":"A branch-and-price algorithm for the two-echelon inventory-routing problem","volume":"196","author":"Charaf","year":"2024","journal-title":"Computers & Industrial Engineering"},{"key":"10.1016\/j.ejor.2026.04.044_b47","doi-asserted-by":"crossref","DOI":"10.1016\/j.cor.2024.106778","article-title":"A matheuristic for the two-echelon inventory-routing problem","volume":"171","author":"Charaf","year":"2024","journal-title":"Computers & Operations Research"},{"key":"10.1016\/j.ejor.2026.04.044_b48","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1016\/j.ijpe.2016.09.001","article-title":"Multi-period inventory routing problem under carbon emission regulations","volume":"182","author":"Cheng","year":"2016","journal-title":"International Journal of Production Economics"},{"key":"10.1016\/j.ejor.2026.04.044_b49","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":"2","key":"10.1016\/j.ejor.2026.04.044_b50","doi-asserted-by":"crossref","first-page":"410","DOI":"10.1016\/j.ejor.2016.03.056","article-title":"A two-phase algorithm for the cyclic inventory routing problem","volume":"254","author":"Chitsaz","year":"2016","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/j.ejor.2026.04.044_b51","doi-asserted-by":"crossref","DOI":"10.1016\/j.tre.2024.103447","article-title":"Optimizing the long-term costs of an inventory routing problem using linear relaxation","volume":"183","author":"Chiu","year":"2024","journal-title":"Transportation Research Part E: Logistics and Transportation Review"},{"key":"10.1016\/j.ejor.2026.04.044_b52","doi-asserted-by":"crossref","first-page":"270","DOI":"10.1016\/j.trc.2012.03.007","article-title":"Consistency in multi-vehicle inventory-routing","volume":"24","author":"Coelho","year":"2012","journal-title":"Transportation Research Part C: Emerging Technologies"},{"issue":"1","key":"10.1016\/j.ejor.2026.04.044_b53","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"},{"key":"10.1016\/j.ejor.2026.04.044_b54","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.2026.04.044_b55","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.2026.04.044_b56","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.2026.04.044_b57","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"},{"key":"10.1016\/j.ejor.2026.04.044_b58","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1016\/j.cor.2014.06.007","article-title":"A decomposition-based heuristic for the multiple-product inventory-routing problem","volume":"55","author":"Cordeau","year":"2015","journal-title":"Computers & Operations Research"},{"issue":"3","key":"10.1016\/j.ejor.2026.04.044_b59","doi-asserted-by":"crossref","first-page":"526","DOI":"10.1287\/trsc.2017.0799","article-title":"Stochastic inventory routing for perishable products","volume":"52","author":"Crama","year":"2018","journal-title":"Transportation Science"},{"key":"10.1016\/j.ejor.2026.04.044_b60","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1016\/j.ijpe.2018.08.020","article-title":"Trade-offs between environmental and economic performance in production and inventory-routing problems","volume":"217","author":"Darvish","year":"2019","journal-title":"International Journal of Production Economics"},{"issue":"3","key":"10.1016\/j.ejor.2026.04.044_b61","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.2026.04.044_b62","doi-asserted-by":"crossref","first-page":"353","DOI":"10.1287\/trsc.2020.1019","article-title":"The fixed-partition policy inventory routing problem","volume":"55","author":"Diabat","year":"2021","journal-title":"Transportation Science"},{"issue":"3","key":"10.1016\/j.ejor.2026.04.044_b63","doi-asserted-by":"crossref","first-page":"1024","DOI":"10.1016\/j.ejor.2023.07.013","article-title":"On the zero-inventory-ordering policy in the inventory routing problem","volume":"312","author":"Diabat","year":"2024","journal-title":"European Journal of Operational Research"},{"issue":"4","key":"10.1016\/j.ejor.2026.04.044_b64","doi-asserted-by":"crossref","first-page":"400","DOI":"10.1002\/net.22175","article-title":"The inventory routing problem with split deliveries","volume":"82","author":"Dinh","year":"2023","journal-title":"Networks"},{"issue":"4","key":"10.1016\/j.ejor.2026.04.044_b65","doi-asserted-by":"crossref","first-page":"817","DOI":"10.1287\/trsc.2014.0538","article-title":"Cyclic delivery schedules for an inventory routing problem","volume":"49","author":"Ekici","year":"2015","journal-title":"Transportation Science"},{"issue":"6","key":"10.1016\/j.ejor.2026.04.044_b66","doi-asserted-by":"crossref","first-page":"3013","DOI":"10.1111\/itor.13313","article-title":"Maritime inventory routing: Recent trends and future directions","volume":"30","author":"Fagerholt","year":"2023","journal-title":"International Transactions in Operational Research"},{"issue":"10","key":"10.1016\/j.ejor.2026.04.044_b67","doi-asserted-by":"crossref","first-page":"3109","DOI":"10.1080\/00207543.2020.1746428","article-title":"Model and exact solution for a two-echelon inventory routing problem","volume":"59","author":"Farias","year":"2021","journal-title":"International Journal of Production Research"},{"issue":"11","key":"10.1016\/j.ejor.2026.04.044_b68","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"},{"key":"10.1016\/j.ejor.2026.04.044_b69","doi-asserted-by":"crossref","DOI":"10.1016\/j.cor.2021.105520","article-title":"A relax-and-fix and fix-and-optimize algorithm for a maritime inventory routing problem","volume":"137","author":"Friske","year":"2022","journal-title":"Computers & Operations Research"},{"issue":"6","key":"10.1016\/j.ejor.2026.04.044_b70","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.2026.04.044_b71","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1016\/j.trb.2019.05.014","article-title":"A deteriorating inventory routing problem for an inland liquefied natural gas distribution network","volume":"126","author":"Ghiami","year":"2019","journal-title":"Transportation Research Part B: Methodological"},{"key":"10.1016\/j.ejor.2026.04.044_b72","article-title":"A robust optimization approach for the production-inventory-routing problem with simultaneous pickup and delivery","volume":"143","author":"Golsefidi","year":"2020","journal-title":"Computers & Industrial Engineering"},{"issue":"3","key":"10.1016\/j.ejor.2026.04.044_b73","doi-asserted-by":"crossref","first-page":"400","DOI":"10.1287\/trsc.1100.0317","article-title":"A branch-and-price method for a liquefied natural gas inventory routing problem","volume":"44","author":"Gr\u00f8nhaug","year":"2010","journal-title":"Transportation Science"},{"key":"10.1016\/j.ejor.2026.04.044_b74","doi-asserted-by":"crossref","first-page":"278","DOI":"10.1016\/j.cie.2018.06.036","article-title":"Combining variable neighborhood search with simulation for the inventory routing problem with stochastic demands and stock-outs","volume":"123","author":"Gruler","year":"2018","journal-title":"Computers & Industrial Engineering"},{"issue":"1","key":"10.1016\/j.ejor.2026.04.044_b75","doi-asserted-by":"crossref","first-page":"314","DOI":"10.1111\/itor.12540","article-title":"A variable neighborhood search simheuristic for the multiperiod inventory routing problem with stochastic demands","volume":"27","author":"Gruler","year":"2020","journal-title":"International Transactions in Operational Research"},{"key":"10.1016\/j.ejor.2026.04.044_b76","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"},{"issue":"1","key":"10.1016\/j.ejor.2026.04.044_b77","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":"2","key":"10.1016\/j.ejor.2026.04.044_b78","doi-asserted-by":"crossref","first-page":"315","DOI":"10.1287\/trsc.2022.0435","article-title":"Stochastic cyclic inventory routing with supply uncertainty: A case in green-hydrogen logistics","volume":"58","author":"Hasturk","year":"2024","journal-title":"Transportation Science"},{"issue":"5","key":"10.1016\/j.ejor.2026.04.044_b79","doi-asserted-by":"crossref","first-page":"598","DOI":"10.1016\/j.tre.2010.01.006","article-title":"A modified ant colony optimization algorithm for multi-item inventory routing problems with demand uncertainty","volume":"46","author":"Huang","year":"2010","journal-title":"Transportation Research Part E: Logistics and Transportation Review"},{"key":"10.1016\/j.ejor.2026.04.044_b80","doi-asserted-by":"crossref","first-page":"268","DOI":"10.1287\/ijoc.1080.0291","article-title":"Scenario tree-based heuristics for stochastic inventory-routing problems","volume":"21","author":"Hvattum","year":"2009","journal-title":"INFORMS Journal on Computing"},{"issue":"3","key":"10.1016\/j.ejor.2026.04.044_b81","doi-asserted-by":"crossref","first-page":"292","DOI":"10.1287\/trsc.36.3.292.7829","article-title":"Delivery cost approximations for inventory routing problems in a rolling horizon framework","volume":"36","author":"Jaillet","year":"2002","journal-title":"Transportation Science"},{"key":"10.1016\/j.ejor.2026.04.044_b82","doi-asserted-by":"crossref","DOI":"10.1016\/j.ijpe.2025.109652","article-title":"The cyclic inventory routing problem with environmental considerations: Model, solution procedure, and insights","volume":"287","author":"Kajji","year":"2025","journal-title":"International Journal of Production Economics"},{"issue":"2","key":"10.1016\/j.ejor.2026.04.044_b83","doi-asserted-by":"crossref","first-page":"302","DOI":"10.1287\/trsc.2019.0934","article-title":"Heuristic sequence selection for inventory routing problem","volume":"54","author":"Kheiri","year":"2020","journal-title":"Transportation Science"},{"issue":"1","key":"10.1016\/j.ejor.2026.04.044_b84","doi-asserted-by":"crossref","first-page":"94","DOI":"10.1287\/trsc.36.1.94.574","article-title":"The stochastic inventory routing problem with direct deliveries","volume":"36","author":"Kleywegt","year":"2002","journal-title":"Transportation Science"},{"issue":"1","key":"10.1016\/j.ejor.2026.04.044_b85","doi-asserted-by":"crossref","first-page":"42","DOI":"10.1287\/trsc.1030.0041","article-title":"Dynamic programming approximations for a stochastic inventory routing problem","volume":"38","author":"Kleywegt","year":"2004","journal-title":"Transportation Science"},{"key":"10.1016\/j.ejor.2026.04.044_b86","doi-asserted-by":"crossref","DOI":"10.1016\/j.cor.2024.106717","article-title":"An iterated local search matheuristic approach for the multi-vehicle inventory routing problem","volume":"169","author":"Lagan\u00e0","year":"2024","journal-title":"Computers & Operations Research"},{"issue":"2","key":"10.1016\/j.ejor.2026.04.044_b87","doi-asserted-by":"crossref","first-page":"375","DOI":"10.1287\/trsc.2019.0902","article-title":"The continuous-time inventory-routing problem","volume":"54","author":"Lagos","year":"2020","journal-title":"Transportation Science"},{"key":"10.1016\/j.ejor.2026.04.044_b88","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1016\/j.cor.2016.02.010","article-title":"A convex optimization approach for solving the single-vehicle cyclic inventory routing problem","volume":"72","author":"Lefever","year":"2016","journal-title":"Computers & Operations Research"},{"key":"10.1016\/j.ejor.2026.04.044_b89","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":"3","key":"10.1016\/j.ejor.2026.04.044_b90","doi-asserted-by":"crossref","first-page":"936","DOI":"10.1016\/j.ejor.2013.07.034","article-title":"An inventory\u2013routing problem with the objective of travel time minimization","volume":"236","author":"Li","year":"2014","journal-title":"European Journal of Operational Research"},{"issue":"3","key":"10.1016\/j.ejor.2026.04.044_b91","doi-asserted-by":"crossref","first-page":"736","DOI":"10.1016\/j.ejor.2010.10.020","article-title":"A solution approach to the inventory routing problem in a three-level distribution system","volume":"210","author":"Li","year":"2011","journal-title":"European Journal of Operational Research"},{"issue":"1","key":"10.1016\/j.ejor.2026.04.044_b92","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s44176-025-00053-2","article-title":"Enhanced multi-task deep reinforcement learning for the integrated inventory-routing problem under VMI mode","volume":"4","author":"Lu","year":"2025","journal-title":"Management System Engineering"},{"key":"10.1016\/j.ejor.2026.04.044_b93","doi-asserted-by":"crossref","DOI":"10.1016\/j.cor.2026.107383","article-title":"Stochastic dynamic inventory-routing: A comprehensive review","volume":"189","author":"Maia","year":"2026","journal-title":"Computers & Operations Research"},{"key":"10.1016\/j.ejor.2026.04.044_b94","doi-asserted-by":"crossref","DOI":"10.1016\/j.cor.2021.105247","article-title":"Cyclic inventory routing with dynamic safety stocks under recurring non-stationary interdependent demands","volume":"131","author":"Malicki","year":"2021","journal-title":"Computers & Operations Research"},{"issue":"3","key":"10.1016\/j.ejor.2026.04.044_b95","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"},{"issue":"1","key":"10.1016\/j.ejor.2026.04.044_b96","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1016\/j.ejor.2025.05.044","article-title":"A split-embedded metaheuristic for the heterogeneous inventory routing problem with batch size","volume":"328","author":"Martino","year":"2026","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/j.ejor.2026.04.044_b97","doi-asserted-by":"crossref","first-page":"213","DOI":"10.1016\/j.cie.2015.05.010","article-title":"Considering lost sale in inventory routing problems for perishable goods","volume":"87","author":"Mirzaei","year":"2015","journal-title":"Computers & Industrial Engineering"},{"key":"10.1016\/j.ejor.2026.04.044_b98","doi-asserted-by":"crossref","first-page":"291","DOI":"10.1016\/j.cor.2013.06.006","article-title":"A two phase variable neighborhood search for the multi-product inventory routing problem","volume":"52","author":"Mjirda","year":"2014","journal-title":"Computers & Operations Research"},{"issue":"1","key":"10.1016\/j.ejor.2026.04.044_b99","doi-asserted-by":"crossref","first-page":"334","DOI":"10.1016\/j.ijpe.2010.06.012","article-title":"An efficient hybrid genetic algorithm for the multi-product multi-period inventory routing problem","volume":"133","author":"Moin","year":"2011","journal-title":"International Journal of Production Economics"},{"issue":"2","key":"10.1016\/j.ejor.2026.04.044_b100","doi-asserted-by":"crossref","first-page":"382","DOI":"10.1016\/j.ejor.2025.02.007","article-title":"A column generation-based matheuristic for an inventory-routing problem with driver-route consistency","volume":"324","author":"Najy","year":"2025","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/j.ejor.2026.04.044_b101","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1016\/j.cie.2016.04.004","article-title":"CARE: Heuristics for two-stage multi-product inventory routing problems with replenishments","volume":"97","author":"Nambirajan","year":"2016","journal-title":"Computers & Industrial Engineering"},{"key":"10.1016\/j.ejor.2026.04.044_b102","doi-asserted-by":"crossref","DOI":"10.1016\/j.tre.2022.102791","article-title":"The multi-product inventory-routing problem with pickups and deliveries: Mitigating fluctuating demand via rolling horizon heuristics","volume":"164","author":"Neves-Moreira","year":"2022","journal-title":"Transportation Research Part E: Logistics and Transportation Review"},{"key":"10.1016\/j.ejor.2026.04.044_b103","doi-asserted-by":"crossref","first-page":"74","DOI":"10.1016\/j.tre.2015.04.010","article-title":"A multi-objective healthcare inventory routing problem; a fuzzy possibilistic approach","volume":"80","author":"Niakan","year":"2015","journal-title":"Transportation Research Part E: Logistics and Transportation Review"},{"key":"10.1016\/j.ejor.2026.04.044_b104","doi-asserted-by":"crossref","first-page":"358","DOI":"10.1016\/j.cie.2018.12.055","article-title":"Two-stage stochastic programming approach for the medical drug inventory routing problem under uncertainty","volume":"128","author":"Nikzad","year":"2019","journal-title":"Computers & Industrial Engineering"},{"issue":"1","key":"10.1016\/j.ejor.2026.04.044_b105","doi-asserted-by":"crossref","first-page":"82","DOI":"10.1002\/net.21523","article-title":"A stochastic inventory routing problem for infectious medical waste collection","volume":"63","author":"Nolz","year":"2014","journal-title":"Networks"},{"issue":"1","key":"10.1016\/j.ejor.2026.04.044_b106","doi-asserted-by":"crossref","first-page":"112","DOI":"10.1287\/opre.1120.1130","article-title":"Allocating cost of service to customers in inventory routing","volume":"61","author":"\u00d6zener","year":"2013","journal-title":"Operations Research"},{"key":"10.1016\/j.ejor.2026.04.044_b107","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":"1","key":"10.1016\/j.ejor.2026.04.044_b108","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1016\/j.ejor.2025.05.036","article-title":"Robust multi-period blood inventory routing under multiple uncertainties","volume":"328","author":"Qing","year":"2026","journal-title":"European Journal of Operational Research"},{"issue":"2","key":"10.1016\/j.ejor.2026.04.044_b109","doi-asserted-by":"crossref","first-page":"429","DOI":"10.1016\/j.ejor.2007.09.032","article-title":"A practical solution approach for the cyclic inventory routing problem","volume":"192","author":"Raa","year":"2009","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/j.ejor.2026.04.044_b110","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1016\/j.tre.2017.03.001","article-title":"Multi-objective inventory routing problem: A stochastic model to consider profit, service level and green criteria","volume":"101","author":"Rahimi","year":"2017","journal-title":"Transportation Research Part E: Logistics and Transportation Review"},{"issue":"2","key":"10.1016\/j.ejor.2026.04.044_b111","doi-asserted-by":"crossref","first-page":"384","DOI":"10.1287\/trsc.2013.0503","article-title":"A new formulation based on customer delivery patterns for a maritime inventory routing problem","volume":"49","author":"Rakke","year":"2015","journal-title":"Transportation Science"},{"key":"10.1016\/j.ejor.2026.04.044_b112","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1016\/j.tre.2018.10.006","article-title":"Optimization of the multi-objective green cyclical inventory routing problem using discrete multi-swarm PSO method","volume":"120","author":"Rau","year":"2018","journal-title":"Transportation Research Part E: Logistics and Transportation Review"},{"issue":"1","key":"10.1016\/j.ejor.2026.04.044_b113","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1016\/j.ejor.2025.02.032","article-title":"Cyclic stochastic two-echelon inventory routing for an application in medical supply","volume":"325","author":"Rave","year":"2025","journal-title":"European Journal of Operational Research"},{"issue":"3","key":"10.1016\/j.ejor.2026.04.044_b114","doi-asserted-by":"crossref","first-page":"831","DOI":"10.1016\/j.ejor.2019.03.015","article-title":"Comparing techniques for modelling uncertainty in a maritime inventory routing problem","volume":"277","author":"Rodrigues","year":"2019","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/j.ejor.2026.04.044_b115","doi-asserted-by":"crossref","first-page":"156","DOI":"10.1016\/j.cor.2019.03.015","article-title":"A two-echelon inventory routing problem for perishable products","volume":"107","author":"Rohmer","year":"2019","journal-title":"Computers & Operations Research"},{"key":"10.1016\/j.ejor.2026.04.044_b116","doi-asserted-by":"crossref","first-page":"14","DOI":"10.1016\/j.cor.2016.04.004","article-title":"Robustness of inventory replenishment and customer selection policies for the dynamic and stochastic inventory-routing problem","volume":"74","author":"Rold\u00e1n","year":"2016","journal-title":"Computers & Operations Research"},{"key":"10.1016\/j.ejor.2026.04.044_b117","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.2026.04.044_b118","doi-asserted-by":"crossref","DOI":"10.1016\/j.cor.2025.107347","article-title":"A heuristic algorithm based on beam search and iterated local search for the maritime inventory routing problem","volume":"188","author":"Sanghikian","year":"2026","journal-title":"Computers & Operations Research"},{"key":"10.1016\/j.ejor.2026.04.044_b119","doi-asserted-by":"crossref","first-page":"875","DOI":"10.1016\/j.cie.2018.11.026","article-title":"A heuristic method for location-inventory-routing problem in a three-echelon supply chain system","volume":"127","author":"Saragih","year":"2019","journal-title":"Computers & Industrial Engineering"},{"issue":"7","key":"10.1016\/j.ejor.2026.04.044_b120","doi-asserted-by":"crossref","first-page":"2266","DOI":"10.1016\/j.cor.2006.10.020","article-title":"An optimization algorithm for the inventory routing problem with continuous moves","volume":"35","author":"Savelsbergh","year":"2008","journal-title":"Computers & Operations Research"},{"issue":"4","key":"10.1016\/j.ejor.2026.04.044_b121","doi-asserted-by":"crossref","first-page":"687","DOI":"10.1287\/trsc.2022.0261","article-title":"A three-front parallel branch-and-cut algorithm for production and inventory routing problems","volume":"58","author":"Schenekemberg","year":"2023","journal-title":"Transportation Science"},{"key":"10.1016\/j.ejor.2026.04.044_b122","doi-asserted-by":"crossref","DOI":"10.1016\/j.cor.2020.104944","article-title":"The two-echelon inventory-routing problem with fleet management","volume":"121","author":"Schenekemberg","year":"2020","journal-title":"Computers & Operations Research"},{"key":"10.1016\/j.ejor.2026.04.044_b123","doi-asserted-by":"crossref","DOI":"10.1016\/j.cie.2025.111323","article-title":"Optimizing multi-vehicle inventory routing problem for waste collection with overflow-level-dependent service times in bins","volume":"207","author":"Sep\u00falveda-Campos","year":"2025","journal-title":"Computers & Industrial Engineering"},{"key":"10.1016\/j.ejor.2026.04.044_b124","doi-asserted-by":"crossref","DOI":"10.1016\/j.cor.2023.106214","article-title":"A matheuristic for the multi-product maritime inventory routing problem","volume":"154","author":"Shaabani","year":"2023","journal-title":"Computers & Operations Research"},{"key":"10.1016\/j.ejor.2026.04.044_b125","doi-asserted-by":"crossref","DOI":"10.1016\/j.tre.2021.102588","article-title":"The healthcare supply location-inventory-routing problem: A robust approach","volume":"158","author":"Shang","year":"2022","journal-title":"Transportation Research Part E: Logistics and Transportation Review"},{"issue":"1","key":"10.1016\/j.ejor.2026.04.044_b126","doi-asserted-by":"crossref","first-page":"118","DOI":"10.1080\/00207543.2011.653010","article-title":"Genetic-algorithms-based algorithm portfolio for inventory routing problem with stochastic demand","volume":"51","author":"Shukla","year":"2013","journal-title":"International Journal of Production Research"},{"issue":"3","key":"10.1016\/j.ejor.2026.04.044_b127","doi-asserted-by":"crossref","first-page":"1189","DOI":"10.1016\/j.ejor.2022.02.011","article-title":"An improved formulation for the inventory routing problem with time-varying demands","volume":"302","author":"Sk\u00e5lnes","year":"2022","journal-title":"European Journal of Operational Research"},{"issue":"3","key":"10.1016\/j.ejor.2026.04.044_b128","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.2026.04.044_b129","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":"4","key":"10.1016\/j.ejor.2026.04.044_b130","doi-asserted-by":"crossref","first-page":"1044","DOI":"10.1287\/trsc.2021.1123","article-title":"An effective matheuristic for the multivehicle inventory routing problem","volume":"56","author":"Solyal\u0131","year":"2022","journal-title":"Transportation Science"},{"issue":"3","key":"10.1016\/j.ejor.2026.04.044_b131","doi-asserted-by":"crossref","first-page":"657","DOI":"10.1016\/j.cor.2010.10.031","article-title":"A maritime inventory routing problem: Practical approach","volume":"40","author":"Song","year":"2013","journal-title":"Computers & Operations Research"},{"key":"10.1016\/j.ejor.2026.04.044_b132","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1016\/j.trd.2016.07.001","article-title":"Closed-loop inventory routing problem for returnable transport items","volume":"48","author":"Soysal","year":"2016","journal-title":"Transportation Research Part D: Transport and Environment"},{"key":"10.1016\/j.ejor.2026.04.044_b133","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.2026.04.044_b134","doi-asserted-by":"crossref","first-page":"168","DOI":"10.1016\/j.cor.2016.02.003","article-title":"Modeling a green inventory routing problem for perishable products with horizontal collaboration","volume":"89","author":"Soysal","year":"2018","journal-title":"Computers & Operations Research"},{"key":"10.1016\/j.ejor.2026.04.044_b135","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":"1","key":"10.1016\/j.ejor.2026.04.044_b136","doi-asserted-by":"crossref","first-page":"245","DOI":"10.1016\/j.cie.2011.09.011","article-title":"A construction and improvement heuristic for a liquefied natural gas inventory routing problem","volume":"62","author":"St\u00e5lhane","year":"2012","journal-title":"Computers & Industrial Engineering"},{"issue":"2","key":"10.1016\/j.ejor.2026.04.044_b137","doi-asserted-by":"crossref","first-page":"330","DOI":"10.1287\/trsc.2019.0930","article-title":"A matheuristic algorithm for the inventory routing problem","volume":"54","author":"Su","year":"2020","journal-title":"Transportation Science"},{"issue":"3","key":"10.1016\/j.ejor.2026.04.044_b138","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"},{"key":"10.1016\/j.ejor.2026.04.044_b139","doi-asserted-by":"crossref","DOI":"10.1016\/j.cor.2021.105262","article-title":"An iterative matheuristic for the inventory routing problem","volume":"131","author":"Vadseth","year":"2021","journal-title":"Computers & Operations Research"},{"issue":"3","key":"10.1016\/j.ejor.2026.04.044_b140","doi-asserted-by":"crossref","first-page":"1077","DOI":"10.1287\/trsc.2015.0637","article-title":"An inventory-routing problem with pickups and deliveries arising in the replenishment of automated teller machines","volume":"50","author":"Van Anholt","year":"2016","journal-title":"Transportation Science"},{"issue":"3","key":"10.1016\/j.ejor.2026.04.044_b141","doi-asserted-by":"crossref","first-page":"802","DOI":"10.1016\/j.ejor.2014.02.020","article-title":"An iterated local search algorithm for the single-vehicle cyclic inventory routing problem","volume":"237","author":"Vansteenwegen","year":"2014","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/j.ejor.2026.04.044_b142","doi-asserted-by":"crossref","first-page":"593","DOI":"10.1016\/j.ijpe.2013.04.034","article-title":"Mixed integer and heuristics model for the inventory routing problem in fuel delivery","volume":"147","author":"Vidovi\u0107","year":"2014","journal-title":"International Journal of Production Economics"},{"key":"10.1016\/j.ejor.2026.04.044_b143","doi-asserted-by":"crossref","DOI":"10.1016\/j.cor.2024.106883","article-title":"A novel mixed-integer linear programming formulation for continuous-time inventory routing","volume":"174","author":"Wang","year":"2025","journal-title":"Computers & Operations Research"},{"issue":"1","key":"10.1016\/j.ejor.2026.04.044_b144","article-title":"A data-driven and knowledge-driven method towards the IRP of modern logistics","volume":"2021","author":"Wang","year":"2021","journal-title":"Wireless Communications and Mobile Computing"},{"key":"10.1016\/j.ejor.2026.04.044_b145","doi-asserted-by":"crossref","DOI":"10.1016\/j.tre.2025.104297","article-title":"Inventory routing problem of automotive parts considering time-varying demands: A machine learning enhanced branch-and-price approach","volume":"202","author":"Wang","year":"2025","journal-title":"Transportation Research Part E: Logistics and Transportation Review"},{"issue":"3","key":"10.1016\/j.ejor.2026.04.044_b146","doi-asserted-by":"crossref","first-page":"1022","DOI":"10.1016\/j.ejor.2007.02.061","article-title":"A new model and hybrid approach for large scale inventory routing problems","volume":"189","author":"Yu","year":"2008","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/j.ejor.2026.04.044_b147","doi-asserted-by":"crossref","DOI":"10.1016\/j.tre.2025.104143","article-title":"A three-stage matheuristic for the blood stochastic inventory routing problem","volume":"200","author":"Yu","year":"2025","journal-title":"Transportation Research Part E: Logistics and Transportation Review"},{"key":"10.1016\/j.ejor.2026.04.044_b148","first-page":"1","article-title":"Analysis of an automated vehicle routing problem in logistics considering path interruption","volume":"2017","author":"Zhang","year":"2017","journal-title":"Journal of Advanced Transportation"},{"issue":"2","key":"10.1016\/j.ejor.2026.04.044_b149","doi-asserted-by":"crossref","first-page":"786","DOI":"10.1016\/j.ejor.2005.11.030","article-title":"A partition approach to the inventory\/routing problem","volume":"177","author":"Zhao","year":"2007","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/j.ejor.2026.04.044_b150","doi-asserted-by":"crossref","DOI":"10.1016\/j.ijpe.2026.109949","article-title":"The sustainable reverse inventory-routing problem with time windows and simultaneous pickup and delivery","volume":"295","author":"Zormati","year":"2026","journal-title":"International Journal of Production Economics"}],"container-title":["European Journal of Operational Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221726004145?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221726004145?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,5,7]],"date-time":"2026-05-07T23:57:00Z","timestamp":1778198220000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0377221726004145"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,10]]},"references-count":150,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2026,10]]}},"alternative-id":["S0377221726004145"],"URL":"https:\/\/doi.org\/10.1016\/j.ejor.2026.04.044","relation":{},"ISSN":["0377-2217"],"issn-type":[{"value":"0377-2217","type":"print"}],"subject":[],"published":{"date-parts":[[2026,10]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Inventory-routing problems: Review, challenges, and innovations","name":"articletitle","label":"Article Title"},{"value":"European Journal of Operational Research","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.ejor.2026.04.044","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2026 Elsevier B.V. All rights are reserved, including those for text and data mining, AI training, and similar technologies.","name":"copyright","label":"Copyright"}]}}