{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,15]],"date-time":"2026-01-15T02:39:44Z","timestamp":1768444784564,"version":"3.49.0"},"reference-count":24,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2021,1,16]],"date-time":"2021-01-16T00:00:00Z","timestamp":1610755200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2021,1,16]],"date-time":"2021-01-16T00:00:00Z","timestamp":1610755200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["SN Oper. Res. Forum"],"published-print":{"date-parts":[[2021,3]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>In the Inventory Routing Problem, customer demand is satisfied from inventory which is replenished with capacitated vehicles. The objective is to minimize total routing and inventory holding cost over a time horizon. If the customers are located relatively close to each other, one has the opportunity to satisfy the demand of a customer by inventory stored at another nearby customer. In the optimization of the customer replenishments, this option can be included to lower total costs. This is for example the case for ATMs in urban areas where an ATM-user that wants to withdraw money could be redirected to another ATM. To the best of our knowledge, the possibility of redirecting end-users is new to the operations research literature and has not been implemented, but is being considered, in the industry. We formulate the Inventory Routing Problem with Demand Moves in which demand of a customer can (partially) be satisfied by the inventory of a nearby customer at a service cost depending on the quantity and the distance. We propose a branch-price-and-cut solution approach which is evaluated on problem instances from the literature. Cost improvements over the classical IRP of up to 10<jats:italic>%<\/jats:italic> are observed with average savings around 3<jats:italic>%<\/jats:italic>.<\/jats:p>","DOI":"10.1007\/s43069-020-00042-z","type":"journal-article","created":{"date-parts":[[2021,1,16]],"date-time":"2021-01-16T02:02:20Z","timestamp":1610762540000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["The Inventory Routing Problem with Demand Moves"],"prefix":"10.1007","volume":"2","author":[{"given":"Annelieke C.","family":"Baller","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0259-0684","authenticated-orcid":false,"given":"Said","family":"Dabia","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Guy","family":"Desaulniers","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wout E. H.","family":"Dullaert","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,1,16]]},"reference":[{"issue":"3","key":"42_CR1","doi-asserted-by":"publisher","first-page":"1060","DOI":"10.1287\/trsc.2015.0635","volume":"50","author":"JG Rakke","year":"2016","unstructured":"Desaulniers. G, Rakke JG, Coelho LC (2016) A branch-price-and-cut algorithm for the inventory-routing problem. Transp. Sci. 50(3):1060\u20131076","journal-title":"Transp. Sci."},{"issue":"3","key":"42_CR2","doi-asserted-by":"publisher","first-page":"1077","DOI":"10.1287\/trsc.2015.0637","volume":"50","author":"RG Van Anholt","year":"2016","unstructured":"Van Anholt RG, Coelho LC, Laporte G, Vis I FA (2016) An inventory-routing problem with pickups and deliveries arising in the replenishment of automated teller machines. Transp. Sci. 50(3):1077\u20131091","journal-title":"Transp. Sci."},{"key":"42_CR3","doi-asserted-by":"publisher","first-page":"22","DOI":"10.1016\/j.cor.2017.03.010","volume":"85","author":"H Larrain","year":"2017","unstructured":"Larrain H, Coelho LC, Cataldo A (2017) A variable MIP neighborhood descent algorithm for managing inventory and distribution of cash in automated teller machines. Computers & Operations Research 85:22\u201331","journal-title":"Computers & Operations Research"},{"issue":"6","key":"42_CR4","doi-asserted-by":"publisher","first-page":"976","DOI":"10.1111\/poms.12593","volume":"26","author":"HN Geismar","year":"2017","unstructured":"Geismar HN, Sriskandarajah C, Zhu Y (2017) A review of operational issues in managing physical currency supply chains. Prod. Oper. Manag. 26 (6):976\u2013996","journal-title":"Prod. Oper. Manag."},{"issue":"11","key":"42_CR5","doi-asserted-by":"publisher","first-page":"2537","DOI":"10.1016\/j.cor.2011.12.020","volume":"39","author":"LC Coelho","year":"2012","unstructured":"Coelho LC, Cordeau J-F, Laporte G (2012) The inventory-routing problem with transshipment. Computers & Operations Research 39(11):2537\u20132548","journal-title":"Computers & Operations Research"},{"issue":"2","key":"42_CR6","doi-asserted-by":"publisher","first-page":"558","DOI":"10.1016\/j.cor.2012.08.012","volume":"40","author":"LC Coelho","year":"2013","unstructured":"Coelho LC, Laporte G (2013) The exact solution of several classes of inventory-routing problems. Computers & Operations Research 40 (2):558\u2013565","journal-title":"Computers & Operations Research"},{"key":"42_CR7","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1016\/j.cor.2018.05.023","volume":"98","author":"W Lefever","year":"2018","unstructured":"Lefever W, Aghezzaf E-H, Hadj-Hamou K, Penz B (2018) Analysis of an improved branch-and-cut formulation for the inventory-routing problem with transshipment. Computers & Operations Research 98:137\u2013148","journal-title":"Computers & Operations Research"},{"issue":"9","key":"42_CR8","doi-asserted-by":"publisher","first-page":"1515","DOI":"10.1016\/j.cor.2009.11.009","volume":"37","author":"H Andersson","year":"2010","unstructured":"Andersson H, Hoff A, Christiansen M, Hasle G, L\u00f8kketangen A (2010) Industrial aspects and literature survey: Combined inventory management and routing. Computers & Operations Research 37(9):1515\u20131536","journal-title":"Computers & Operations Research"},{"issue":"1","key":"42_CR9","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1287\/trsc.2013.0472","volume":"48","author":"LC Coelho","year":"2014","unstructured":"Coelho LC, Cordeau J-F, Laporte G (2014) Thirty years of inventory routing. Transp. Sci. 48(1):1\u201319","journal-title":"Transp. Sci."},{"issue":"3","key":"42_CR10","doi-asserted-by":"publisher","first-page":"353","DOI":"10.1111\/itor.12076","volume":"21","author":"C Archetti","year":"2014","unstructured":"Archetti C, Bianchessi N, Irnich S, Speranza MG (2014) Formulations for an inventory routing problem. Int. Trans. Oper. Res. 21(3):353\u2013374","journal-title":"Int. Trans. Oper. Res."},{"issue":"4","key":"42_CR11","doi-asserted-by":"publisher","first-page":"1519","DOI":"10.1016\/j.cie.2008.09.032","volume":"56","author":"TF Abdelmaguid","year":"2009","unstructured":"Abdelmaguid TF, Dessouky MM, Ord\u00f3\u00f1ez F (2009) Heuristic approaches for the inventory-routing problem with backlogging. Computers & Industrial Engineering 56(4):1519\u20131534","journal-title":"Computers & Industrial Engineering"},{"key":"42_CR12","doi-asserted-by":"crossref","unstructured":"Irnich S, Desaulniers G (2005) Shortest path problems with resource constraints. In: Desaulniers G, Desrosiers J, Solomon MM (eds) Column generation, pp 33\u201365. Springer","DOI":"10.1007\/0-387-25486-2_2"},{"issue":"3","key":"42_CR13","doi-asserted-by":"publisher","first-page":"387","DOI":"10.1287\/trsc.1070.0223","volume":"42","author":"G Desaulniers","year":"2008","unstructured":"Desaulniers G, Lessard F, Hadjar A (2008) Tabu search, partial elementarity, and generalized k-path inequalities for the vehicle routing problem with time windows. Transp. Sci. 42(3):387\u2013404","journal-title":"Transp. Sci."},{"issue":"5","key":"42_CR14","doi-asserted-by":"publisher","first-page":"1269","DOI":"10.1287\/opre.1110.0975","volume":"59","author":"R Baldacci","year":"2011","unstructured":"Baldacci R, Mingozzi A, Roberti R (2011) New route relaxation and pricing strategies for the vehicle routing problem. Oper. Res. 59(5):1269\u20131283","journal-title":"Oper. Res."},{"key":"42_CR15","doi-asserted-by":"crossref","unstructured":"Desaulniers G, Madsen OliBG, Ropke S (2014) The vehicle routing problem with time windows. In: Toth P, Vigo D (eds) Vehicle routing: Problems, methods, and applications, 2nd edition, pp 119\u2013159. MOS-SIAM series on optimization (SIAM, Philadelphia)","DOI":"10.1137\/1.9781611973594.ch5"},{"issue":"3","key":"42_CR16","doi-asserted-by":"publisher","first-page":"382","DOI":"10.1287\/trsc.1060.0188","volume":"41","author":"C Archetti","year":"2007","unstructured":"Archetti C, Bertazzi L, Laporte G, Speranza MG (2007) A Branch-and-Cut algorithm for a vendor-managed inventory-routing problem. Transp. Sci. 41(3):382\u2013391","journal-title":"Transp. Sci."},{"key":"42_CR17","doi-asserted-by":"publisher","first-page":"391","DOI":"10.1016\/j.ijpe.2013.11.019","volume":"155","author":"LC Coelho","year":"2014","unstructured":"Coelho LC, Laporte G (2014) Improved solutions for inventory-routing problems through valid inequalities and input ordering. Int. J. Prod. Econ. 155:391\u2013397","journal-title":"Int. J. Prod. Econ."},{"issue":"1","key":"42_CR18","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1287\/opre.1090.0713","volume":"58","author":"G Desaulniers","year":"2010","unstructured":"Desaulniers G (2010) Branch-and-price-and-cut for the split-delivery vehicle routing problem with time windows. Oper. Res. 58(1):179\u2013192","journal-title":"Oper. Res."},{"issue":"3","key":"42_CR19","doi-asserted-by":"publisher","first-page":"497","DOI":"10.1287\/trsc.2016.0729","volume":"52","author":"P Avella","year":"2018","unstructured":"Avella P, Boccia M, Wolsey LA (2018) Single-period cutting planes for inventory routing problems. Transp. Sci. 52(3):497\u2013508","journal-title":"Transp. Sci."},{"issue":"5","key":"42_CR20","doi-asserted-by":"publisher","first-page":"1050","DOI":"10.1287\/opre.33.5.1050","volume":"33","author":"G Laporte","year":"1985","unstructured":"Laporte G, Nobert Y, Desrochers M (1985) Optimal routing under capacity and distance restrictions. Oper. Res. 33(5):1050\u20131073","journal-title":"Oper. Res."},{"key":"42_CR21","unstructured":"Lysgaard J (2004) Cvrpsep. https:\/\/econ.au.dk\/research\/researcher-websites\/jens-lysgaard\/cvrpsep\/, Accessed: 29 August 2020"},{"issue":"2","key":"42_CR22","doi-asserted-by":"publisher","first-page":"423","DOI":"10.1007\/s10107-003-0481-8","volume":"100","author":"J Lysgaard","year":"2004","unstructured":"Lysgaard J, Letchford AN, Eglese RW (2004) A new branch-and-cut algorithm for the capacitated vehicle routing problem. Math. Program. 100(2):423\u2013445","journal-title":"Math. Program."},{"issue":"3","key":"42_CR23","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1287\/trsc.1100.0363","volume":"45","author":"C Archetti","year":"2011","unstructured":"Archetti C, Bouchard M, Desaulniers G (2011) Enhanced branch and price and cut for vehicle routing with split deliveries and time windows. Transp. Sci. 45(3):285\u2013298","journal-title":"Transp. Sci."},{"key":"42_CR24","unstructured":"Coelho LC (2021) Problem instances inventory routing. http:\/\/www.leandro-coelho.com\/instances\/inventory-routing\/, Accessed: 4 December 2017"}],"container-title":["Operations Research Forum"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s43069-020-00042-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s43069-020-00042-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s43069-020-00042-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,11,18]],"date-time":"2021-11-18T13:21:28Z","timestamp":1637241688000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s43069-020-00042-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,1,16]]},"references-count":24,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2021,3]]}},"alternative-id":["42"],"URL":"https:\/\/doi.org\/10.1007\/s43069-020-00042-z","relation":{},"ISSN":["2662-2556"],"issn-type":[{"value":"2662-2556","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,1,16]]},"assertion":[{"value":"2 April 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"11 November 2020","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"16 January 2021","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Compliance with Ethical Standards"}},{"value":"The authors declare that they have no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"<!--Emphasis Type='Bold' removed-->Conflict of Interest"}}],"article-number":"6"}}