Abstract
The Vehicle Routing Problem (VRP) introduced by Dantzing and Ranser (1959) is a prominent combinatorial optimization problem. Over the last several decades, many variants of the multi-constrained vehicle routing problem have been studied and a class of problems known as rich vehicle routing problem (RVRPs), has been formed. This work is about solving a variant of RVRP with dynamically changing orders and time windows constraints. In the real world application, during the working day, new orders often occur dynamically and need to be integrated into the routes planing. A Genetic Algorithm (GA) with a simple heuristic is proposed to solve the dynamic vehicle routing problem with time windows. The performance is tested on Solomon's benchmark with different percentage of the orders revealed to the algorithm during operation time.
Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
