Multiplicative drift analysis

Proceedings of the 12th Annual Genetic and Evolutionary Computation Conference, GECCO '10

Volumn , Issue , 2010, Pages 1449-1456

  Doerr, Benjamin ^a   Johannsen, Daniel ^a   Winzen, Carola ^a  

^a MAX PLANCK INSTITUTE FOR INFORMATICS   (Germany)

Author keywords

Running time analysis; Theory

Indexed keywords

DRIFT ANALYSIS; DRIFT FUNCTIONS; LINEAR FUNCTIONS; MINIMUM SPANNING TREES; MULTIPLICATIVE VERSION; MUTATION PROBABILITY; NATURAL PROOFS; OBJECTIVE FUNCTIONS; RUNNING TIME ANALYSIS; RUNTIMES; SHORTEST PATH; THEORY;

ALGEBRA; OPTIMIZATION; THEOREM PROVING; TREES (MATHEMATICS);

EVOLUTIONARY ALGORITHMS;

EID: 77955890399     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1830483.1830748     Document Type: Conference Paper

References (16)

1. S. Baswana, S. Biswas, B. Doerr, T. Friedrich, P. P. Kurur, andF. Neumann. Computing single source shortest paths using single-objective fitness. In FOGA '09, pages 59-66, 2009.
2. B. Doerr, L. A. Goldberg. Private communication.
3. B. Doerr, D. Johannsen, andC. Winzen. Drift analysis and linear functions revisited. In CEC '10, to appear.
4. S. Droste, T. Jansen, andI. Wegener. On the analysis of the (1+1) evolutionary algorithm. Theoretical Computer Science, 276:51-81, 2002.
5. O. Giel andP. K. Lehre. On the effect of populations in evolutionary multi-objective optimization. In GECCO '06, pages 651-658, 2006.
6. O. Giel andI. Wegener. Evolutionary algorithms and the maximum matching problem. In STACS '03, volume 2607 of LNCS, pages 415-426, 2003.
7. B. Hajek. Hitting-time and occupation-time bounds implied by drift analysis with applications. Advances in Applied Probability, 13:502-525, 1982.
8. E. Happ, D. Johannsen, C. Klein, andF. Neumann. Rigorous analyses of fitness-proportional selection for optimizing linear functions. In GECCO '08, pages 953-960, 2008.
9. J. He andX. Yao. Drift analysis and average time complexity of evolutionary algorithms. Artificial Intelligence, 127:57-85, 2001.
10. J. He andX. Yao. Towards an analytic framework for analysing the computation time of evolutionary algorithms. Artificial Intelligence, 145:59-97, 2003.
11. J. He andX. Yao. A study of drift analysis for estimating computation time of evolutionary algorithms. Natural Computing, 3:21-35, 2004.
12. J. Jägersküpper. A blend of Markov-chain and drift analysis. In PPSN X, pages 41-51, 2008.
13. M. Kano. Maximum and k-th maximal spanning trees of a weighted graph. Combinatorica, 7:205-214, 1987.
14. F. Neumann, P. S. Oliveto, andC. Witt. Theoretical analysis of fitness-proportional selection: landscapes and efficiency. In GECCO '09, pages 835-842, 2009.
15. F. Neumann andI. Wegener. Randomized local search, evolutionary algorithms, and the minimum spanning tree problem. Theoretical Compututer Science, 378:32-40, 2007.
16. P. S. Oliveto andC. Witt. Simplified drift analysis for proving lower bounds in evolutionary computation. In PPSN X, pages 82-91, 2008.