Optimizing linear functions with randomized search heuristics - The robustness of mutation

Leibniz International Proceedings in Informatics, LIPIcs

Volumn 14, Issue , 2012, Pages 420-431

  Witt, Carsten ^a  

^a TECHNICAL UNIVERSITY OF DENMARK   (Denmark)

Author keywords

Evolutionary Algorithms; Linear Functions; Randomized Search Heuristics; Running Time Analysis

Indexed keywords

EXPECTED OPTIMIZATION TIME; LARGE NEIGHBORHOOD; LINEAR FUNCTIONS; MUTATION PROBABILITY; POLYNOMIAL OPTIMIZATION; RANDOMIZED SEARCH HEURISTICS; RUNNING TIME ANALYSIS; UPPER AND LOWER BOUNDS;

COMPUTER SCIENCE; EVOLUTIONARY ALGORITHMS; HEURISTIC ALGORITHMS; RANDOM PROCESSES;

OPTIMIZATION;

EID: 84880318417     PISSN: 18688969     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.4230/LIPIcs.STACS.2012.420     Document Type: Conference Paper

References (20)

1. Anne Auger and Benjamin Doerr. Theory of Randomized Search Heuristics - Foundations and Recent Developments. World Scientific Publishing, 2011.
2. Thomas Bäck. Optimal mutation rates in genetic search. In Proc. of ICGA '93, pages 2-8. Morgan Kaufmann, 1993.
3. Benjamin Doerr, Mahmoud Fouz, and Carsten Witt. Quasirandom evolutionary algorithms. In Proc. of GECCO '10, pages 1457-1464. ACM Press, 2010.
4. Benjamin Doerr, Mahmoud Fouz, and Carsten Witt. Sharp bounds by probability-generating functions and variable drift. In Proc. of GECCO '11, pages 2083-2090. ACM Press, 2011.
5. Benjamin Doerr and Leslie Ann Goldberg. Adaptive drift analysis. Algorithmica, 2012. To appear; preprint: http://arxiv.org/abs/1108.0295.
6. Benjamin Doerr, Daniel Johannsen, and Carola Winzen. Drift analysis and linear functions revisited. In Proc. of CEC '10, pages 1-8. IEEE Press, 2010.
7. Benjamin Doerr, Daniel Johannsen, and Carola Winzen. Multiplicative drift analysis. In Proc. of GECCO '10, pages 1449-1456. ACM Press, 2010.
8. Stefan Droste, Thomas Jansen, and Ingo Wegener. A natural and simple funtions which is hard for all evolutionary algorithms. In Proc. of IECON '00, pages 2704-2709, 2000. DOI: 10.1109/IECON.2000.972425.
9. Stefan Droste, Thomas Jansen, and Ingo Wegener. On the analysis of the (1+1) evolutionary algorithm. Theoretical Computer Science, 276: 51-81, 2002.
10. Bruce Hajek. Hitting-time and occupation-time bounds implied by drift analysis with applications. Advances in Applied Probability, 13(3): 502-525, 1982.
11. Jun He and Xin Yao. Drift analysis and average time complexity of evolutionary algorithms. Artificial Intelligence, 127: 57-85, 2001.
12. Jun He and Xin Yao. A study of drift analysis for estimating computation time of evolutionary algorithms. Natural Computing, 3(1): 21-35, 2004.
13. Jens Jägersküpper. A blend of markov-chain and drift analysis. In Proc. of PPSN '08, volume 5199 of LNCS, pages 41-51. Springer, 2008.
14. Rajeev Motwani and Prabhakar Raghavan. Randomized Algorithms. Cambridge University Press, 1995.
15. Heinz Mühlenbein. How genetic algorithms really work: I. Mutation and hillclimbing. In Proc. of PPSN '92, pages 15-26. Elsevier, 1992.
16. Frank Neumann and Carsten Witt. Bioinspired Computation in Combinatorial Optimization - Algorithms and Their Computational Complexity. Natural Computing Series. Springer, 2010.
17. Dirk Sudholt. General lower bounds for the running time of evolutionary algorithms. In Proc. of PPSN '10, volume 6238 of LNCS, pages 124-133. Springer, 2010. Extended version: http://arxiv.org/abs/1109.1504.
18. Ingo Wegener. Methods for the analysis of evolutionary algorithms on pseudo-Boolean functions. In Ruhul Sarker, Masoud Mohammadian, and Xin Yao, editors, Evolutionary Optimization. Kluwer Academic Publishers, 2001.
19. Ingo Wegener and Carsten Witt. On the analysis of a simple evolutionary algorithm on quadratic pseudo-boolean functions. Journal of Discrete Algorithms, 3(1): 61-78, 2005.
20. Ingo Wegener and Carsten Witt. On the optimization of monotone polynomials by simple randomized search heuristics. Combinatorics, Probability & Computing, 14(1-2): 225-247, 2005.