Measuring the Performance of Ant Colony Optimization Algorithms for the Dynamic Traveling Salesman Problem
Algorithms · 28.11.2023 · 16 (12) · 545
DOI: 10.3390/a16120545 ↗Kurz gefasst
Fachartikel in der Zeitschrift Algorithms, online erschienen am 28.11.2023. Verfasst von Michalis Mavrovouniotis und 2 weiteren Autor:innen. Die Arbeit wurde bisher 16-mal zitiert (Crossref) und nennt 40 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0). Gefördert von: ‘EXCELSIOR’ project (European Union’s Horizon 2020 research and innovation programme), ‘AI-OBSERVER’ project (European Union’s Horizon Europe framework programme).
Abstract (Originalsprache)
Ant colony optimization (ACO) has proven its adaptation capabilities on optimization problems with dynamic environments. In this work, the dynamic traveling salesman problem (DTSP) is used as the base problem to generate dynamic test cases. Two types of dynamic changes for the DTSP are considered: (1) node changes and (2) weight changes. In the experiments, ACO algorithms are systematically compared in different DTSP test cases. Statistical tests are performed using the arithmetic mean and standard deviation of ACO algorithms, which is the standard method of comparing ACO algorithms. To complement the comparisons, the quantiles of the distribution are also used to measure the peak-, average-, and bad-case performance of ACO algorithms. The experimental results demonstrate some advantages of using quantiles for evaluating the performance of ACO algorithms in some DTSP test cases.
Förderung
- ‘EXCELSIOR’ project (European Union’s Horizon 2020 research and innovation programme)
- ‘AI-OBSERVER’ project (European Union’s Horizon Europe framework programme)
Zitieren
APA
Mavrovouniotis, M., Anastasiadou, M. N., & Hadjimitsis, D. (2023). Measuring the Performance of Ant Colony Optimization Algorithms for the Dynamic Traveling Salesman Problem. Algorithms, 16(12), 545. https://doi.org/10.3390/a16120545
Vancouver
Mavrovouniotis M, Anastasiadou MN, Hadjimitsis D. Measuring the Performance of Ant Colony Optimization Algorithms for the Dynamic Traveling Salesman Problem. Algorithms. 2023;16(12):545. doi:10.3390/a16120545
BibTeX
@article{Mavrovouniotis2023,
author = {Mavrovouniotis, Michalis and Anastasiadou, Maria N. and Hadjimitsis, Diofantos},
title = {Measuring the Performance of Ant Colony Optimization Algorithms for the Dynamic Traveling Salesman Problem},
journal = {Algorithms},
year = {2023},
volume = {16},
number = {12},
pages = {545},
doi = {10.3390/a16120545}
}
EUVIMED