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.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    The mixed fleet stochastic vehicle routing problem


    Contributors:

    Published in:

    Publication date :

    1995-01-01




    Type of media :

    Article (Journal)


    Type of material :

    Electronic Resource


    Language :

    Unknown




    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 Archive | 1984


    Research on green vehicle routing problems with mixed fleet

    Liu, Chang / Zhou, Jianqin | SPIE | 2023