The split delivery vehicle routing problem with minimum delivery amounts
β Scribed by Damon Gulczynski; Bruce Golden; Edward Wasil
- Book ID
- 116938030
- Publisher
- Elsevier Science
- Year
- 2010
- Tongue
- English
- Weight
- 375 KB
- Volume
- 46
- Category
- Article
- ISSN
- 1366-5545
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
## Abstract In this article we present a branchβandβpriceβandβcut method for the solution of the split delivery vehicle routing problem (SDVRP). The SDVRP is the problem to serve customers with a fleet of capacitated vehicles at minimum traveling cost. With respect to the classical vehicle routing
## Abstract In the split delivery vehicle routing problem (SDVRP), a customer's demand can be split among several vehicles. In this article, we review applications of the SDVRP including the routing of helicopters in the North Sea and solution methods such as integer programming and tabu search. We