The vehicle routing problem: An overview of exact and approximate algorithms

In this paper, some of the main known results relative to the Vehicle Routing Problem are surveyed. The paper is organized as follows: (1) definition; (2) exact algorithms; (3) heuristic algorithms; (4) conclusion.

[1]  Eugene L. Lawler,et al.  Traveling Salesman Problem , 2016 .

[2]  Nicos Christofides,et al.  Distribution management : mathematical modelling and practical analysis , 1971 .

[3]  Bill Lampkin,et al.  Computers in transport planning and operation , 1971 .

[4]  Nicos Christofides,et al.  The vehicle routing problem , 1976, Revue française d'automatique, informatique, recherche opérationnelle. Recherche opérationnelle.

[5]  David M. Ryan,et al.  An Integer Programming Approach to the Vehicle Scheduling Problem , 1976 .

[6]  G. Laporte.  The traveling salesman problem: An overview of exact and approximate algorithms , 1992 .

[7]  Gilbert Laporte,et al.  An exact algorithm for the asymmetrical capacitated vehicle routing problem , 1986, Networks.

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

[9]  Paolo Toth,et al.  Generalized Assignment Problems , 1992, ISAAC.

[10]  Marvin D. Nelson,et al.  Implementation techniques for the vehicle routing problem , 1985, Comput. Oper. Res..

[11]  P. C. Yellow,et al.  A Computational Modification to the Savings Method of Vehicle Scheduling , 1970 .

[12]  Paolo Toth,et al.  Algorithms and computer implementations , 1990 .

[13]  Thomas L. Magnanti,et al.  Implementing vehicle routing algorithms , 1977, Networks.

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

[15]  Clifford S. Orloff,et al.  Route Constrained Fleet Scheduling , 1976 .

[16]  N. Biggs.  THE TRAVELING SALESMAN PROBLEM A Guided Tour of Combinatorial Optimization , 1986 .

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

[18]  Shen Lin.  Computer solutions of the traveling salesman problem , 1965 .

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

[20]  G. Laporte,et al.  A BRANCH AND BOUND ALGORITHM FOR A CLASS OF ASYMMETRICAL VEHICLE ROUTING PROBLEMS , 1989 .

[21]  J. F. Benders.  Partitioning procedures for solving mixed-variables programming problems , 1962 .

[22]  Jan Karel Lenstra,et al.  A classification scheme for vehicle routing and scheduling problems , 1990 .

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

[24]  Jan Karel Lenstra,et al.  Some Simple Applications of the Travelling Salesman Problem , 1975 .

[25]  M. R. Rao,et al.  Allocation of Transportation Units to Alternative Trips - A Column Generation Scheme with Out-of-Kilter Subproblems , 1968, Oper. Res..

[26]  L. Bodin.  ROUTING AND SCHEDULING OF VEHICLES AND CREWS–THE STATE OF THE ART , 1983 .

[27]  H. Paessens,et al.  The savings algorithm for the vehicle routing problem , 1988 .

[28]  Harvey M. Salkin,et al.  A set-partitioning-based exact algorithm for the vehicle routing problem , 1989, Networks.

[29]  Gilbert Laporte,et al.  Optimal Routing under Capacity and Distance Restrictions , 1985, Oper. Res..

[30]  Bruce L. Golden,et al.  VEHICLE ROUTING: METHODS AND STUDIES , 1988 .

[31]  Anthony Wren,et al.  Computer Scheduling of Vehicles from One or More Depots to a Number of Delivery Points , 1972 .

[32]  Gilbert Laporte,et al.  A Branch and Bound Algorithm for a Class of Asymmetrical Vehicle Routeing Problems , 1992 .

[33]  Martin Desrochers,et al.  A New Optimization Algorithm for the Vehicle Routing Problem with Time Windows , 1990, Oper. Res..

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

[35]  Gilbert Laporte,et al.  New Insertion and Postoptimization Procedures for the Traveling Salesman Problem , 1992, Oper. Res..

[36]  G. Laporte,et al.  Exact Algorithms for the Vehicle Routing Problem , 1987 .

[37]  Charles ReVelle,et al.  Optimal location under time or distance constraints , 1972 .

[38]  T. J. Gaskell,et al.  Bases for Vehicle Fleet Scheduling , 1967 .

[39]  Franco Giannessi.  Surveys in combinatorial optimization: S. MARTELLO, G. LAPORTE, M. MINOUX and C. RIBEIRO (eds.) North-Holland, Amsterdam, 1987, x + 384 pages, Dfl. 175.00 , 1988 .

[40]  Marshall L. Fisher,et al.  A generalized assignment heuristic for vehicle routing , 1981, Networks.

[41]  Billy E. Gillett,et al.  A Heuristic Algorithm for the Vehicle-Dispatch Problem , 1974, Oper. Res..