When do evolutionary algorithms optimize separable functions in parallel?

FOGA 2013 - Proceedings of the 12th ACM Workshop on Foundations of Genetic Algorithms

Volumn , Issue , 2013, Pages 51-63

  Doerr, Benjamin ^a   Sudholt, Dirk ^b   Witt, Carsten ^c  

^a MAX PLANCK INSTITUTE FOR INFORMATICS   (Germany)

^b UNIVERSITY OF SHEFFIELD   (United Kingdom)

^c TECHNICAL UNIVERSITY OF DENMARK   (Denmark)

Author keywords

Linear functions; Pseudo boolean optimization; Runtime analysis; Separable functions; Theory

Indexed keywords

BLACK-BOX OPTIMIZATION; LINEAR FUNCTIONS; NONNEGATIVE INTEGERS; PARALLEL OPTIMIZATION; PSEUDO-BOOLEAN OPTIMIZATION; RUN-TIME ANALYSIS; SEQUENTIAL OPTIMIZATION; THEORY;

GENETIC ALGORITHMS; OPTIMIZATION;

BOOLEAN FUNCTIONS;

EID: 84875986954     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2460239.2460245     Document Type: Conference Paper

References (27)

1. A. Auger and B. Doerr. Theory of Randomized Search Heuristics. World Scientific, 2011.
2. K. De Jong. An Analysis of the Behavior of a Class of Genetic Adaptive Systems. PhD thesis, University of Michigan, Dept. of Computer and Communication Sciences, Ann Arbor, Michigan, 1975.
3. B. Doerr and L. Goldberg. Drift analysis with tail bounds. In Proceedings of Parallel Problem Solving from Nature (PPSN XI), Part I, LNCS 6238, pages 174-183. Springer, 2010.
4. B. Doerr and L. A. Goldberg. Adaptive drift analysis. Algorithmica, 2012. To appear, http://dx.doi.org/10.1007/s00453-011-9585-3.
5. B. Doerr, D. Johannsen, and C. Winzen. Multiplicative drift analysis. In Proceedings of Genetic and Evolutionary Computation Conference (GECCO 2010), pages 1449-1456. ACM, 2010.
6. B. Doerr and S. Pohl. Run-time analysis of the (1+1) evolutionary algorithm optimizing linear functions over a finite alphabet. In Proceedings of the Genetic and Evolutionary Computation Conference (GECCO 2012), pages 1317-1324. ACM Press, 2012.
7. S. Droste, T. Jansen, and I. Wegener. A rigorous complexity analysis of the (1+1) evolutionary algorithm for separable functions with Boolean inputs. Evolutionary Computation, 6(2):185-196, 1998.
8. S. Droste, T. Jansen, and I. Wegener. On the analysis of the (1+1) evolutionary algorithm. Theoretical Computer Science, 276:51-81, 2002.
9. D. E. Goldberg. Genetic Algorithms in Search Optimization and Machine Learning. Addison-Wesley, 1989.
10. J. He and X. Yao. Drift analysis and average time complexity of evolutionary algorithms. Artificial Intelligence, 127:51-81, 2001.
11. J. Jägersküpper. A blend of Markov-chain and drift analysis. In Proceedings of Parallel Problem Solving from Nature (PPSN X), LNCS 5199, pages 41-51. Springer, 2008.
12. T. Jansen and R. P. Wiegand. The cooperative coevolutionary (1+1) EA. Evolutionary Computation, 12(4):405-434, 2004.
13. T. Jansen and C. Zarges. Fixed budget computations: A different perspective on run time analysis. In Proceedings of the Genetic and Evolutionary Computation Conference (GECCO 2012), pages 1325-1332. ACM Press, 2012.
14. J. Lässig and D. Sudholt. The benefit of migration in parallel evolutionary algorithms. In Proceedings of the Genetic and Evolutionary Computation Conference (GECCO 2010), pages 1105-1112. ACM Press, 2010.
15. M. Mitchell, S. Forrest, and J. H. Holland. The royal road for genetic algorithms: Fitness landscapes and GA performance. In Proceedings of the First European Conference on Artificial Life, pages 245-254. MIT Press, 1991.
16. M. Mitzenmacher and E. Upfal. Probability and Computing. Cambridge University Press, 2005.
17. R. Motwani and P. Raghavan. Randomized Algorithms. Cambridge University Press, 1995.
18. M. Potter and K. De Jong. A cooperative coevolutionary approach to function optimization. In Parallel Problem Solving from Nature - PPSN III, volume 866 of LNCS, pages 249-257. Springer, 1994.
19. D. Sudholt. General lower bounds for the running time of evolutionary algorithms. In Proceedings of Parallel Problem Solving from Nature (PPSN XI), Part I, LNCS 6238, pages 124-133. Springer, 2010.
20. D. Sudholt. Crossover speeds up building-block assembly. In Proceedings of the Genetic and Evolutionary Computation Conference (GECCO 2012), pages 689-696. ACM Press, 2012.
21. K. Táng, X. Li, P. N. Suganthan, Z. Yáng, and T. Weise. Benchmark Functions for the CEC'2010 Special Session and Competition on Large-Scale Global Optimization. Technical report, University of Science and Technology of China (USTC), School of Computer Science and Technology, Nature Inspired Computation and Applications Laboratory (NICAL): H́ef́ei, Anhui, China, 2010.
22. 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.
23. I. Wegener and C. Witt. On the analysis of a simple evolutionary algorithm on quadratic pseudo-boolean functions. Journal of Discrete Algorithms, 3(1):61-78, 2005.
24. I. Wegener and C. Witt. On the optimization of monotone polynomials by simple randomized search heuristics. Combinatorics, Probability & Computing, 14(1-2):225-247, 2005.
25. D. Whitley, K. Mathias, S. Rana, and J. Dzubera. Evaluating evolutionary algorithms. Artificial Intelligence, 85:245-276, 1996.
26. C. Witt. Tight bounds on the optimization time of a randomized search heuristic on linear functions. Combinatorics, Probability and Computing, 22(2):294-318, 2013.
27. A. H. Wright, M. D. Vose, and J. E. Rowe. Implicit parallelism. In Proceedings of the 2003 international conference on Genetic and evolutionary computation: Part II, GECCO'03, pages 1505-1517. Springer, 2003.