Skip to Main Content
The dynamic vehicle routing problem, DVRP, is focused on optimally routing a fleet of vehicles of fixed capacity when the real-time requests of customers occur. The optimization is to search for the solution in minimizing the total length of tours and to satisfy the customer delivery time window. In this paper, we present a Wasp-like agent strategy to decide when to deal with the real-time requests and reoptimize the vehicle routes. The results show that the method works effectively to find competitive solutions.