A combined ant colony optimization with Levy flight mechanism for the probabilistic traveling salesman problem with deadlines
Mathematical Modeling and Computing · 2024 · 11 (1) · 290-299
DOI: 10.23939/mmc2024.01.290 ↗Kurz gefasst
Fachartikel in der Zeitschrift Mathematical Modeling and Computing, 2024. Verfasst von F. El Asri und 2 weiteren Autor:innen. Die Arbeit wurde bisher 2-mal zitiert (Crossref) und nennt 25 Literaturangaben.
Abstract (Originalsprache)
In this paper, we are interested in the Probabilistic Traveling Salesman Problem with Deadlines (PTSPD) where clients must be contacted, in addition to their random availability before a set deadline. The main objective is to find an optimal route that covers a random subset of visitors in the same order as they appear on the tour, attempting to keep the path as short as possible. This problem is regarded as being ♯P-hard. Ant Colony Optimization (ACO) has been frequently employed to resolve this challenging optimization problem. However, we suggest an enhanced ACO employing the Levy flight algorithm in this study. This allows some ants to take longer jumps based on the Levy distribution, helping them escape from local optima situations. Our computational experiments using standard benchmark datasets demonstrate that the proposed algorithm is more efficient and accurate than traditional ACO.
Zitieren
APA
Asri, F. E., Tajani, C., & Fakhouri, H. (2024). A combined ant colony optimization with Levy flight mechanism for the probabilistic traveling salesman problem with deadlines. Mathematical Modeling and Computing, 11(1), 290-299. https://doi.org/10.23939/mmc2024.01.290
Vancouver
Asri FE, Tajani C, Fakhouri H. A combined ant colony optimization with Levy flight mechanism for the probabilistic traveling salesman problem with deadlines. Mathematical Modeling and Computing. 2024;11(1):290-299. doi:10.23939/mmc2024.01.290
BibTeX
@article{Asri2024,
author = {Asri, F. El and Tajani, C. and Fakhouri, H.},
title = {A combined ant colony optimization with Levy flight mechanism for the probabilistic traveling salesman problem with deadlines},
journal = {Mathematical Modeling and Computing},
year = {2024},
volume = {11},
number = {1},
pages = {290--299},
doi = {10.23939/mmc2024.01.290}
}
EUVIMED