A branch-and-price algorithm for the Vehicle Routing Problem with Deliveries, Selective Pickups and Time Windows
Authors:
- Gabriel Gutiérrez-JarpaGGGabriel Gutiérrez-Jarpa
- Guy DesaulniersGDGuy Desaulniers
- Gilbert LaporteGLGilbert Laporte
- Vladimir MarianovVMVladimir Marianov
- 1 October 2010
- journal article
- Published by Elsevier in European Journal of Operational Research
- Vol. 206 (2) , 341-349
Abstract
No abstract availableThis publication has 25 references indexed in Scilit:
- A single vehicle routing problem with fixed delivery and optional collectionsIIE Transactions, 2009
- The single vehicle routing problem with deliveries and selective pickupsComputers & Operations Research, 2008
- New dynamic programming algorithms for the resource constrained elementary shortest path problemNetworks, 2007
- Solving a vehicle-routing problem arising in soft-drink distributionJournal of the Operational Research Society, 2006
- A tabu search algorithm for the vehicle routing problem with simultaneous pick-up and delivery serviceComputers & Operations Research, 2006
- Accelerated label setting algorithms for the elementary resource constrained shortest path problemOperations Research Letters, 2006
- An exact algorithm for the elementary shortest path problem with resource constraints: Application to some vehicle routing problemsNetworks, 2004
- An integrated multi-depot hub-location vehicle routing model for network planning of parcel serviceInternational Journal of Production Economics, 2004
- An exact algorithm for the Traveling Salesman Problem with Deliveries and CollectionsNetworks, 2003
- The single‐vehicle routing problem with unrestricted backhaulsNetworks, 2003