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.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    The fleet size and mix vehicle routing problem


    Additional title:

    Die Fuhrparkgroesse und das Leitwegproblem


    Contributors:
    Golden, B. (author) / Assad, A. (author) / Levy, L. (author) / Gheysens, F. (author)

    Published in:

    Publication date :

    1984


    Size :

    18 Seiten, 16 Quellen



    Type of media :

    Article (Journal)


    Type of material :

    Print


    Language :

    English




    The fleet size and mix pollution-routing problem

    Koç, Çağri / Bektaş, Tolga / Laporte, Gilbert et al. | BASE | 2014

    Free access

    The fleet size and mix vehicle routing problem with synchronized visits

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


    THE MIXED FLEET STOCHASTIC VEHICLE ROUTING PROBLEM

    Teodorovic, Dusan | Online Contents | 1995


    The mixed fleet stochastic vehicle routing problem

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


    The fleet size and mix pollution-routing problem

    Koç, Çağrı / Bektaş, Tolga / Jabali, Ola et al. | Elsevier | 2014