An Inventory-Routing Problem with Pickups and Deliveries Arising in the Replenishment of Automated Teller Machines

Roel G. van Anholt (), Leandro C. Coelho (), Gilbert Laporte () and Iris F. A. Vis ()
Additional contact information
Roel G. van Anholt: Faculty of Economics and Business Administration, VU University Amsterdam, 1081 HV Amsterdam, Netherlands
Leandro C. Coelho: CIRRELT and Faculté des sciences de l’administration, Université Laval, Québec, Québec G1V 0A6, Canada
Gilbert Laporte: CIRRELT and Canada Research Chair in Distribution Management, HEC Montréal, Montréal, Québec H3T 2A7, Canada
Iris F. A. Vis: Faculty of Economics and Business, University of Groningen, 9747 AE Groningen, Netherlands

Transportation Science, 2016, vol. 50, issue 3, 1077-1091

Abstract: The purpose of this paper is to introduce, model, and solve a rich multiperiod inventory-routing problem with pickups and deliveries motivated by the replenishment of automated teller machines in the Netherlands. Commodities can be brought to and from the depot, as well as being exchanged among customers to efficiently manage their inventory shortages and surpluses. A single customer can both provide and receive commodities at different periods, since its demand changes dynamically throughout the planning horizon and can be either positive or negative. In the case study, new technology provides these machines with the additional functionality of receiving deposits and reissuing banknotes to subsequent customers. We first formulate the problem as a very large-scale mixed-integer linear programming model. Given the size and complexity of the problem, we first decompose it into several more manageable subproblems by means of a clustering procedure, and we further simplify the subproblems by fixing some variables. The resulting subproblems are strengthened through the generation of valid inequalities and solved by branch and cut. We assess the performance of the proposed solution methodology through extensive computational experiments using real data. The results show that we are able to obtain good lower and upper bounds for this new and challenging practical problem.

Keywords: inventory-routing; vehicle routing; inventory management; pickup and delivery; branch and cut; clustering; exact algorithm; recirculation automated teller machines (search for similar items in EconPapers)
Date: 2016
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (24)

Downloads: (external link)
http://dx.doi.org/10.1287/trsc.2015.0637 (application/pdf)

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:inm:ortrsc:v:50:y:2016:i:3:p:1077-1091

Access Statistics for this article

More articles in Transportation Science from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().