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

Titre	A comparative study of three methods for solving the Mutli-Trip Dynamic Vehicle Routing Problem with Overtime (MTDVRPOT)
Publication Type	Conference Paper
Year of Publication	2020
Authors	Ouaddi, K, Mhada, F-Z, Benadada, Y
Conference Name	Proceedings - 2020 5th International Conference on Logistics Operations Management, GOL 2020
Mots-clés	Ant colony optimization, Comparative studies, Dynamic vehicle routing problems, Exact methods, Hybrid ant colony systems, Memetic algorithms, Multi trips, Vehicle routing, Vehicles
Abstract	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. © 2020 IEEE.
URL	https://www.scopus.com/inward/record.uri?eid=2-s2.0-85100211299&doi=10.1109%2fGOL49479.2020.9314727&partnerID=40&md5=b18f63526f7e1ac4b3feb37e42ce0faa
DOI	10.1109/GOL49479.2020.9314727