论文信息 - Vehicle routing: historical perspective and recent contributions

Vehicle routing: historical perspective and recent contributions

The vehicle routing problem requires the design of least cost delivery routes through a set of geographically scattered customers and is one of the most widely studied combinatorial optimization problems. We briefly summarize the main historical achievements and review some recent important contributions in this vivid research area.

[1] Gilbert Laporte,et al. A Tabu Search Heuristic for the Vehicle Routing Problem , 1991 .

[2] George B. Dantzig,et al. The Truck Dispatching Problem , 1959 .

[3] Michel Gendreau,et al. A unified solution framework for multi-attribute vehicle routing problems , 2014, Eur. J. Oper. Res..

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

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

[6] G. Clarke,et al. Scheduling of Vehicles from a Central Depot to a Number of Delivery Points , 1964 .

[7] Paolo Toth,et al. The Granular Tabu Search and Its Application to the Vehicle-Routing Problem , 2003, INFORMS J. Comput..

[8] Gilbert Laporte,et al. Two exact algorithms for the distance-constrained vehicle routing problem , 1984, Networks.

[9] Éric D. Taillard,et al. Parallel iterative search methods for vehicle routing problems , 1993, Networks.

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

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

[12] David Pisinger,et al. A general heuristic for vehicle routing problems , 2007, Comput. Oper. Res..