This chapter introduces what the logistics management and the combinatorial optimization are, before giving a formal definition of the capacitated vehicle routing problems (CVRP). Metaheuristics are mainly developed for real‐world problems, which often attain notably high levels of complexity, although they are not able to certify the optimality of the solutions they find. The classical vehicle VRP is an important problem in the fields of logistics and transportation. It consists of the determination of the optimal set of routes to be performed by a vehicle fleet to serve the demand of a given set of customers. With the traveling salesman problem (TSP), it is one of the most important and studied combinatorial optimization problems. The chapter also describes the typical characteristics of these problems by considering their main components, constraints and possible objectives to be optimized.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    General Presentation of Vehicle Routing Problems


    Contributors:


    Publication date :

    2016-03-30


    Size :

    14 pages




    Type of media :

    Article/Chapter (Book)


    Type of material :

    Electronic Resource


    Language :

    English




    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

    A General Vehicle Routing Problem

    Goel, Asvin / Gruhn, Volker | BASE | 2008

    Free access

    General Metaheuristic Algorithm for a Set of Rich Vehicle Routing Problems

    Qi, Mingyao / Peng, Cheng / Huang, Xiaoyu | Transportation Research Record | 2016