A comparative study of three methods for solving the Mutli-Trip Dynamic Vehicle Routing Problem with Overtime (MTDVRPOT)

In recent years, the dynamic vehicle routing problem (DVRP) and its variants have been increasingly studied and several resolution approaches have been proposed. The objective of this study is to compare the results of three different approaches designed for the multi-trip dynamic vehicle routing problem with overtime (MTDVRPOT). The first approach is based on an exact method, the second is a hybrid ant colony system, while the third is a memetic algorithm. The tests are performed on small instances, and the results show the efficiency of the memetic algorithm.