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.


    Zugriff

    Zugriff prüfen

    Verfügbarkeit in meiner Bibliothek prüfen

    Bestellung bei Subito €


    Exportieren, teilen und zitieren



    Titel :

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


    Beteiligte:
    Luo Wei, (Autor:in) / Fu Zhuo, (Autor:in)


    Erscheinungsdatum :

    01.11.2010


    Format / Umfang :

    306960 byte




    Medientyp :

    Aufsatz (Konferenz)


    Format :

    Elektronische Ressource


    Sprache :

    Englisch




    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