## 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 ✦
Improved lower bounds for the Split Delivery Vehicle Routing Problem
✍ Scribed by Lorenza Moreno; Marcus Poggi de Aragão; Eduardo Uchoa
- Publisher
- Elsevier Science
- Year
- 2010
- Tongue
- English
- Weight
- 273 KB
- Volume
- 38
- 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
A column generation approach for the spl
✍
Mingzhou Jin; Kai Liu; Burak Eksioglu
📂
Article
📅
2008
🏛
Elsevier Science
🌐
English
⚖ 252 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
New lower bounds for the Capacitated Arc
✍
Wen Lea Pearn
📂
Article
📅
1988
🏛
John Wiley and Sons
🌐
English
⚖ 518 KB
Improved lower bounds for the cycle dete
✍
Eric Allender; Maria M. Klawe
📂
Article
📅
1985
🏛
Elsevier Science
🌐
English
⚖ 353 KB
An improved lower bound for the bin pack
✍
Bintong Chen; Bharatendu Srivastava
📂
Article
📅
1996
🏛
Elsevier Science
🌐
English
⚖ 870 KB