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.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

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


    Contributors:
    Liu, Xing (author) / Shen, Changli (author) / Wang, Guiqiang (author)

    Conference:

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



    Publication date :

    2008-07-17




    Type of media :

    Conference paper


    Type of material :

    Electronic Resource


    Language :

    English




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

    Hu, Shan Liang ;Liu, Chang Shi | Trans Tech Publications | 2011


    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