Measuring the Performance of Ant Colony Optimization Algorithms for the Dynamic Traveling Salesman Problem
Journal
Algorithms
Date Issued
December 1, 2023
DOI
10.3390/a16120545
Abstract
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.
File(s)![Thumbnail Image]()
Name
algorithms-16-00545.pdf
Size
758.1 KB
Format
Adobe PDF
Checksum (MD5)
8e4c974b3eca0a54883c2ed5745b21d7