The Inventory Routing Problem with Demand Moves

Annelieke C. Baller (), Said Dabia (), Guy Desaulniers () and Wout E. H. Dullaert ()
Additional contact information
Annelieke C. Baller: Vrije Universiteit Amsterdam
Said Dabia: Vrije Universiteit Amsterdam
Guy Desaulniers: GERAD
Wout E. H. Dullaert: Vrije Universiteit Amsterdam

SN Operations Research Forum, 2021, vol. 2, issue 1, 1-61

Abstract: Abstract 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% are observed with average savings around 3%.

Keywords: Inventory routing problem; Demand moves; Exact methods; Branch-price-and-cut (search for similar items in EconPapers)
Date: 2021
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (3)

Downloads: (external link)
http://link.springer.com/10.1007/s43069-020-00042-z Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:snopef:v:2:y:2021:i:1:d:10.1007_s43069-020-00042-z

Ordering information: This journal article can be ordered from
https://www.springer.com/journal/43069

DOI: 10.1007/s43069-020-00042-z

Access Statistics for this article

SN Operations Research Forum is currently edited by Marco Lübbecke

More articles in SN Operations Research Forum from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().