The mixed fleet stochastic vehicle routing problem is considered in the paper. It is assumed that operations are performed by vehicles of different types. The model developed is based on the “route first — cluster second” approach. A heuristic algorithm based on space-filling curves is used to produce a giant Travelling Salesman tour. The giant tour is divided into smaller parts using the generalized Floyd algorithm. The final set of routes may be chosen after making a suitable multi-attribute decision making analysis.


    Zugriff

    Zugriff prüfen

    Verfügbarkeit in meiner Bibliothek prüfen

    Bestellung bei Subito €


    Exportieren, teilen und zitieren



    Titel :

    The mixed fleet stochastic vehicle routing problem


    Beteiligte:

    Erschienen in:

    Erscheinungsdatum :

    01.01.1995




    Medientyp :

    Aufsatz (Zeitschrift)


    Format :

    Elektronische Ressource


    Sprache :

    Unbekannt




    THE MIXED FLEET STOCHASTIC VEHICLE ROUTING PROBLEM

    Teodorovic, Dusan | Online Contents | 1995


    The Multi-period Fleet Size and Mix Vehicle Routing Problem with Stochastic Demands

    Pasha, Urooj / Hoff, Arild / Hvattum, Lars Magnus | British Library Conference Proceedings | 2018


    The Multi-period Fleet Size and Mix Vehicle Routing Problem with Stochastic Demands

    Pasha, Urooj / Hoff, Arild / Hvattum, Lars Magnus | Springer Verlag | 2017


    The fleet size and mix vehicle routing problem

    Golden, B. / Assad, A. / Levy, L. et al. | Tema Archiv | 1984


    Research on green vehicle routing problems with mixed fleet

    Liu, Chang / Zhou, Jianqin | SPIE | 2023