论文信息 - Improvements to Vehicle Routeing Heuristics

Improvements to Vehicle Routeing Heuristics

An interactive method for the vehicle routeing problem has been developed, which attempts to refine routes produced by existing methods. Improvements have been found for some of the standard problems, and the new shortest-distance solutions are reported here.

Said Salhi | Graham K. Rand

[1] B. W. Williams. Vehicle Scheduling: Proximity Priority Searching , 1982 .

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

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

[4] C. D. J. Waters. Vehicle Scheduling Revisited , 1984 .

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

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

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

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

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