论文信息 - Vehicle Scheduling Revisited

Vehicle Scheduling Revisited

Several published results for vehicle scheduling algorithms are based on rounded inter-customer distances. This gives overall distances which vary somewhat from actual distances (presented here), and there appears to be a downward bias. Care should be taken in comparing results based on rounded inter-customer distances with those based on real distances.

C. D. J. Waters

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

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

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

[4] I. M. Cheshire,et al. A Dual Heuristic for Vehicle Scheduling , 1982 .

[5] R. H. Mole,et al. A Sequential Route-building Algorithm Employing a Generalised Savings Criterion , 1976 .

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

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

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