Approximation algorithms for a vehicle routing problem
β Scribed by Sven O. Krumke; Sleman Saliba; Tjark Vredeveld; Stephan Westphal
- Publisher
- Springer
- Year
- 2008
- Tongue
- English
- Weight
- 403 KB
- Volume
- 68
- Category
- Article
- ISSN
- 0340-9422
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
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
This paper deals with two types of the vehicle routing problems (VRP) with transportation centers: the multi-period singleproduct VRP and the single-period multi-product VRP. Mathematical models and the corresponding algorithms are developed on a basis of dynamic programming while combining two-stag