The heterogeneous fleet vehicle routing problem with time windows is a variant of the classical vehicle routing problem. This paper defines a mathematical model of this problem and proposes a variable neighborhood tabu search algorithm to solve it. The initial solution is obtained by GENIUS and the giant tour algorithm. Our algorithm employs a variable neighborhood mechanism to search the optimal solution based upon four neighborhoods. In addition, the local search results are improved by the tabu search algorithm. The proposed algorithm appears to be effective when tested on benchmark instances from the literature.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    A Variable Neighborhood Tabu Search Algorithm for the Heterogeneous Fleet Vehicle Routing Problem with Time Windows


    Contributors:
    Luo Wei, (author) / Fu Zhuo, (author)


    Publication date :

    2010-11-01


    Size :

    306960 byte




    Type of media :

    Conference paper


    Type of material :

    Electronic Resource


    Language :

    English




    An Algorithm for Vehicle Routing Problem with Soft Time Windows Using Tabu Search

    Zhang, L. / Niu, H. | British Library Conference Proceedings | 2009


    A tabu search heuristic for the vehicle routing problem with time windows

    Potvin, Jean-Yves / Kervahut, Tanguy / Rousseau, Jean-Marc | TIBKAT | 1993



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

    Taillard, E. / Badeau, P. / Gendreau, M. et al. | British Library Online Contents | 1997