The authors address the problem of routing a fleet of vehicles from a central depot to customers with known demand. Routes originate and terminate at the central depot and obey vehicle capacity restrictions. Typically, researchers assume that all vehicles are identical. They relax the homogeneous fleet assumption. The objective is to determine optimal fleet size and mix by minimizing a total cost function which includes fixed cost and variable cost components. They describe several efficient heuristic solution procedures as well as techniques for generating a lower bound and an underestimate of the optimal solution. Finally, they present some encouraging computational results and suggestions for further study.


    Zugriff

    Zugriff prüfen

    Verfügbarkeit in meiner Bibliothek prüfen

    Bestellung bei Subito €


    Exportieren, teilen und zitieren



    Titel :

    The fleet size and mix vehicle routing problem


    Weitere Titelangaben:

    Die Fuhrparkgroesse und das Leitwegproblem


    Beteiligte:
    Golden, B. (Autor:in) / Assad, A. (Autor:in) / Levy, L. (Autor:in) / Gheysens, F. (Autor:in)

    Erschienen in:

    Erscheinungsdatum :

    1984


    Format / Umfang :

    18 Seiten, 16 Quellen



    Medientyp :

    Aufsatz (Zeitschrift)


    Format :

    Print


    Sprache :

    Englisch




    The fleet size and mix vehicle routing problem with synchronized visits

    Masmoudi, Mohamed Amine / Hosny, Manar / Koç, Çağrı | Taylor & Francis Verlag | 2022



    The fleet size and mix pollution-routing problem

    Koç, Çağrı | Online Contents | 2014


    The mixed fleet stochastic vehicle routing problem

    Teodorovic, Dusan / Krcmar-Nozic, Emina / Pavkovic, Goran | Taylor & Francis Verlag | 1995


    THE MIXED FLEET STOCHASTIC VEHICLE ROUTING PROBLEM

    Teodorovic, Dusan | Online Contents | 1995