A note on the variance of rank-based selection strategies for genetic algorithms and genetic programming

Genetic Programming and Evolvable Machines

Volumn 8, Issue 3, 2007, Pages 221-237

  Sokolov, Artem ^a   Whitley, Darrell ^a   Da Motta Salles Barreto, Andre' ^b  

^a Department of Computer Science   (United States)

^b FEDERAL UNIVERSITY OF RIO DE JANEIRO   (Brazil)

Author keywords

Genetic algorithms; Genetic programming; Rank based selection; Selective pressure; Tournament selection

Indexed keywords

POPULATION DIVERSITY; RANK-BASED SELECTION; TOURNAMENT SELECTION;

GENETIC PROGRAMMING; MUTAGENESIS; POPULATION STATISTICS; PRESSURE EFFECTS;

GENETIC ALGORITHMS;

EID: 34547864177     PISSN: 13892576     EISSN: None     Source Type: Journal    
DOI: 10.1007/s10710-007-9030-1     Document Type: Article

References (19)

1. Anderson, C.W.: Learning and Problem Solving with Multilayer Connectionist Systems. PhD thesis, Computer and Information Science, University of Massachusetts (1986)
2. Blickle, T., Thiele, L.: A comparison of selection schemes used in genetic algorithms. Technical Report 11, Swiss Federal Institute of Technology (ETH), Computer Engineering and Communication Networks Lab, Zurich, Switzerland, December (1995)
3. Blickle, T., Thiele, L.: A comparison of selection schemes used in evolutionary algorithms. Evolutionary Computation, 4(4), 361-394, (1997)
4. Fogel, D.B.; Evolving Artificial Intelligence. PhD thesis, University of California, San Diego, San Diego, CA (1992)
5. Goldberg, D., Deb, K.: A comparative analysis of selection schemes used in genetic algorithms. In: G.J.E. Rawlins (ed.) Foundations of Genetic Algorithms, pp. 69-93. San Mateo, California (1991) Morgan Kaufmann
6. Julstrom, B.A., Raidl, G.R. Weight-biased edge-crossover in evolutionary algorithms for two graph problems. In Proceedings of the 2001 ACM Symposium on Applied Computing, pp. 321-326 (2001)
7. Koza, J.R.: Genetic Programming: On the Programming of Computers by Means of Natural Selection. MIT Press Cambridge, MA (1992)
8. Koza John R.: Genetic programming II: automatic discovery of reusable programs. MIT Press, Cambridge, MA, USA (1994)
9. Motoki, T.: Calculating the expected loss of diversity of selection schemes. Evol Comput 10(4), 397-422 (2002)
10. Poli, R.: Tournament selection, iterated coupon-collection problem, and backward-chaining evolutionary algorithms. In Foundations of Genetic Algorithms, pp. 132-155. Springer (2005)
11. Reinelt, G.: The Traveling Salesman: Computational Solutions for TSP Applications. Springer, Berlin (1994)
12. Schwefel, H.-P.: Evolution and Optimum Seeking. Wiley, New York (1995)
13. Sokolov, A., Whitley, D.: Unbiased tournament selection. In Proceedings of the 7th Genetic and Evolutionary Computation Conference, pp. 1131-1138 (2005)
14. Suh, J.Y., Van Gucht, D.: Distributed Genetic Algorithms. Technical report, Indiana University, Bloomington, Indiana (1987)
15. Syswerda, G.: Uniform Crossover in Genetic Algorithms. In: Schaffer, J.D. (ed.) Proceedings of The Third International Conference on Genetic Algorithms. Morgan Kaufmann (1989)
16. Whitley, D.: The genitor algorithm and selection pressure: Why rank-based allocation of reproductive trials is best. In: Proceedings of The Third International Conference on Genetic Algorithms, pp. 116-121. San Mateo, California, ISA (1989) Morgan Kaufmann Publishers
17. Whitley, D., Dominic, S., Das, R., Anderson, C.W.: Genetic reinforcement learning for neurocontrol problems. Mach. Learn. 13(2-3),259-284 (1993)
18. Whitley, D., Kauth, J.: GENITOR: A Different Genetic Algorithm. In: Proceedings of the 1988 Rocky Mountain Conference on Artificial Intelligence (1988)
19. Whitley, D., Rana, S., Dzubera, J., Mathias, K.E.: Evaluating evolutionary algorithms. Arti. Intelligence 85, 245-276 (1996)