Adaptive drift analysis

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 6238 LNCS, Issue PART 1, 2010, Pages 32-41

  Doerr, Benjamin ^a   Goldberg, Leslie Ann ^b  

^a MAX PLANCK INSTITUTE FOR INFORMATICS   (Germany)

^b UNIVERSITY OF LIVERPOOL   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

DRIFT ANALYSIS; DRIFT FUNCTIONS; EXPECTED TIME; LINEAR FUNCTIONS; MUTATION RATES; PROBLEM INSTANCES; PSEUDO-BOOLEAN;

EVOLUTIONARY ALGORITHMS;

PROBLEM SOLVING;

EID: 78149238060     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-15844-5_4     Document Type: Conference Paper

References (18)

1. Baswana, S., Biswas, S., Doerr, B., Friedrich, T., Kurur, P.P., Neumann, F.: Computing single source shortest paths using single-objective fitness. In: Proceedings of FOGA 2009, pp. 59-66. ACM, New York (2009)
2. Doerr, B., Goldberg, L.A.: Drift analysis with tail bounds. In: Parallel Problem Solving from Nature-PPSN XI. LNCS. Springer, Heidelberg (to appear 2010)
3. Doerr, B., Jansen, T., Sudholt, D., Winzen, C., Zarges, C.: Optimizing monotone functions can be difficult. In: Parallel Problem Solving from Nature-PPSN XI. LNCS. Springer, Heidelberg (to appear 2010)
4. Doerr, B., Johannsen, D., Winzen, C.: Drift analysis and linear functions revisited. In: Proceedings of CEC 2010. IEEE, Los Alamitos (to appear 2010)
5. Doerr, B., Johannsen, D., Winzen, C.: Multiplicative drift analysis. In: Proceedings of GECCO 2010. ACM, New York (to appear 2010)
6. Droste, S., Jansen, T., Wegener, I.: On the analysis of the (1+1) evolutionary algorithm. Theoretical Computer Science 276, 51-81 (2002)
7. Dyer, M., Greenhill, C.: Random walks on combinatorial objects. In: Surveys in Combinatorics 1999, pp. 101-136. University Press (1999)
8. Giel, O., Wegener, I.: Evolutionary algorithms and the maximum matching problem. In: Alt, H., Habib, M. (eds.) STACS 2003. LNCS, vol. 2607, pp. 415-426. Springer, Heidelberg (2003) (Pubitemid 137635694)
9. Giel, O., Lehre, P.K.: On the effect of populations in evolutionary multi-objective optimization. In: Proceedings of GECCO 2006, pp. 651-658. ACM, New York (2006)
10. Hajek, B.: Hitting-time and occupation-time bounds implied by drift analysis with applications. Advances in Applied Probability 13, 502-525 (1982)
11. Happ, E., Johannsen, D., Klein, C., Neumann, F.: Rigorous analyses of fitness-proportional selection for optimizing linear functions. In: Proceedings of GECCO 2008, pp. 953-960. ACM, New York (2008)
12. He, J., Yao, X.: Drift analysis and average time complexity of evolutionary algorithms. Artificial Intelligence 127, 57-85 (2001)
13. He, J., Yao, X.: Erratum to: Drift analysis and average time complexity of evolutionary algorithms (artificial intelligence 127, 57-85 (2001)). Artificial Intelligence 140, 245-248 (2002) (Pubitemid 34965462)
14. He, J., Yao, X.: A study of drift analysis for estimating computation time of evolutionary algorithms. Natural Computing 3, 21-35 (2004) (Pubitemid 39127657)
15. Neumann, F., Oliveto, P.S., Witt, C.: Theoretical analysis of fitness-proportional selection: landscapes and efficiency. In: Proceedings of GECCO 2009, pp. 835-842. ACM, New York (2009)
16. Neumann, F., Wegener, I.: Randomized local search, evolutionary algorithms and the minimum spanning tree problem. Theoretical Compututer Science 378, 32-40 (2007) (Pubitemid 46711139)
17. Oliveto, P.S., Witt, C.: Simplified drift analysis for proving lower bounds in evolutionary computation. In: Rudolph, G., Jansen, T., Lucas, S., Poloni, C., Beume, N. (eds.) PPSN 2008. LNCS, vol. 5199, pp. 82-91. Springer, Heidelberg (2008)
18. Wegener, I.: Methods for the analysis of evolutionary algorithms on pseudo-boolean functions. In: Sarker, R., Yao, X., Mohammadian, M. (eds.) Evolutionary Optimization, pp. 349-369. Kluwer, Dordrecht (2002)