Sharp bounds by probability-generating functions and variable drift

Genetic and Evolutionary Computation Conference, GECCO'11

Volumn , Issue , 2011, Pages 2083-2090

  Doerr, Benjamin ^a   Fouz, Mahmoud ^b   Witt, Carsten ^c  

^a MAX PLANCK INSTITUTE FOR INFORMATICS   (Germany)

^b SAARLAND UNIVERSITY   (Germany)

^c TECHNICAL UNIVERSITY OF DENMARK   (Denmark)

Author keywords

Evolutionary algorithms; Probability generating functions; Quasirandomness; Variable drift

Indexed keywords

DRIFT ANALYSIS; PROBABILITY GENERATING FUNCTIONS; QUASI-RANDOM; QUASI-RANDOMNESS; RUN-TIME ANALYSIS; RUNNING TIME; RUNTIMES; SHARP BOUNDS; UPPER AND LOWER BOUNDS; UPPER BOUND; VARIABLE DRIFT;

PROBABILITY;

EVOLUTIONARY ALGORITHMS;

EID: 84860389742     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2001576.2001856     Document Type: Conference Paper

References (18)

1. M. Abramowitz and I. A. Stegun, editors. Handbook of Mathematical Functions. Dover Publications, 1964.
2. A. Auger and B. Doerr, editors. Theory of Randomized Search Heuristics. World Scientific Pub Co, 2011.
3. J. Cooper and J. Spencer. Simulating a random walk with constant error. Combinatorics, Probability and Computing, 15:815-822, 2006. (Pubitemid 44621825)
4. B. Doerr, T. Friedrich, and T. Sauerwald. Quasirandom rumor spreading. In 19th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 773-781, 2008.
5. B. Doerr, T. Friedrich, and T. Sauerwald. Quasirandom rumor spreading: Expanders, push vs. pull, and robustness. In 36th International Colloquium on Automata, Languages and Programming (ICALP), pages 366-377, 2009.
6. B. Doerr, M. Fouz, and C. Witt. Quasirandom evolutionary algorithms. In Proc. of GECCO '10, pages 1457-1464. ACM Press, 2010a.
7. B. Doerr, D. Johannsen, and C. Winzen. Multiplicative drift analysis. In Proc. of GECCO '10, pages 1449-1456. ACM Press, 2010b.
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. P. Flajolet and R. Sedgewick. Analytic Combinatorics. Cambridge University Press, 2009.
10. T. Friedrich, M. Gairing, and T. Sauerwald. Quasirandom load balancing. In 21st Annual ACM-SIAM Symposium on Discrete Algorithms (SODA'10), pages 1620-1629. SIAM, 2010.
11. R. L. Graham, D. E. Knuth, and O. Patashnik. Concrete Mathematics. Addison Wesley, 1989.
12. J. Jägersküpper. Algorithmic analysis of a basic evolutionary algorithm for continuous optimization. Theoretical Computer Science, 379:329-347, 2007. (Pubitemid 46754584)
13. D. Johannsen. Random Combinatorial Structures and Randomized Search Heuristics. PhD thesis, Universität des Saarlandes, available at http://scidok.sulb.unisaarland.de/volltexte/2011/3529/, 2010.
14. B. Mitavskiy, J. E. Rowe, and C. Cannings. Theoretical analysis of local search strategies to optimize network communication subject to preserving the total number of links. International Journal of Intelligent Computing and Cybernetics, 2:243-284, 2009.
15. F. Neumann and I. Wegener. Randomized local search, evolutionary algorithms, and the minimum spanning tree problem. Theoretical Computer Science, 378:32-40, 2007. (Pubitemid 46711139)
16. J. E. Rowe and N. F. McPhee. The effects of crossover and mutation operators on variable length linear structures. In Proc. of GECCO '01, pages 535-542. Morgan Kaufmann, 2001.
17. D. Sudholt. General lower bounds for the running time of evolutionary algorithms. In Proc. of PPSN '10, volume 6238 of Lecture Notes in Computer Science, pages 124-133, 2010.
18. H. S. Wilf. Generatingfunctionology. Academic Press, 2nd edition, 1994.