The Vehicle Routing Problem (VRP) with stochastic demands was discussed. In this kind of VRP, the number of vehicles to serve customers and the number of customers served by each vehicle were unfixed before performing an optimization. A tabu search algorithm was designed for this purpose. In the algorithm, a vehicle-customer structure concept was designed to simplify the neighborhood structure. In order to analyze the effectiveness of the tabu search algorithm, a genetic algorithm and a hybrid algorithm were designed. The computational result showed that the tabu search algorithm based on the vehicle-customer structure was more effective than two other algorithms for the Vehicle Routing Problem with stochastic demands.


    Zugriff

    Zugriff prüfen

    Verfügbarkeit in meiner Bibliothek prüfen

    Bestellung bei Subito €


    Exportieren, teilen und zitieren



    Titel :

    A Tabu Search Algorithm for the Vehicle Routing Problem with Stochastic Demands


    Beteiligte:
    Liu, Xing (Autor:in) / Shen, Changli (Autor:in) / Wang, Guiqiang (Autor:in)

    Kongress:

    Sixth International Conference of Traffic and Transportation Studies Congress (ICTTS) ; 2008 ; Nanning, China



    Erscheinungsdatum :

    2008-07-17




    Medientyp :

    Aufsatz (Konferenz)


    Format :

    Elektronische Ressource


    Sprache :

    Englisch




    A Tabu Search Algorithm for the Split Delivery Vehicle Routing Problem

    Archetti, C. / Speranza, M. G. / Hertz, A. | British Library Online Contents | 2006



    A tabu search heuristic for the vehicle routing problem

    Gendreau, Michel / Hertz, Alain / Laporte, Gilbert | TIBKAT | 1992


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

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


    Study on the Model and Tabu Search Algorithm for Vehicle Routing Problem with Backhauls

    Lang, M. / ASCE | British Library Conference Proceedings | 2004