Affiliation:
1. ERATOSTHENES Centre of Excellence, 3012 Limassol, Cyprus
2. Department of Civil Engineering and Geomatics, Cyprus University of Technology, 3036 Limassol, Cyprus
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.
Subject
Computational Mathematics,Computational Theory and Mathematics,Numerical Analysis,Theoretical Computer Science
Reference40 articles.
1. Ant Colony System: A Cooperative Learning Approach to the Traveling Salesman Problem;Dorigo;IEEE Trans. Evol. Comput.,1997
2. Ant Algorithms for Discrete Optimization;Dorigo;Artif. Life,1999
3. Colorni, A., Dorigo, M., and Maniezzo, V. (1991, January 13). Distributed optimization by ant colonies. Proceedings of the European Conference on Artificial Life, Paris, France.
4. Mavrovouniotis, M., Ellinas, G., and Polycarpou, M. (2019, January 10–13). Electric Vehicle Charging Scheduling Using Ant Colony System. Proceedings of the 2019 IEEE Congress on Evolutionary Computation (CEC), Wellington, New Zealand.
5. Dynamic vehicle routing: A memetic ant colony optimization approach;Uyar;Automated Scheduling and Planning,2013