The vehicle routing problem with stochastic demands is considered in this paper, and an effective tabu search algorithm for the proposed problem. The goal consists of minimizing the vehicle number and expected distance traveled in order to serve all customers’ demands. Finally, a numerical example is given to show the effectiveness of the algorithm.


    Zugriff

    Zugriff prüfen

    Verfügbarkeit in meiner Bibliothek prüfen

    Bestellung bei Subito €


    Exportieren, teilen und zitieren



    Titel :

    An Effective Tabu Search Algorithm for the Vehicle Routing Problem with Stochastic Demands



    Erschienen in:

    Advanced Materials Research ; 282-283 ; 375-378


    Erscheinungsdatum :

    04.07.2011


    Format / Umfang :

    4 pages




    Medientyp :

    Aufsatz (Zeitschrift)


    Format :

    Elektronische Ressource


    Sprache :

    Englisch




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

    Liu, Xing / Shen, Changli / Wang, Guiqiang | ASCE | 2008


    Optimization of Vehicle Routing Problem Based on Tabu Search Algorithm

    Guo, Wei / Rong, Suijin / Liu, Hao et al. | IEEE | 2024




    A Tabu Search Algorithm for the Split Delivery Vehicle Routing Problem

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