AbstractThis paper presents a guided local search heuristic to solve a vehicle routing problem with backhauls and time windows. The VRPBTW with and without customer precedence are both considered. Customer precedence requires that all linehaul customers be visited before any backhaul customer. The basic approach is to construct an initial infeasible solution and then use a guided local search to improve the solution feasibility and quality. A new technique––section planning––is used to enhance the feasibility. Computational results show that the new heuristic can solve problems in which customers are distributed normally or in clusters. Some of the results are better than the best solutions that have appeared in the literature.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    A vehicle routing problem with backhauls and time windows: a guided local search solution


    Contributors:


    Publication date :

    2003-12-09


    Size :

    14 pages




    Type of media :

    Article (Journal)


    Type of material :

    Electronic Resource


    Language :

    English






    A Tabu Search Heuristic for the Vehicle Routing Problem with Backhauls and Time Windows

    Duhamel, C. / Potvin, J.-Y. / Rousseau, J.-M. | British Library Online Contents | 1997


    Genetic Algorithm for Vehicle Routing Problem with Backhauls

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

    Free access