Theoretical Analysis of Simplex Crossover for Real-Coded Genetic Algorithms
暂无分享,去创建一个
[1] J. D. Schaffer,et al. Real-Coded Genetic Algorithms and Interval-Schemata , 1992, FOGA.
[2] Jean-Michel Renders,et al. Hybridizing genetic algorithms with hill-climbing methods for global optimization: two possible ways , 1994, Proceedings of the First IEEE Conference on Evolutionary Computation. IEEE World Congress on Computational Intelligence.
[3] Ralf Salomon,et al. Performance Degradation of Genetic Algorithms under Coordinate Rotation , 1996, Evolutionary Programming.
[4] Thomas Bäck,et al. Evolutionary Algorithms in Theory and Practice , 1996 .
[5] Hiroaki Satoh,et al. Minimal generation gap model for GAs considering both exploration and exploitation , 1996 .
[6] Thomas Bäck,et al. Evolutionary algorithms in theory and practice - evolution strategies, evolutionary programming, genetic algorithms , 1996 .
[7] Isao Ono,et al. A Real Coded Genetic Algorithm for Function Optimization Using Unimodal Normal Distributed Crossover , 1997, ICGA.
[8] S. Kobayashi,et al. Theoretical analysis of the unimodal normal distribution crossover for real-coded genetic algorithms , 1998, 1998 IEEE International Conference on Evolutionary Computation Proceedings. IEEE World Congress on Computational Intelligence (Cat. No.98TH8360).
[9] M. Yamamura,et al. Multi-parent recombination with simplex crossover in real coded genetic algorithms , 1999 .
[10] S. Kobayashi,et al. Multi-parental extension of the unimodal normal distribution crossover for real-coded genetic algorithms , 1999, Proceedings of the 1999 Congress on Evolutionary Computation-CEC99 (Cat. No. 99TH8406).
[11] M. Yamamura,et al. A functional specialization hypothesis for designing genetic algorithms , 1999, IEEE SMC'99 Conference Proceedings. 1999 IEEE International Conference on Systems, Man, and Cybernetics (Cat. No.99CH37028).