The capacitated arc routing problem with intermediate facilities
β Scribed by Gianpaolo Ghiani; Gennaro Improta; Gilbert Laporte
- Publisher
- John Wiley and Sons
- Year
- 2001
- Tongue
- English
- Weight
- 150 KB
- Volume
- 37
- Category
- Article
- ISSN
- 0028-3045
- DOI
- 10.1002/net.3
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
The aim of this article is to develop an exact algorithm for the asymmetrical capacitated vehicle routing problem, i.e., the multiple traveling salesman problem subject to capacity restrictions. The problem is solved by means of a branch and bound tree in which subproblems are modified assignment pr
## Abstract Vehicle routing problems are at the heart of most decision support systems for realβlife distribution problems. In vehicle routing problem a set of routes must be determined at lowest total cost for a number of resources (i.e., fleet of vehicles) located at one or several points (e.g.,