Heuristic programming algorithms which frequently address large problems and require manipulation and operation on massive data sets can be improved by use of efficient data structures. The authors consider heuristic algorithms for vehicle routing, comparing techniques of Clarke and Wright, Gillett and Miller, and Tyagi, and presenting modifications and extensions which permit problems involving hundreds of demand points to be solved in a matter of seconds. A multi-depot routing algorithm is developed. The results are illustrated with a routing study for an urban newspaper with an evening circulation exceeding 100000.
Implementing vehicle routing algorithms
Ausfuehrung von Algorithmen der Fahrzeugleitung
Networks ; 7 , 2 ; 113-148
1972
36 Seiten, 50 Quellen
Aufsatz (Zeitschrift)
Englisch
Implementing vehicle routing models
Elsevier | 1989
|Study of Two Policies for Implementing Routing Algorithms in Satellite Constellations
British Library Conference Proceedings | 2000
|