Refined runtime analysis of a basic ant colony optimization algorithm

2007 IEEE Congress on Evolutionary Computation, CEC 2007

Volumn , Issue , 2007, Pages 501-507

  Doerr, Benjamin ^b   Johannsen, Daniel ^a,b  

^a IEEE

^b MAX PLANCK INSTITUTE FOR INFORMATICS   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ANT COLONY OPTIMIZATION; PHASE OF TRANSITION;

ALGORITHMS; BOOLEAN ALGEBRA; MATHEMATICAL MODELS; POLYNOMIALS; PROBLEM SOLVING;

OPTIMIZATION;

EID: 56549113441     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/CEC.2007.4424512     Document Type: Conference Paper

References (20)

1. N. Alon and J. Spencer. The Probabilistic Method. Interscience Series in Discrete Mathematics and Optimization. Wiley, 2000.
2. B. Doerr, N. Hebbinghaus, and F. Neumann. Speeding up evolutionary algorithms through restricted mutation operators. In Proceedings of the 9th International Conference on Parallel Problem Solving From Nature (PPSN), volume 4193 of Lecture Notes in Computer Science, pages 978-987. Springer, 2006.
3. B. Doerr and D. Johannsen. Adjacency list matchings - an ideal genotype for cycle covers. In Genetic and Evolutionary Computation Conference (GECCO-2007). ACM, 2007. To appear.
4. B. Doerr, C. Klein, and T. Storch. Faster evolutionary algorithms by superior graph representation. In Proceedings of the First IEEE Symposium on Foundations of Computational Intelligence (FOCI), pages 245-250. IEEE Press, 2007.
5. B. Doerr, F. Neumann, D. Sudholt, and C. Witt. On the influence of pheromone updates in aco algorithms. In Genetic and Evolutionary Computation Conference (GECCO-2007). ACM, 2007. To appear.
6. M. Dorigo and C. Blum. Ant colony optimization theory: A survey. Theor. Comput. Sci., 344:243-278, 2005.
7. M. Dorigo, V. Maniezzo, and A. Colorni. The ant system: An autocatalytic optimizing process. Technical Report 91-016 Revised, Politecnico di Milano, 1991.
8. M. Dorigo and T. Stützle. Ant Colony Optimization. MIT Press, 2004.
9. S. Droste, T. Jansen, and I. Wegener. On the analysis of the (1+1) evolutionary algorithm. Theor. Comput. Sci., 276:51-81, 2002.
10. O. Giel and I. Wegener. Evolutionary algorithms and the maximum matching problem. In Proc. of STACS '03, volume 2607 of LNCS, pages 415-426, 2003.
11. W. J. Gutjahr. A generalized convergence result for the graph-based ant system metaheuristic. Probab. Eng. Inform. Sc., 17:545-569, 2003.
12. W. J. Gutjahr. On the finite-time dynamics of ant colony optimization. Methodology and Computing in Applied Probability, 8:105-133, 2006.
13. W. J. Gutjahr and G. Sebastiani. Runtime analysis of ant colony optimization. Technical report, Mathematics department, "Sapienza" University of Rome, 2007/03, 2007.
14. M. Jerrum and G. B. Sorkin. The metropolis algorithm for graph bisection. Discrete Appl. Math., 82:155-175, 1998.
15. F. Neumann. Expected runtimes of evolutionary algorithms for the Eulerian cycle problem. In Proceedings of the 2004 IEEE Congress on Evolutionary Computation (CEC), pages 904-910. IEEE Press, 2004.
16. F. Neumann and I. Wegener. Randomized local search, evolutionary algorithms, and the minimum spanning tree problem. In Proc. of GECCO '04, volume 3102 of LNCS, pages 713-724, 2004.
17. F. Neumann and C. Witt. Ant colony optimization and the minimum spanning tree problem. In Electronic Colloquium on Computational Complexity (ECCC), 2006. Report No. 143.
18. F. Neumann and C. Witt. Runtime analysis of a simple ant colony optimization algorithm. In Proc. of ISAAC '06, volume 4288 of LNCS, pages 618-627. Springer, 2006.
19. C. H. Papadimitriou, A. A. Schäffer, and M. Yannakakis. On the complexity of local search. In Proc. of STOC '90, pages 438-445. ACM Press, 1990.
20. C. Witt. Worst-case and average-case approximations by simple randomized search heuristics. In Proc. of STACS '05, volume 3404 of LNCS, pages 44-56, 2005.