The dynamic vehicle routing problem: Solution with hybrid metaheuristic approach

Abstract

The increased awareness in just-in-time supply systems with the apparition of the new advances in communication and information technologies, have recently led researchers to focus on dynamic vehicle routing problem (DVRP). In DVRP, client requests are not known and are exposed after making some decisions. An alternative variant dynamic pickup and delivery strategy of the vehicle routing problem arises when new customers appear in the tours after the starting visit. The DVRP are among the more important and more challenging extensions of VRP. The purpose of this paper is to propose an Artificial Ant Colony based on 2_Opt local search (AAC_2_Opt) to solve the DVRP. We demonstrate the effectiveness of our approach by comparing its results with those of existing methods in the literature on the same tests problems. The AAC_2_Opt algorithm can efficiently optimize the routing problem and provide highly competitive solution.