Most algorithms for solving vehicle routing problems use the criterion of minimizing total travel time in forming their routes. As illustrated in the paper, even in the case of a homogeneous fleet, solutions using other criteria may be preferred to the solution generated by minimizing total travel time. This situation becomes more pronounced when considering a vehicle routing problem where the fleet is non-homogeneous. In this paper, we explore the uses of more complex cost models in deriving solutions to vehicle routing problems, especially in the case of a non-homogeneous fleet. We develop a function called the Measure of Goodness that can be used as the criterion for solving these problems. We show how the Measure of Goodness criterion or special cases of this criterion can be used to compare solutions, generate an initial fleet mix or used as the criterion in a mixed integer program for carrying out between route swaps of the entities to be serviced. The vehicle routing problem emphasized in this paper is the Capacitated Arc Routing Problem with Vehicle/Site Dependencies (CARP-VSD).


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    Cost models for vehicle routing problems


    Contributors:
    Sniezek, J. (author) / Bodin, L. (author)


    Publication date :

    2002-01-01


    Size :

    497785 byte




    Type of media :

    Conference paper


    Type of material :

    Electronic Resource


    Language :

    English




    Hierarchial Vehicle Routing Problems

    A. M. Spaccamela / A. H. G. Rinnooykan / L. Stougie | NTIS | 1982


    Probabilistic vehicle routing problems

    Jézéquel, Antoine | DSpace@MIT | 1985

    Free access

    Arc routing vehicle routing problems with vehicle/site dependencies

    Sniezek, J. / Bodin, L. | Springer Verlag | 1996

    Free access

    Vehicle Routing Problem Models

    Tonči Carić / Senka Pašagić / Zdenko Lanović | DOAJ | 2004

    Free access