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.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    Implementing vehicle routing algorithms


    Additional title:

    Ausfuehrung von Algorithmen der Fahrzeugleitung


    Contributors:

    Published in:

    Networks ; 7 , 2 ; 113-148


    Publication date :

    1972


    Size :

    36 Seiten, 50 Quellen



    Type of media :

    Article (Journal)


    Type of material :

    Print


    Language :

    English




    Implementing vehicle routing models

    Robust≐, Francesc / Daganzo, Carlos F. / Souleyrette, Reginald R. II | Elsevier | 1989



    Study of Two Policies for Implementing Routing Algorithms in Satellite Constellations

    Khamlichi, I. E. / Franck, L. / American Institute of Aeronautics and Astronautics | British Library Conference Proceedings | 2000



    SOLUTION TO VEHICLE ROUTING PROBLEM USING GENETIC ALGORITHMS

    Murthy, Vishnu / Arun Kumar, Manda V / Jaswanth, Kongara et al. | BASE | 2014

    Free access