Statistical properties analysis of real world tournament selection in genetic algorithms

Applied Intelligence

Volumn 28, Issue 2, 2008, Pages 195-205

  Lee, S ^a   Soak, S ^b   Kim, K ^a   Park, H ^c   Jeon, M ^a  

^a Gwangju Institute of Science and Technology (GIST)   (South Korea)

^b Korea Intellectual Property Office   (South Korea)

^c Georgia Institute of Technology   (United States)

Author keywords

Diversity; Genetic algorithm; Real world tournament selection; Sampling accuracy; Selection pressure

Indexed keywords

GENETIC ALGORITHMS; PRESSURE EFFECTS; PROBLEM SOLVING; RANDOM PROCESSES;

REAL WORLD TOURNAMENT SELECTION (RWTS); SAMPLING ACCURACY; SELECTION PRESSURE;

GAME THEORY;

EID: 38149135833     PISSN: 0924669X     EISSN: None     Source Type: Journal    
DOI: 10.1007/s10489-007-0062-2     Document Type: Article

References (21)

1. Holland JH (1975) Adaptation in natural and artificial system. University of Michigan Press, Ann Arbor
2. Baker JE (1985) Adaptive selection methods for genetic algorithms. In: Proceedings of the 1st international conference on genetic algorithms and their applications, pp 101-111
3. Michalewicz Z (1992) Genetic algorithms∈+∈data structures∈=∈evolution programs. Springer, Berlin
4. Goldberg DE, Klösener KH (1991) A comparative analysis of selection schemes used in genetic algorithms. In: Rawlins G (ed) Foundation of genetic algorithms. Kaufmann, San Mateo, pp 69-93
5. Soak S, Corne D, Ahn B (2004) A powerful new encoding for tree-based combinatorial optimisation problems. In: Lecture notes in computer science, vol 3242, pp 430-439
6. Soak S, Corne D, Ahn B (2004) A new encoding for the degree constrained minimum spanning tree problem. In: Lecture notes in computer science, vol 3213, pp 952-958
7. Soak S, Corne D, Ahn B (2006) The edge-window-decoder representation for tree-based problem. IEEE Trans Evol Comput 10(2):124-144
8. Lee S, Soak S, Mahalik NP, Ahn B, Jeon M (2006) Mathematical and empirical analysis of the real world tournament selection. In: Lecture notes in artificial intelligence, vol 4215, pp 130-137
9. Julstrom BA (1999) It's all the same to me: Revisiting rank-based probabilities and tournaments. In: Proceedings of the congress on evolutionary computation, pp 1501-1505
10. Bäck T (1996) Evolutionary algorithms in theory and practice. Oxford University Press, Oxford
11. Baker JE (1987) Reducting bias and inefficiency in the selection algorithm. In: Grefenstette JJ (ed). Proceedings of the second international conference on genetic algorithms. Kaufmann, San Mateo, pp 14-21
12. Beasley D, Bull DR, Martine RR (1993) An overview of genetic algorithms, part 1: fundamentals. University computing, the bulletin of the IUCC, vol 15, no 2, p 58
13. Rogers A, Bennett AP (1999) Genetic drift in genetic algorithm selection schemes. IEEE Trans Evol Comput 3(4):298-303
14. 2 measure for the performance analysis selection methods in GAs. Evol Comput 9(2):243-256
15. Blickle T, Thiele L (1995) A comparison of selection schemes used in genetic algorithms. Technical Report 11, Swiss Federal Institute of Technology, Zürich, Switzerland
16. Blickle T, Thiele L (1995) A mathematical analysis of tournament selection. In: Proceedings of the 6th international conference on genetic algorithms, pp 9-16
17. Bäck T (1994) Selective pressure in evolutionary algorithms: a characterization of selection mechanisms. In: Proceedings of 1st IEEE conference on evolutionary computation, pp 56-62
18. Papoulis A, Pillai SU (2002) Probability, random variables and stochastic processes, 4th edn. McGraw-Hill, New York, p 361
19. http://www.iwr.uni-heidelberg.de/groups/comopt/software/TSPLIB95/index. html
20. Bean JC (1994) Genetics and random keys for sequencing and optimization. ORSA J Comput 6:154-160
21. Sywerda G (1989) Uniform crossover in genetic algorithms. In: Proceedings of the third international conference on genetic algorithms, George Mason University, USA, pp 2-9