𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Hierarchical vehicle routing problems

✍ Scribed by A. Marchetti Spaccamela; A. H. G. Rinnooy Kan; L. Stougie

Publisher
John Wiley and Sons
Year
1984
Tongue
English
Weight
697 KB
Volume
14
Category
Article
ISSN
0028-3045

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

The balanced billing cycle vehicle routi
The balanced billing cycle vehicle routing problem
✍ Chris GroΓ«r; Bruce Golden; Edward Wasil πŸ“‚ Article πŸ“… 2009 πŸ› John Wiley and Sons 🌐 English βš– 360 KB

## 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,

Approximation results for min-max path c
Approximation results for min-max path cover problems in vehicle routing
✍ Zhou Xu; Liang Xu; Chung-Lun Li πŸ“‚ Article πŸ“… 2010 πŸ› John Wiley and Sons 🌐 English βš– 410 KB

## Abstract This article studies a min‐max path cover problem, which is to determine a set of paths for __k__ capacitated vehicles to service all the customers in a given weighted graph so that the largest path cost is minimized. The problem has wide applications in vehicle routing, especially when