Memetic algorithm for multi-tours dynamic vehicle routing problem with overtime (Mdvrpot)

After three decades of its introduction, the dynamic vehicle routing problem (DVRP) remains a fertile field for new studies. The technological evolution, which continues to progress day by day, has allowed better communication between different actors of this model and a more encouraging execution time. This encouraged researchers to investigate new variants of the DVRP and use more complicated algorithms for the resolution. Among these variants is the multi-tour DVRP (MTDVRP) with overtime (MTDVRPOT), which is the subject of this article. This paper proposes an approach with a memetic algorithm (MA). The results obtained in this study are better than those of the ant colony system (ACS) applied to the same problem and published in an earlier paper. © 2020 by the authors; licensee Growing Science, Canada.