Enhanced Artificial Bee Colony Algorithm for the Probabilistic Traveling Salesman Problem with Deadlines
Boletim da Sociedade Paranaense de Matemática · 23.02.2026
DOI: 10.5269/bspm.79317 ↗Kurz gefasst
Fachartikel in der Zeitschrift Boletim da Sociedade Paranaense de Matemática, online erschienen am 23.02.2026. Verfasst von Fadoua El Asri und 2 weiteren Autor:innen. Die Arbeit wurde bisher 1-mal zitiert (Crossref) und nennt 24 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0).
Abstract (Originalsprache)
This study addresses the challenge of routing under uncertainty when timing constraints are critical. We propose ABC-DT, an enhanced Artificial Bee Colony algorithm developed for the #P-hard Probabilistic Traveling Salesman Problem with Deadlines (PTSPD). The Artificial Bee Colony (ABC) approach has shown strong results in many combinatorial contexts, largely due to its simple structure and its balanced mix of exploration and exploitation. Its limited number of control parameters and flexible neighborhood design make it well suited to discrete and stochastic problems such as the PTSPD, where it often surpasses conventional heuristics in both efficiency and reliability. However, standard ABC suffers from premature convergence and suboptimal handling of probabilistic structures. Thus, ABC-DT combines three innovations, which are: adaptive neighborhood operators weighted by probabilities and deadlines, dynamic parameter tuning, and hybrid scout diversification. Experiments on benchmarks (22–100+ nodes) show 7–23% lower expected costs, with reduced variability compared to ABC-standard. Validation studies confirm this (+10–15% costs without weighted operators). The algorithm scales well, handling 152-node instances, and is flexible for fixed or proportional penalties, making it viable for urgent logistics.
Zitieren
APA
Asri, F. E., Tajani, C., & Fakhouri, H. (2026). Enhanced Artificial Bee Colony Algorithm for the Probabilistic Traveling Salesman Problem with Deadlines. Boletim da Sociedade Paranaense de Matemática. https://doi.org/10.5269/bspm.79317
Vancouver
Asri FE, Tajani C, Fakhouri H. Enhanced Artificial Bee Colony Algorithm for the Probabilistic Traveling Salesman Problem with Deadlines. Boletim da Sociedade Paranaense de Matemática. 2026. doi:10.5269/bspm.79317
BibTeX
@article{Asri2026,
author = {Asri, Fadoua El and Tajani, Chakir and Fakhouri, Hanane},
title = {Enhanced Artificial Bee Colony Algorithm for the Probabilistic Traveling Salesman Problem with Deadlines},
journal = {Boletim da Sociedade Paranaense de Matemática},
year = {2026},
doi = {10.5269/bspm.79317}
}
EUVIMED