Research perspectives in vehicle routing and scheduling

Abstract The problem of vehicle routing and scheduling has been a popular research subject, yet much of the research has focused on developing methods that are accurate and computationally efficient but that are generally of limited scope. This article classifies these methodologies and appraises each class. Perhaps more important, the article identifies those restrictions and extensions that should be incorporated into a generalized vehicle routing and scheduling methodology and, therefore, points the direction for future research.

[1]  Lawrence Bodin,et al.  Classification in vehicle routing and scheduling , 1981, Networks.

[2]  Wendell M. Stewart Physical Distribution: Key to Improved Volume and Profits , 1965 .

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

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

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

[6]  C. Loren Doll Quick and Dirty Vehicle Routing Procedure , 1980 .

[7]  Thomas L. Magnanti,et al.  Combinatorial optimization and vehicle fleet planning: Perspectives and prospects , 1981, Networks.

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

[9]  Richard C. Christian,et al.  Industrial Marketing: Physical Distribution: Key to Improved Volume and Profits , 1965 .

[10]  Jr. William Royce Stewart New algorithms for deterministic and stochastic vehicle routing problems , 1981 .

[11]  R. H. Mole,et al.  A Survey of Local Delivery Vehicle Routing Methodology , 1979 .

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

[13]  Ronald H. Ballou,et al.  MSVS: AN EXTENDED COMPUTER MODEL FOR TRANSPORT MODE SELECTION , 1980 .

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

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

[16]  H. D. Ratliff,et al.  Set partitioning based heuristics for interactive routing , 1981, Networks.

[17]  Lawrence Bodin,et al.  PLANNING FOR TRUCK FLEET SIZE IN THE PRESENCE OF A COMMON‐CARRIER OPTION , 1983 .

[18]  Brian W. Kernighan,et al.  An Effective Heuristic Algorithm for the Traveling-Salesman Problem , 1973, Oper. Res..