## 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
β¦ LIBER β¦
A column generation approach for the split delivery vehicle routing problem
β Scribed by Mingzhou Jin; Kai Liu; Burak Eksioglu
- Publisher
- Elsevier Science
- Year
- 2008
- Tongue
- English
- Weight
- 252 KB
- Volume
- 36
- Category
- Article
- ISSN
- 0167-6377
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
A column generation approach for the spl
β
C. Archetti; N. Bianchessi; M. G. Speranza
π
Article
π
2011
π
John Wiley and Sons
π
English
β 151 KB
The split delivery vehicle routing probl
β
Si Chen; Bruce Golden; Edward Wasil
π
Article
π
2007
π
John Wiley and Sons
π
English
β 277 KB
## 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
A new subtour elimination constraint for
β
N.R. Achuthan; L. Caccetta; S.P. Hill
π
Article
π
1996
π
Elsevier Science
π
English
β 747 KB
A TSSP + 1 decomposition strategy for th
β
Charles E. Noon; John Mittenthal; Rekha Pillai
π
Article
π
1994
π
Elsevier Science
π
English
β 880 KB
A set-partitioning-based exact algorithm
β
Yogesh Agarwal; Kamlesh Mathur; Harvey M. Salkin
π
Article
π
1989
π
John Wiley and Sons
π
English
β 899 KB
A tabu search heuristic for the multi-de
β
Jacques Renaud; Gilbert Laporte; Fayez F. Boctor
π
Article
π
1996
π
Elsevier Science
π
English
β 605 KB