A Combined Vehicle Routing and Inventory Allocation Problem

Awi Federgruen and Paul Zipkin
Additional contact information
Awi Federgruen: Columbia University, New York, New York
Paul Zipkin: Columbia University, New York, New York

Operations Research, 1984, vol. 32, issue 5, 1019-1037

Abstract: We address the combined problem of allocating a scarce resource among several locations, and planning deliveries using a fleet of vehicles. Demands are random, and holding and shortage costs must be considered in the decision along with transportation costs. We show how to extend some of the available methods for the deterministic vehicle routing problem to this case. Computational results using one such adaptation show that the algorithm is fast enough for practical work, and that substantial cost savings can be achieved with this approach.

Keywords: 331 inventory allocation/VRP; 831 vehicle routing/inventory (search for similar items in EconPapers)
Date: 1984
References: Add references at CitEc
Citations: View citations in EconPapers (74)

Downloads: (external link)
http://dx.doi.org/10.1287/opre.32.5.1019 (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:oropre:v:32:y:1984:i:5:p:1019-1037

Access Statistics for this article

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