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.


    Zugriff

    Zugriff prüfen

    Verfügbarkeit in meiner Bibliothek prüfen

    Bestellung bei Subito €


    Exportieren, teilen und zitieren



    Titel :

    Implementing vehicle routing algorithms


    Weitere Titelangaben:

    Ausfuehrung von Algorithmen der Fahrzeugleitung


    Beteiligte:
    Golden, B.L. (Autor:in) / Magnanti, T.L. (Autor:in) / Nguyan, H.Q. (Autor:in)

    Erschienen in:

    Networks ; 7 , 2 ; 113-148


    Erscheinungsdatum :

    1972


    Format / Umfang :

    36 Seiten, 50 Quellen



    Medientyp :

    Aufsatz (Zeitschrift)


    Format :

    Print


    Sprache :

    Englisch




    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

    Freier Zugriff

    An auction for collaborative vehicle routing: models and algorithms

    Karels, Vincent / Veelenturf, Luuk P. / van Woensel, Tom | BASE | 2020

    Freier Zugriff