论文信息 - Self-configuring Genetic Algorithm with Modified Uniform Crossover Operator

Self-configuring Genetic Algorithm with Modified Uniform Crossover Operator

For genetic algorithms, new variants of the uniform crossover operator that introduce selective pressure on the recombination stage are proposed. Operator probabilistic rates based approach to genetic algorithms self-configuration is suggested. The usefulness of the proposed modifications is demonstrated on benchmark tests and real world problems.

Eugene Semenkin | Maria Semenkina

[1] Jonatan Gómez,et al. Self Adaptation of Operator Rates in Evolutionary Algorithms , 2004, GECCO.

[2] Zbigniew Michalewicz,et al. Parameter Setting in Evolutionary Algorithms , 2007, Studies in Computational Intelligence.

[3] Riccardo Poli,et al. Genetic and Evolutionary Computation – GECCO 2004 , 2004, Lecture Notes in Computer Science.

[4] Marimuthu Palaniswami,et al. Computational Intelligence: A Dynamic System Perspective , 1995 .

[5] Gilbert Syswerda,et al. Uniform Crossover in Genetic Algorithms , 1989, ICGA.

[6] Randy L. Haupt,et al. Practical Genetic Algorithms , 1998 .

[7] Hans-Georg Beyer,et al. Self-Adaptation in Evolutionary Algorithms , 2007, Parameter Setting in Evolutionary Algorithms.

[8] Robert Schaefer. Parallel Problem Solving from Nature - PPSN XI, 11th International Conference, Kraków, Poland, September 11-15, 2010. Proceedings, Part II , 2010, PPSN.

[9] Jih-Jeng Huang,et al. Two-stage genetic programming (2SGP) for the credit scoring model , 2006, Appl. Math. Comput..

[10] W. Spears,et al. On the Virtues of Parameterized Uniform Crossover , 1995 .

[11] A. E. Eiben,et al. Introduction to Evolutionary Computing , 2003, Natural Computing Series.