𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Branch-and-cut algorithms for the split delivery vehicle routing problem

✍ Scribed by Archetti, Claudia; Bianchessi, Nicola; Speranza, M. Grazia

Book ID
122817883
Publisher
Elsevier Science
Year
2014
Tongue
English
Weight
589 KB
Volume
238
Category
Article
ISSN
0377-2217

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

The Vehicle Routing Problem || 3. Branch
The Vehicle Routing Problem || 3. Branch-And-Cut Algorithms for the Capacitated VRP
✍ Toth, Paolo; Vigo, Daniele πŸ“‚ Article πŸ“… 2002 πŸ› Society for Industrial and Applied Mathematics 🌐 English βš– 252 KB

In The Field Of Combinatorial Optimization Problems, The Vehicle Routing Problem (vrp) Is One Of The Most Challenging. Defined More Than 40 Years Ago, The Problem Involves Designing The Optimal Set Of Routes For Fleets Of Vehicles For The Purpose Of Serving A Given Set Of Customers. Interest In Vrp

The split delivery vehicle routing probl
The split delivery vehicle routing problem: Applications, algorithms, test problems, and computational results
✍ 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