Memetic algorithm for multi-tours dynamic vehicle routing problem with overtime (MDVRPOT)
| Autor: | Khaoula Ouaddi, Fatima-Zahra Mhada, Youssef Benadada |
|---|---|
| Jazyk: | angličtina |
| Rok vydání: | 2020 |
| Předmět: | |
| Zdroj: | International Journal of Industrial Engineering Computations, Vol 11, Iss 4, Pp 643-662 (2020) |
| Druh dokumentu: | article |
| ISSN: | 1923-2926 1923-2934 |
| DOI: | 10.5267/j.ijiec.2020.4.001 |
| Popis: | 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. |
| Databáze: | Directory of Open Access Journals |
| Externí odkaz: |
|