On the impact of mutation-selection balance on the runtime of evolutionary algorithms

IEEE Transactions on Evolutionary Computation

Volumn 16, Issue 2, 2012, Pages 225-241

  Lehre, Per Kristian ^a   Yao, Xin ^b  

^a TECHNICAL UNIVERSITY OF DENMARK   (Denmark)

^b UNIVERSITY OF BIRMINGHAM   (United Kingdom)

Author keywords

Computational complexity; evolutionary computation; randomized heuristics; runtime analysis of evolutionary algorithms; selection pressure

Indexed keywords

ANALYTICAL TOOL; EVOLUTIONARY ALGORITHMS (EAS); FITNESS FUNCTIONS; LINEAR RANKING; MULTI-TYPE BRANCHING; MUTATION RATES; OPTIMAL SOLUTIONS; PARAMETER CHOICE; POLYNOMIAL-TIME; RANDOMIZED HEURISTICS; RUN-TIME ANALYSIS; RUNTIMES; SELECTION PRESSURES;

COMPUTATIONAL COMPLEXITY; POLYNOMIAL APPROXIMATION;

EVOLUTIONARY ALGORITHMS;

EID: 84859712665     PISSN: 1089778X     EISSN: None     Source Type: Journal    
DOI: 10.1109/TEVC.2011.2112665     Document Type: Article

References (31)

1. T. B̈ack, "Selective pressure in evolutionary algorithms: A characterization of selection mechanisms," in Proc. 1st IEEE CEC, Jun. 1994, pp. 57-62.
2. T. Blickle and L. Thiele, "A comparison of selection schemes used in evolutionary algorithms," Evol. Comput., vol. 4, no. 4, pp. 361-394, 1996. (Pubitemid 126706163)
3. E. Cant́u-Paz, "Order statistics and selection methods of evolutionary algorithms," Information Process. Lett., vol. 82, no. 1, pp. 15-22, 2002. (Pubitemid 34110161)
4. 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. Syst. Man Cybern. Part B: Cybern., vol. 39, no. 5, pp. 1092-1106, Oct. 2009.
5. B. Doerr and D. Johannsen, "Refined runtime analysis of a basic ant colony optimization algorithm," in Proc. IEEE CEC, Sep. 2007, pp. 501-507.
6. B. Doerr, F. Neumann, D. Sudholt, and C. Witt, "On the runtime analysis of the 1-ANT ACO algorithm," in Proc. 9th Annu. Conf. GECCO, 2007, pp. 33-40. (Pubitemid 47291481)
7. S. Droste, T. Jansen, and I. Wegener, "On the analysis of the (1+1) evolutionary algorithm," Theor. Comput. Sci., vol. 276, nos. 1-2, pp. 51-81, 2002.
8. A. E. Eiben and C. A. Schippers, "On evolutionary exploration and exploitation," Fundamenta Informaticae, vol. 35, nos. 1-4, pp. 35-50, 1998. (Pubitemid 128435957)
9. D. E. Goldberg and K. Deb, "A comparative analysis of selection schemes used in genetic algorithms," in Foundations of Genetic Algorithms. San Fransisco, CA: Morgan Kaufmann, 1991, pp. 69-93.
10. P. Haccou, P. Jagers, and V. Vatutin, Branching Processes: Variation, Growth, and Extinction of Populations (Cambridge Studies in Adaptive Dynamics). Cambridge, MA: Cambridge University Press, 2005.
11. E. Happ, D. Johannsen, C. Klein, and F. Neumann, "Rigorous analyses of fitness-proportional selection for optimizing linear functions," in Proc. 10th Annu. GECCO, 2008, pp. 953-960.
12. J. He and X. Yao, "From an individual to a population: An analysis of the first hitting time of population-based evolutionary algorithms," IEEE Trans. Evol. Comput., vol. 6, no. 5, pp. 495-511, Oct. 2002. (Pubitemid 35327565)
13. J. He and X. Yao, "A study of drift analysis for estimating computation time of evolutionary algorithms," Natural Comput., vol. 3, no. 1, pp. 21-35, 2004. (Pubitemid 39127657)
14. J. J̈agersk̈upper and C. Witt, "Rigorous runtime analysis of a (μ+1) ES for the sphere function," in Proc. GECCO, 2005, pp. 849-856. (Pubitemid 43226385)
15. T. Jansen, K. A. De Jong, and I. Wegener, "On the choice of the offspring population size in evolutionary algorithms," Evol. Comput., vol. 13, no. 4, pp. 413-440, 2005. (Pubitemid 43955277)
16. L. Y. Kolotilina, "Bounds and inequalities for the Perron root of a nonnegative matrix," J. Math. Sci., vol. 121, no. 4, pp. 2481-2507, Nov. 2004. (Pubitemid 38707489)
17. P. K. Lehre, "Negative drift in populations," in Proc. 11th PPSN, LNCS 6238. 2011, pp. 244-253.
18. P. K. Lehre and X. Yao, "On the impact of the mutation-selection balance on the runtime of evolutionary algorithms," in Proc. 10th ACM SIGEVO Workshop FOGA, 2009, pp. 47-58.
19. H. Minc, "On the maximal eigenvector of a positive matrix," SIAM J. Numer. Anal., vol. 7, no. 3, pp. 424-427, 1970.
20. T. Motoki, "Calculating the expected loss of diversity of selection schemes," Evol. Comput., vol. 10, no. 4, pp. 397-422, 2002.
21. R. Motwani and P. Raghavan, Randomized Algorithms. Cambridge, MA: Cambridge University Press, 1995.
22. F. Neumann, P. S. Oliveto, and C. Witt, "Theoretical analysis of fitnessproportional selection: Landscapes and efficiency," in Proc. 11th Annu. GECCO, 2009, pp. 835-842.
23. F. Neumann and C. Witt, "Runtime analysis of a simple ant colony optimization algorithm," in Proc. 17th ISAAC, LNCS 4288. 2006, pp. 618-627.
24. R. Sarker, M. Mohammadian, and X. Yao, Eds., Evolutionary Optimization. Dordrecht, The Netherlands: Kluwer Academic, 2002.
25. D. Schlierkamp-Voosen, "Predictive models for the breeder genetic algorithm," Evol. Comput., vol. 1, no. 1, pp. 25-49, 1993.
26. E. Seneta, Non-Negative Matrices. London, U.K.: George Allen and Unwin Ltd., 1973.
27. T. Storch, "On the choice of the parent population size," Evol. Comput., vol. 16, no. 4, pp. 557-578, 2008.
28. I. Wegener, "Simulated annealing beats metropolis in combinatorial optimization," in Proc. 32nd ICALP, LNCS 3580. 2005, pp. 589-601. (Pubitemid 41436131)
29. D. Whitley, "The GENITOR algorithm and selection pressure: Why rank-based allocation of reproductive trials is best," in Proc. 3rd Int. Conf. Genet. Algorithms, 1989, pp. 589-601.
30. C. Witt, "Runtime analysis of the (μ + 1) EA on simple pseudo-Boolean functions," Evol. Comput., vol. 14, no. 1, pp. 65-86, 2006. (Pubitemid 43955273)
31. C. Witt, "Population size versus runtime of a simple evolutionary algorithm," Theor. Comput. Sci., vol. 403, no. 1, pp. 104-120, 2008.