Fixed budget computations: A different perspective on run time analysis

GECCO'12 - Proceedings of the 14th International Conference on Genetic and Evolutionary Computation

Volumn , Issue , 2012, Pages 1325-1332

  Jansen, Thomas ^a   Zarges, Christine ^b  

^a UNIVERSITY COLLEGE CORK   (Ireland)

^b UNIVERSITY OF WARWICK   (United Kingdom)

Author keywords

(1+1) ea; fixed budget computation; leadingones; onemax; random local search; runtime analysis

Indexed keywords

(1+1) EA; FIXED BUDGET; LEADINGONES; LOCAL SEARCH; ONEMAX; RUN-TIME ANALYSIS;

BUDGET CONTROL; EVOLUTIONARY ALGORITHMS; HEURISTIC ALGORITHMS; PROBLEM SOLVING;

QUALITY CONTROL;

EID: 84864651497     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2330163.2330347     Document Type: Conference Paper

References (11)

1. A. Auger and B. Doerr, editors. Theory of Randomized Search Heuristics. World Scientific, 2011.
2. E. Cantu-Paz and D. E. Goldberg. Are multiple runs of genetic algorithms better than one? In Proc. of the Genetic and Evolutionary Computation Conference (GECCO 2003), pages 801-812, 2003.
3. B. Doerr. Analyzing randomized search heuristics: Tools from probability theory. In A. Auger and B. Doerr, editors, Theory of Randomized Search Heuristics. World Scientific, 2011.
4. B. Doerr, M. Fouz, and C. Witt. Sharp bounds by probability-generating functions and variable drift. In Proc. of the Genetic and Evolutionary Computation Conference (GECCO 2011), pages 2083-2090, 2011.
5. B. Doerr, T. Jansen, and C. Klein. Comparing global and local mutations on bit strings. In Proc. of the Genetic and Evolutionary Computation Conference (GECCO 2008), pages 929-936, 2008.
6. B. Doerr, F. Neumann, D. Sudholt, and C. Witt. Runtime analysis of the 1-ant ant colony optimizer. Theoretical Comp. Science, 412(17):1629-1644, 2011.
7. S. Droste, T. Jansen, and I. Wegener. On the analysis of the (1+1) evolutionary algorithm. Theoretical Comp. Science, 276(1-2):51-81, 2002.
8. T. Jansen and C. Zarges. Analysis of evolutionary algorithms: From computational complexity analysis to algorithm engineering. In 11th ACM SIGEVO Workshop on Foundations of Genetic Algorithms (FOGA 2011), pages 1-14, 2011.
9. M. Mitzenmacher and E. Upfal. Probability and Computing: Randomized Algorithms and Probabilistic Analysis. Cambridge University Press, 2005.
10. D. Sudholt and C. Witt. Runtime analysis of a binary particle swarm optimizer. Theoretical Comp. Science, 411(21):2084-2100, 2010.
11. Y. Yu, X. Yao, and Z.-H. Zhou. On the approximation ability of evolutionary optimization with application to minimum set cover. Artificial Intelligence, 2012. To appear. http://dx.doi.org/10.1016/j.artint.2012.01.001.