Journal article
The vehicle routing problem with demand range
Annals of operations research, Vol.144(1), pp.99-110
04/01/2006
DOI: 10.1007/s10479-006-0057-0
Abstract
We propose and formulate the vehicle routing problem with demand range (VRPDR), a new variation on the traditional vehicle routing problem. In the VRPDR, the delivery quantity for each customer i is allowed to vary from its original size d(i) by an amount alpha d(i) where 0 <= alpha < 1. In adding this limited flexibility to the problem, there is potential to generate significant savings in the total distance traveled. We address issues such as bounding the impact of a given alpha on total distance and provide empirical results to illustrate "typical" behavior.
Details
- Title: Subtitle
- The vehicle routing problem with demand range
- Creators
- Ann Melissa Campbell - University of Iowa
- Resource Type
- Journal article
- Publication Details
- Annals of operations research, Vol.144(1), pp.99-110
- Publisher
- Springer Nature
- DOI
- 10.1007/s10479-006-0057-0
- ISSN
- 0254-5330
- eISSN
- 1572-9338
- Number of pages
- 12
- Language
- English
- Date published
- 04/01/2006
- Academic Unit
- Business Analytics
- Record Identifier
- 9984380382502771
Metrics
10 Record Views