Fitness-levels for non-elitist populations

Genetic and Evolutionary Computation Conference, GECCO'11

Volumn , Issue , 2011, Pages 2075-2082

  Lehre, Per Kristian ^a  

^a TECHNICAL UNIVERSITY OF DENMARK   (Denmark)

Author keywords

Evolutionary algorithms; Runtime analysis

Indexed keywords

BENCHMARK FUNCTIONS; LOWER BOUNDS; PARAMETER SETTING; RUN-TIME ANALYSIS; RUNTIMES; SELECTION MECHANISM; SELECTIVE PRESSURE; UPPER BOUND;

EVOLUTIONARY ALGORITHMS;

EID: 84860420428     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2001576.2001855     Document Type: Conference Paper

References (16)

1. T. Chen, J. He, G. Sun, G. Chen, and X. Yao. A new approach for analyzing average time complexity of population-based evolutionary algorithms on unimodal problems. IEEE Trans. on Systems, Man, and Cybernetics, Part B: Cybernetics, 39(5):1092-1106, Oct. 2009.
2. T. H. Cormen, C. E. Leiserson, R. L. Rivest, and C. Stein. Introduction to Algorithms. McGraw Hill, New York, NY, 2nd edition, 2001.
3. S. Droste, T. Jansen, and I. Wegener. On the analysis of the (1+1) Evolutionary Algorithm. Theoretical Computer Science, 276:51-81, 2002.
4. D. E. Goldberg and K. Deb. A comparative analysis of selection schemes used in genetic algorithms. In Foundations of Genetic Algorithms, pages 69-93. Morgan Kaufmann, 1991.
5. E. Happ, D. Johannsen, C. Klein, and F. Neumann. Rigorous analyses of fitness-proportional selection for optimizing linear functions. In Proc. of the 10th annual conference on Genetic and evolutionary computation (GECCO 2008), pages 953-960, New York, NY, USA, 2008. ACM.
6. J. He and X. Yao. Drift analysis and average time complexity of evolutionary algorithms. Artificial Intelligence, 127(1):57-85, March 2001. (Pubitemid 32264935)
7. W. Hoeffding. Probability inequalities for sums of bounded random variables. Journal of the American Statistical Association, 58(301):13-30, 1963.
8. T. Kötzing, F. Neumann, D. Sudholt, and M. Wagner. Simple max-min ant systems and the optimization of linear pseudo-boolean functions. To appear in Proc. of Foundations of Genetic Algorithms (FOGA 2011), 2011.
9. J. Lässig and D. Sudholt. General scheme for analyzing running times of parallel evolutionary algorithms. In Proc. of the 11th international conference on Parallel problem solving from nature: Part I, (PPSN 2010), pages 234-243, Berlin, Heidelberg, 2010. Springer-Verlag.
10. P. K. Lehre. Negative drift in populations. In Proc. of the 11th international conference on Parallel problem solving from nature: Part I, (PPSN 2010), pages 244-253, Berlin, Heidelberg, 2010. Springer-Verlag.
11. P. K. Lehre and X. Yao. On the impact of mutation-selection balance on the runtime of evolutionary algorithms. To appear in IEEE Trans. on Evolutionary Computation, 2011.
12. F. Neumann, P. S. Oliveto, and C. Witt. Theoretical analysis of fitness-proportional selection: landscapes and efficiency. In Proc. of the 11th Annual conference on Genetic and evolutionary computation (GECCO 2009), pages 835-842, New York, NY, USA, 2009. ACM.
13. P. S. Oliveto, J. He, and X. Yao. Time complexity of evolutionary algorithms for combinatorial optimization: A decade of results. Intl. Journal of Automation and Computing, 4(1):100-106, 2007.
14. D. Sudholt. General lower bounds for the running time of evolutionary algorithms. In Proc. of the 11th international conference on Parallel problem solving from nature: Part I, (PPSN 2010), pages 124-133, Berlin, Heidelberg, 2010. Springer-Verlag.
15. 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. (Pubitemid 40219773)
16. C. Witt. Runtime Analysis of the (μ + 1) EA on Simple Pseudo-Boolean Functions. Evolutionary Computation, 14(1):65-86, 2006. (Pubitemid 43955273)