Analysis of evolutionary algorithms: From computational complexity analysis to algorithm engineering

FOGA'11 - Proceedings of the 2011 ACM/SIGEVO Foundations of Genetic Algorithms XI

Volumn , Issue , 2011, Pages 1-14

  Jansen, Thomas ^a   Zarges, Christine ^b  

^a UNIVERSITY COLLEGE CORK   (Ireland)

^b TU DORTMUND UNIVERSITY   (Germany)

Author keywords

Algorithm engineering; Performance measures; Runtime analysis

Indexed keywords

ALGORITHM ENGINEERING; ALGORITHMICS; COMPUTATIONAL COMPLEXITY ANALYSIS; EVOLUTIONARY COMPUTATIONS; ORDER OF GROWTH; PERFORMANCE MEASURES; RUN-TIME ANALYSIS; SEARCH SPACES;

ASYMPTOTIC ANALYSIS; FUNCTION EVALUATION; GENETIC ALGORITHMS;

COMPUTATIONAL COMPLEXITY;

EID: 79956042713     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1967654.1967656     Document Type: Conference Paper

References (15)

1. A. Auger and B. Doerr. Theory of Randomized Search Heuristics. World Scientific Review, 2011. To appear.
2. T. Bartz-Beielstein. Experimental Research in Evolutionary Computation - The New Experimentalism. Springer, 2006.
3. S. Böttcher, B. Doerr, and F. Neumann. Optimal fixed and adaptive mutation rates for the LeadingOnes problem. In R. Schaefer, C. Cotta, J. Ko lodziej, and G. Rudolph, editors, Proceedings of the 11th International Conference on Parallel Problem Solving From Nature (PPSN XI), volume 6238 of LNCS, pages 1-10. Springer, 2010.
4. T. H. Cormen, C. E. Leiserson, R. L. Rivest, and C. Stein. Introduction to Algorithms. MIT Press, 2001. 2nd edition.
5. S. Droste, T. Jansen, and I. Wegener. On the analysis of the (1+1) evolutionary algorithm. Theoretical Computer Science, 276:51-81, 2002.
6. T. Jansen and D. Sudholt. Analysis of an asymmetric mutation operator. Evolutionary Computation, 18(1):1-26, 2010.
7. T. Jansen and I. Wegener. On the choice of the mutation probability for the (1+1) EA. In M. Schoenauer, K. Deb, G. Rudolph, X. Yao, E. Lutton, J. J. Merelo, and H.-P. Schwefel, editors, Proceedings of the 6th International Conference on Parallel Problem Solving From Nature (PPSN VI), volume 1917 of LNCS, pages 89-98. Springer, 2000.
8. T. Jansen and I. Wegener. On the analysis of a dynamic evolutionary algorithm. Journal of Discrete Algorithms, 4(1):181-199, 2005.
9. D. Knuth. The Art of Computer Programming. Volume II. Addison-Wesley, 1969.
10. F. Neumann and C. Witt. Bioinspired Computation in Combinatorial Optimization - Algorithms and Their Computational Complexity. Natural Computing Series. Springer, 2010.
11. P. S. Oliveto, J. He, and X. Yao. Time complexity of evolutionary algorithms for combinatorial optimization: A decade of results. International Journal of Automation and Computing, 4(3):281-293, 2007. (Pubitemid 47167355)
12. G. Rudolph. Convergence Properties of Evolutionary Algorithms. Kovac, 1997.
13. G. Rudolph and J. Ziegenhirt. Computation time of evolutionary operators. In T. Bäck, D. B. Fogel, and Z. Michalewicz, editors, Handbook of Evolutionary Computation, pages E2.2:1-4. CRC Press, 1997.
14. P. Sanders. Algorithm engineering - an attempt at a definition. In S. Albers, H. Alt, and S. Näher, editors, Efficient Algorithms - Essays Dedicated to Kurt Mehlhorn on the Occasion of His 60th Birthday, volume 5760 of LNCS, pages 321-340. Springer, 2009.
15. I. Wegener. Methods for the analysis of evolutionary algorithms on pseudo-Boolean functions. In R. Sarker, X. Yao, and M. Mohammadian, editors, Evolutionary Optimization, pages 349-369. Kluwer, 2002.