The single-vehicle routing problem with unrestricted backhauls
✍ Scribed by Haldun Süral; James H. Bookbinder
- Publisher
- John Wiley and Sons
- Year
- 2003
- Tongue
- English
- Weight
- 121 KB
- Volume
- 41
- Category
- Article
- ISSN
- 0028-3045
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
## Abstract Utility companies typically send their meter readers out each day of the billing cycle in order to determine each customer's usage for the period. Customer churn requires the utility company to periodically remove some customer locations from its meter‐reading routes. On the other hand,
This article describes a heuristic and two exact algorithms for several classes of vehicle routing problems defined on tree networks. These include capacitated and time-constrained vehicle routing problems. One of the exact algorithms is based on the computation of bin packing lower bounds. The othe