This study aims to explore how to effectively solve the bottleneck problem in the transportation path planning of urban garbage trucks. Therefore, we propose a complex dynamic vehicle path planning model that integrates time window and vehicle capacity constraints. With the help of tabu search algorithm, we transform the four garbage disposal sites into a set of two-dimensional array d composed of digital zeros or ones, and update the relevant information of tabu list and tabu duplicate list in time. We carefully study the fitness value of each new feasible solution in neighborhood A, and automatically adjust the driving plan of the vehicle. According to the research status of DVRP, a dynamic programming model is put forward and established, and the shortest time required for vehicles to treat different amounts of garbage at each stage is inferred, and the relationship between waste treatment time and treatment efficiency is drawn intuitively, and compared and analyzed, and finally the best walking route scheme is obtained.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    Optimization of Vehicle Routing Problem Based on Tabu Search Algorithm


    Contributors:
    Guo, Wei (author) / Rong, Suijin (author) / Liu, Hao (author) / Yuan, Jiaming (author)


    Publication date :

    2024-06-12


    Size :

    1139272 byte




    Type of media :

    Conference paper


    Type of material :

    Electronic Resource


    Language :

    English