Mathematical runtime analysis of ACO algorithms: survey on an emerging issue
- 195 Downloads
The paper gives an overview on the status of the theoretical analysis of Ant Colony Optimization (ACO) algorithms, with a special focus on the analytical investigation of the runtime required to find an optimal solution to a given combinatorial optimization problem. First, a general framework for studying questions of this type is presented, and three important ACO variants are recalled within this framework. Secondly, two classes of formal techniques for runtime investigations of the considered type are outlined. Finally, some available runtime complexity results for ACO variants, referring to elementary test problems that have been introduced in the theoretical literature on evolutionary algorithms, are cited and discussed.
KeywordsAnalysis of algorithms Ant colony optimization Combinatorial optimization Runtime analysis Runtime complexity
Unable to display preview. Download preview PDF.
- Baluja, S., & Caruana, R. (1995). Removing the genetics from the standard genetic algorithm. In A. Prieditis & S. Russell (Eds.), Proceedings of the 12th international conference on machine learning (ML-95) (pp. 38–46). Palo Alto: Kaufmann. Google Scholar
- Birattari, M., Pellegrini, P., & Dorigo, M. (2007, in press). On the invariance of ant colony optimization. IEEE Transactions on Evolutionary Computation. Google Scholar
- Borisovsky, P. A., & Eremeev, A. V. (2003). A study on performance of the (1+1)-evolutionary algorithm. In Proceedings of the foundations of genetic algorithms 7. San Francisco: Kaufmann. Google Scholar
- Doerr, B., Neumann, F., Sudholdt, D., & Witt, C. (2007). On the influence of pheromone updates in ACO algorithms. Technical Report CI-223/07, University of Dortmund, SFB 531, to appear in Proc. GECCO 2007. Google Scholar
- Dorigo, M., & Di Caro, G. (1999). The Ant colony optimization metaheuristic. In D. Corne, M. Dorigo, & F. Glover (Eds.), New ideas in optimization (pp. 11–32). Maidenhead: McGraw–Hill. Google Scholar
- Dorigo, M., Maniezzo, V., & Colorni, A. (1991). Positive feedback as a search strategy. Technical Report TR-POLI-91-016, Dipartimento di Elletronica, Politecnico di Milano, Milan, Italy. Google Scholar
- Dorigo, M., Maniezzo, V., & Colorni, A. (1996). Ant system: optimization by a colony of cooperating agents. IEEE Transactions on Systems, Man, and Cybernetics, 26, 1–13. Google Scholar
- Gonzalez, C., Lozano, J. A., & Larrañaga, P. (2000). Analyzing the PBIL algorithm by means of discrete dynamical systems. Complex Systems, 4, 465–479. Google Scholar
- Gonzalez, C., Lozano, J. A., & Larrañaga, P. (2001). The convergence behavior of the PBIL algorithm: a preliminary approach. In Proceedings of the 5th international conference on artificial neural networks and genetic algorithms (ICANNGA ’01) (pp. 228–231). Berlin: Springer. Google Scholar
- Gutjahr, W. J. (2005). Theory of ant colony optimization: status and perspectives. In MIC ’05 (6th metaheuristics international conference). Proceedings CD-ROM. Google Scholar
- Gutjahr, W. J. (2007, in press). First steps to the runtime complexity analysis of ant colony optimization. Computers and Operations Research. Google Scholar
- Gutjahr, W. J., & Sebastiani, G. (2007). Runtime analysis of Ant colony optimization. Technical Report, Consiglio Nazionale delle Ricerche, Rome. Available under: http://www.mat.uniroma1.it/people/sebastiani/preprints.htm.
- Kallel, L., Naudts, B., & Reeves, C. R. (1998). Properties of fitness functions and search landscapes. In Kallel, Naudts, & Rogers (Eds.), Theoretical aspects of evolutionary computing (pp. 174–206) Berlin: Springer. Google Scholar
- Neumann, F., & Witt, C. (2006a). Runtime analysis of a simple ant colony optimization algorithm. In Lecture notes in computer science : Vol. 4288. Proceedings ISAAC ’06 (pp. 618–624). Berlin: Springer. Google Scholar
- Neumann, F., & Witt, C. (2006b). Ant colony optimization and the minimum spanning tree problem. Technical Report CI-220/06, University of Dortmund, SFB 531. Google Scholar