Choosing selection pressure for wide-gap problems

Theoretical Computer Science

Volumn 411, Issue 6, 2010, Pages 926-934

  Chen, Tianshi ^a   He, Jun ^b   Chen, Guoliang ^a   Yao, Xin ^a,c  

^a UNIVERSITY OF SCIENCE AND TECHNOLOGY OF CHINA   (China)

^b ABERYSTWYTH UNIVERSITY   (United Kingdom)

^c UNIVERSITY OF BIRMINGHAM   (United Kingdom)

Author keywords

Evolutionary algorithm; Evolutionary computation theory; First hitting time; Markov chain; Selection pressure

Indexed keywords

EVOLUTIONARY COMPUTATIONS; FIRST HITTING TIME; MARKOV CHAIN; SELECTION PRESSURE; SELECTION PRESSURES;

COMPUTATION THEORY; CONVERGENCE OF NUMERICAL METHODS; MARKOV PROCESSES;

EVOLUTIONARY ALGORITHMS;

EID: 74149085083     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2009.12.014     Document Type: Article

References (24)

1. Alba E., and Dorronsoro B. The exploration/exploitation tradeoff in dynamic cellular genetic algorithms. IEEE Trans. Evol. Comput. 9 2 (2005) 126-142
2. T. Bäck, Selective pressure in evolutionary algorithms: A characterization of selection mechanisms, in: D. Fogel, (Ed.), Proc. 1st IEEE Conf. Evol. Comput., Orlando, FL, 1994, pp. 57-62
3. Chen T., He J., Sun G., Chen G., and Yao X. A new approach to analyzing average time complexity of population-based evolutionary algorithms on unimodal problems. IEEE Trans. Syst., Man, and Cybern., Part B 39 5 (2009) 1092-1106
4. T. Blickle, L. Thiele, A comparison of selection schemes used in genetic algorithms, Technical Report No. 11. Gloriastrasse 35, CH-8092 Zurich: Swiss Federal Institute of Technology (ETH) Zurich, Computer Engineering and Communications Networks Lab (TIK), 1995
5. Droste S., Jansen T., and Wegener I. On the analysis of the (1+1) evolutionary algorithm. Theor. Comput. Sci. 276 1-2 (2002) 51-81
6. Garnier J., Kallel L., and Schoenauer M. Rigorous hitting times for binary mutations. Evol. Comput. 7 2 (1999) 173-203
7. Goldberg D.E., and Deb K. A comparative analysis of selection scheme used in genetic algorithms. In: Rawlings G.J.E. (Ed). Foundations of Genetic Algorithms (1991), Morgan Kaufmann, San Mateo, CA 69-93
8. He J., and Kang L.S. On the convergence rate of genetic algorithms. Theor. Comput, Sci. 229 1-2 (1999) 23-39
9. He J., and Yao X. Drift analysis and average time complexity of evolutionary algorithms. Artif. Intell. 127 1 (2001) 57-85
10. He J., and Yao X. From an individual to a population: An analysis of the first hitting time of population-based evolutionary algorithms. IEEE Trans. Evol. Comput. 6 5 (2002) 495-511
11. He J., and Yao X. Towards an analytic framework for analysing the computation time of evolutionary algorithms. Artif. Intell. 145 1-2 (2003) 59-97
12. He J., and Yao X. A study of drift analysis for estimating computation time of evolutionary algorithms. Natur. Comput. 1 3 (2004) 21-35
13. He J., Yao X., and Li J. A comparative study of three evolutionary algorithms incorporating different amount of domain knowledge for node covering problems. IEEE Trans. Syst., Man, Cybern.- Part C 35 2 (2005) 266-271
14. J. He, C. Reeves, X. Yao, A discussion on posterior and prior measures of problem diffciulties, in: Proc. PPSN IX Workshop on Evolutionary Algorithms - Bridging Theory and Practice, 2006
15. He J., Reeves C., Witt C., and Yao X. A note on problem difficulty measures in black-box optimization: Classification, realizations and predictability. Evol. Comput. 15 4 (2007) 435-444
16. Hutter M., and Legg S. Fitness uniform optimization. IEEE Trans. Evol. Comput. 10 5 (2006) 568-589
17. Jansen T., Jong K.A.D., and Wegener I. On the choice of the offspring population size in evolutionary algorithms. Evol. Comput. 13 4 (2005) 413-440
18. Khuri S., Bäck T., and Heitkotter J. An evolutionary approach to combinatorial optimization problems. In: Cizmar D. (Ed). Proc. 22nd Ann. ACM Comput. Sci. Conf. (1994), ACM Press, New York 66-73
19. Syski R. Passage Times for Markov Chains (1992), IOS Press, Amsterdam
20. Oliveto P.S., He J., and Yao X. Time complexity of evolutionary algorithms for combinatorial optimization: A decade of results. Int. J. Auto. and Comput. 4 3 (2007) 281-293
21. Rogers A., and Prügel-Bennett A. Genetic drift in genetic algorithm selection schemes. IEEE Trans. Evol. Comput. 3 4 (1999) 298-303
22. D. Whitley, The GENITOR algorithm and selection pressure: why rank-based allocation of reproductive trials is best, in: Proc. 3rd Int. Conf. Genetic Algorithms, San Mateo, CA, 1989, pp. 116-123
23. D. Whitley, A.M. Sutton, A.E. Howe, Understanding elementary landscapes, in: Proc. GECCO'08, 2008, pp. 585-592
24. Yu Y., and Zhou Z.-H. A new approach to estimating the expected first hitting time of evolutionary algorithms. Artif. Intell. 172 15 (2008) 1809-1832