- Title
- An analytical bound on the fleet size in vehicle routing problems: a dynamic programming approach
- Creator
- Eshragh, Ali; Esmaeilbeigi, Rasul; Middleton, Richard
- Relation
- ARC.IC140100032 http://purl.org/au-research/grants/arc/IC140100032
- Relation
- Operations Research Letters Vol. 48, Issue 3, p. 350-355
- Publisher Link
- http://dx.doi.org/10.1016/j.orl.2020.04.007
- Publisher
- Elsevier
- Resource Type
- journal article
- Date
- 2020
- Description
- We present an analytical upper bound on the number of required vehicles for vehicle routing problems with split deliveries and any number of capacitated depots. We show that a fleet size greater than the proposed bound is not achievable based on a set of common assumptions. This property of the upper bound is proved through a dynamic programming approach. We also discuss the validity of the bound for a wide variety of routing problems with or without split deliveries.
- Subject
- split delivery; number of vehicles; mltiple depots; dynamic programming
- Identifier
- http://hdl.handle.net/1959.13/1420213
- Identifier
- uon:37551
- Identifier
- ISSN:0167-6377
- Rights
- © 2020. This manuscript version is made available under the CC-BY-NC-ND 4.0 license http://creativecommons.org/licenses/by-nc-nd/4.0/
- Language
- eng
- Full Text
- Reviewed
- Hits: 1539
- Visitors: 1580
- Downloads: 52
| Thumbnail | File | Description | Size | Format | |||
|---|---|---|---|---|---|---|---|
| View Details Download | ATTACHMENT02 | Author final version | 327 KB | Adobe Acrobat PDF | View Details Download |