The Dynamic Vehicle Routing Problem (DVRP) is a variant of the VRP that considers dynamic customer requests. The aim of the problem is to determine a set of routes to minimize the total travel distance. To solve this problem, we propose a Variable Neighbourhood Search (VNS) algorithm, in which eight neighborhood structures are designed to find the optimal routes for a fleet of vehicles serving a given customers without violating any constraints. The proposed algorithm was tested on benchmark instances. Numerical results indicate that the performance of the proposed method is comparable to that reported in the literature.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    A Variable Neighbourhood Search Algorithm for Solving Dynamic Vehicle Routing Problem Under Industry 4.0


    Additional title:

    Lect. Notes Electrical Eng.


    Contributors:
    Wang, Yi (editor) / Martinsen, Kristian (editor) / Yu, Tao (editor) / Wang, Kesheng (editor) / Chen, Shifeng (author) / Yin, Yanlan (author) / Chen, Bo (author) / Gao, Yannan (author) / Yang, Junjie (author)

    Conference:

    International Workshop of Advanced Manufacturing and Automation ; 2020 ; Zhanjiang, China October 12, 2020 - October 13, 2020



    Publication date :

    2021-01-23


    Size :

    8 pages





    Type of media :

    Article/Chapter (Book)


    Type of material :

    Electronic Resource


    Language :

    English





    Solving Vehicle Routing Problem Using Grover Adaptive Search Algorithm

    Liu, Lu / Qian, Ling / Wu, Xing-Yu et al. | IEEE | 2025


    Solving the Dynamic Vehicle Routing Problem Under Traffic Congestion

    Kim, Gitae / Ong, Yew Soon / Cheong, Taesu et al. | IEEE | 2016