A branch-and-price algorithm for the Vehicle Routing Problem with Deliveries, Selective Pickups and Time Windows

In the Vehicle Routing Problem with Deliveries, Selective Pickups and Time Windows, the set of customers is the union of delivery customers and pickup customers. A fleet of identical capacitated vehicles based at the depot must perform all deliveries and profitable pickups while respecting time windows. The objective is to minimize routing costs, minus the revenue associated with the pickups. Five variants of the problem are considered according to the order imposed on deliveries and pickups. An exact branch-and-price algorithm is developed for the problem. Computational results are reported for instances containing up to 100 customers.

[1]  Richard F. Hartl,et al.  A survey on pickup and delivery problems , 2008 .

[2]  Giovanni Righini,et al.  A Branch-and-Price Approach to the Vehicle Routing Problem with Simultaneous Distribution and Collection , 2006, Transp. Sci..

[3]  Gilbert Laporte,et al.  Lasso solution strategies for the vehicle routing problem with pickups and deliveries , 2009, Eur. J. Oper. Res..

[4]  Roberto Baldacci,et al.  An exact algorithm for the Traveling Salesman Problem with Deliveries and Collections , 2003, Networks.

[5]  Michel Gendreau,et al.  An exact algorithm for the elementary shortest path problem with resource constraints: Application to some vehicle routing problems , 2004, Networks.

[6]  Natashia Boland,et al.  Accelerated label setting algorithms for the elementary resource constrained shortest path problem , 2006, Oper. Res. Lett..

[7]  Paolo Toth,et al.  VRP with Backhauls , 2002, The Vehicle Routing Problem.

[8]  Haldun Süral,et al.  The single‐vehicle routing problem with unrestricted backhauls , 2003, Networks.

[9]  Roberto Baldacci,et al.  An Exact Method for the Vehicle Routing Problem with Backhauls , 1999, Transp. Sci..

[10]  Giovanni Righini,et al.  Symmetry helps: Bounded bi-directional dynamic programming for the elementary shortest path problem with resource constraints , 2006, Discret. Optim..

[11]  Teodor Gabriel Crainic,et al.  Fleet management and logistics , 1998 .

[12]  Mary E. Kurz.  Heuristics for the Traveling Salesman Problem , 2011 .

[13]  Gilbert Laporte,et al.  Solving a vehicle-routing problem arising in soft-drink distribution , 2006, J. Oper. Res. Soc..

[14]  Gilbert Laporte,et al.  Static pickup and delivery problems: a classification scheme and survey , 2007 .

[15]  M. Wasner,et al.  An integrated multi-depot hub-location vehicle routing model for network planning of parcel service , 2004 .

[16]  Marius M. Solomon,et al.  Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints , 1987, Oper. Res..

[17]  Bruce L. Golden,et al.  The vehicle routing problem : latest advances and new challenges , 2008 .

[18]  Irina Gribkovskaia,et al.  Routing of supply vessels to petroleum installations , 2007 .

[19]  Hokey Min,et al.  The multiple vehicle routing problem with simultaneous delivery and pick-up points , 1989 .

[20]  Gilbert Laporte,et al.  One-to-Many-to-One Single Vehicle Pickup and Delivery Problems , 2008 .

[21]  Jan Dethloff,et al.  Vehicle routing and reverse logistics: The vehicle routing problem with simultaneous delivery and pick-up , 2001, OR Spectr..

[22]  Fermín Alfredo Tang Montané,et al.  A tabu search algorithm for the vehicle routing problem with simultaneous pick-up and delivery service , 2006, Comput. Oper. Res..

[23]  Giovanni Righini,et al.  New dynamic programming algorithms for the resource constrained elementary shortest path problem , 2008, Networks.

[24]  Guy Desaulniers,et al.  Tabu Search, Partial Elementarity, and Generalized k-Path Inequalities for the Vehicle Routing Problem with Time Windows , 2006, Transp. Sci..

[25]  G. Nemhauser,et al.  BRANCH-AND-PRICE: GENERATION FOR SOLVING HUGE INTEGER PROGRAMS , 1998 .

[26]  Paolo Toth,et al.  The Vehicle Routing Problem , 2002, SIAM monographs on discrete mathematics and applications.

[27]  Roberto D. Galvão,et al.  Vehicle Routing Problems with Simultaneous Pick-up and Delivery Service , 2002 .

[28]  Sophie N. Parragh,et al.  A survey on pickup and delivery problems Part I : Transportation between customers and depot , 2007 .

[29]  Jacques Desrosiers,et al.  A Unified Framework for Deterministic Time Constrained Vehicle Routing and Crew Scheduling Problems , 1998 .

[30]  Gilbert Laporte,et al.  The single vehicle routing problem with deliveries and selective pickups , 2008, Comput. Oper. Res..

[31]  Paolo Toth,et al.  An Exact Algorithm for the Vehicle Routing Problem with Backhauls , 1997, Transp. Sci..

[32]  Gabriel Gutiérrez-Jarpa,et al.  A single vehicle routing problem with fixed delivery and optional collections , 2009 .

[33]  J. Desrosiers,et al.  A Primer in Column Generation , 2005 .

[34]  Stefan Irnich,et al.  Shortest Path Problems with Resource Constraints , 2005 .