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.
A Variable Neighbourhood Search Algorithm for Solving Dynamic Vehicle Routing Problem Under Industry 4.0
Lect. Notes Electrical Eng.
International Workshop of Advanced Manufacturing and Automation ; 2020 ; Zhanjiang, China October 12, 2020 - October 13, 2020
2021-01-23
8 pages
Aufsatz/Kapitel (Buch)
Elektronische Ressource
Englisch
Solving the Dynamic Vehicle Routing Problem Under Traffic Congestion
Online Contents | 2016
|