A Comparative Study of Different Variants of Genetic Algorithms for Constrained Optimization
暂无分享,去创建一个
[1] Kalyanmoy Deb,et al. A fast and elitist multiobjective genetic algorithm: NSGA-II , 2002, IEEE Trans. Evol. Comput..
[2] H. Kita,et al. A crossover operator using independent component analysis for real-coded genetic algorithms , 2001, Proceedings of the 2001 Congress on Evolutionary Computation (IEEE Cat. No.01TH8546).
[3] Ruhul A. Sarker,et al. Analyzing the Simple Ranking and Selection Process for Constrained Evolutionary Optimization , 2008, Journal of Computer Science and Technology.
[4] K. Deb. An Efficient Constraint Handling Method for Genetic Algorithms , 2000 .
[5] Zbigniew Michalewicz,et al. Genetic Algorithms + Data Structures = Evolution Programs , 1996, Springer Berlin Heidelberg.
[6] Jani Rönkkönen. ContinuousMultimodal Global Optimization with Differential Evolution-Based Methods , 2009 .
[7] Kalyanmoy Deb,et al. Simulated Binary Crossover for Continuous Search Space , 1995, Complex Syst..
[8] Kalyanmoy Deb,et al. A Computationally Efficient Evolutionary Algorithm for Real-Parameter Optimization , 2002, Evolutionary Computation.
[9] Francisco Herrera,et al. Continuous scatter search: An analysis of the integration of some combination methods and improvement strategies , 2006, Eur. J. Oper. Res..
[10] Gregory W. Corder,et al. Nonparametric Statistics for Non-Statisticians: A Step-by-Step Approach , 2009 .
[11] M. Yamamura,et al. Multi-parent recombination with simplex crossover in real coded genetic algorithms , 1999 .