Journal article
Vehicle minimization for periodic deliveries
European journal of operational research, Vol.165(3), pp.668-684
09/16/2005
DOI: 10.1016/j.ejor.2003.09.036
Abstract
We consider the problem of minimizing the number of vehicles required to make strictly periodic, single destination deliveries to a set of customers, under the initial assumption that each delivery requires the use of a vehicle for a full day. This problem is motivated by inventory routing problems in which customers consume goods at a steady rate. We evaluate the complexity of the problem and discuss its general properties, including problem decomposition. We also present an algorithm that we show is optimal for special cases. Finally, we extend these results to a general version of the problem.
Details
- Title: Subtitle
- Vehicle minimization for periodic deliveries
- Creators
- Ann Melissa Campbell - University of IowaJill R. Hardin - Virginia Commonwealth University
- Resource Type
- Journal article
- Publication Details
- European journal of operational research, Vol.165(3), pp.668-684
- Publisher
- Elsevier B.V
- DOI
- 10.1016/j.ejor.2003.09.036
- ISSN
- 0377-2217
- eISSN
- 1872-6860
- Language
- English
- Date published
- 09/16/2005
- Academic Unit
- Business Analytics
- Record Identifier
- 9984380542402771
Metrics
4 Record Views