New Exact Algorithms for the Capacitated Vehicle Routing Problem

[1]  M. Balinski,et al.  On an Integer Program for a Delivery Problem , 1964 .

[2]  Marshall L. Fisher,et al.  Optimal Solution of Vehicle Routing Problems Using Minimum K-Trees , 1994, Oper. Res..

[3]  Roberto Roberti,et al.  New Route Relaxation and Pricing Strategies for the Vehicle Routing Problem , 2011, Oper. Res..

[4]  Jacques Desrosiers,et al.  Routing with time windows by column generation , 1983, Networks.

[5]  Stefan Irnich,et al.  The Shortest-Path Problem with Resource Constraints and k-Cycle Elimination for k 3 , 2006, INFORMS J. Comput..

[6]  David Pisinger,et al.  Subset-Row Inequalities Applied to the Vehicle-Routing Problem with Time Windows , 2008, Oper. Res..

[7]  Nicos Christofides,et al.  An exact algorithm for the vehicle routing problem based on the set partitioning formulation with additional cuts , 2008, Math. Program..

[8]  Marcus Poggi de Aragão,et al.  Robust Branch-Cut-and-Price Algorithms for Vehicle Routing Problems , 2008 .

[9]  Adam N. Letchford,et al.  A new branch-and-cut algorithm for the capacitated vehicle routing problem , 2004, Math. Program..

[10]  Paolo Toth,et al.  State-space relaxation procedures for the computation of bounds to routing problems , 1981, Networks.

[11]  Rafael Martinelli,et al.  A new exact algorithm for the multi-depot vehicle routing problem under capacity and route length constraints , 2014, Discret. Optim..

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

[13]  Paolo Toth,et al.  Exact algorithms for the vehicle routing problem, based on spanning tree and shortest path relaxations , 1981, Math. Program..

[14]  Bernard Gendron,et al.  A Branch-And-Cut-And-Price Algorithm for the Capacitated Location Routing Problem , 2009 .

[15]  Stefan Irnich,et al.  Path-Reduced Costs for Eliminating Arcs in Routing and Scheduling , 2010, INFORMS J. Comput..

[16]  Anand Subramanian,et al.  Branch-cut-and-price for the vehicle routing problem with simultaneous pickup and delivery , 2013, Optim. Lett..

[17]  James P. Kelly,et al.  The Impact of Metaheuristics on Solving the Vehicle Routing Problem: Algorithms, Problem Sets, and Computational Results , 1998 .

[18]  Nicos Christofides,et al.  An Algorithm for the Vehicle-dispatching Problem , 1969 .

[19]  G. Laporte,et al.  A branch and bound algorithm for the capacitated vehicle routing problem , 1983 .

[20]  Renato F. Werneck,et al.  Robust Branch-and-Cut-and-Price for the Capacitated Vehicle Routing Problem , 2006, Math. Program..

[21]  Roberto Baldacci,et al.  The multiple disposal facilities and multiple inventory locations rollon-rolloff vehicle routing problem , 2006, Comput. Oper. Res..

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

[23]  Juan José Salazar González,et al.  Projection results for vehicle routing , 2005, Math. Program..

[24]  Pierre Hansen,et al.  Stabilized column generation , 1998, Discret. Math..

[25]  Cid C. de Souza,et al.  Column Generation Algorithms for the Capacitated m-Ring-Star Problem , 2008, CTW.

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

[27]  Ruslan Sadykov,et al.  In-Out Separation and Column Generation Stabilization by Dual Price Smoothing , 2013, SEA.