Abstract Let us consider the following extension of the Capacitated Vehicle Routing Problem (VRP). We are given a set of customers partitioned in two subsets: Linehaul and Backhaul customers. Each Linehaul customer requires the delivery of a given quantity of product from the depot, while a given quantity of product must be picked up from each Backhaul customer and transported to the depot. This problem is known as the Vehicle Routing Problem with Backhauls (VRPB), or as the Linehaul-Backhaul Problem. VRPB then calls for the determination of a set of vehicle routes visiting once all customers and such that: (i) each vehicle performs one route; (ii) for each route the total load associated with Linehaul and Backhaul customers does not exceed, separately, the vehicle capacity; (iii) in each route no Backhaul customer is visited before that all Linehaul customers have been serviced. The objective is to minimize.the total traveled distance.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    A Heuristic Algorithm for the Vehicle Routing Problem with Backhauls


    Contributors:
    Toth, Paolo (author) / Vigo, Daniele (author)


    Publication date :

    1996-01-01


    Size :

    24 pages





    Type of media :

    Article/Chapter (Book)


    Type of material :

    Electronic Resource


    Language :

    English




    A Heuristic Algorithm for the Vehicle Routing Problem with Backhauls

    Toth, P. / Vigo, D. / Italian National Research Council; Progetto Finalizzato Transporti et al. | British Library Conference Proceedings | 1996


    Genetic Algorithm for Vehicle Routing Problem with Backhauls

    WA, W.Nurfahizul Ifwah. / Shaiful, M. / Shamsunarnie, M.Z et al. | BASE | 2012

    Free access


    An Exact Algorithm for the Vehicle Routing Problem with Backhauls

    Toth, P. / Vigo, D. | British Library Online Contents | 1997