How Genetic Algorithms Really Work I.mutation and Hillclimbing
暂无分享,去创建一个
[1] Heinz Mühlenbein,et al. The parallel genetic algorithm as function optimizer , 1991, Parallel Comput..
[2] Rajarshi Das,et al. A Study of Control Parameters Affecting Online Performance of Genetic Algorithms for Function Optimization , 1989, ICGA.
[3] H. H. Pattee. Natural automata and useful simulations : proceedings , 1966 .
[4] David E. Goldberg,et al. Genetic Algorithms in Search Optimization and Machine Learning , 1988 .
[5] Terence C. Fogarty,et al. Varying the Probability of Mutation in the Genetic Algorithm , 1989, ICGA.
[6] Heinz Mühlenbein,et al. Parallel Genetic Algorithms, Population Genetics, and Combinatorial Optimization , 1989, Parallelism, Learning, Evolution.
[7] H. Grüneberg,et al. Introduction to quantitative genetics , 1960 .
[8] Heinz Mühlenbein,et al. Evolution in Time and Space - The Parallel Genetic Algorithm , 1990, FOGA.
[9] Martina Gorges-Schleuter,et al. Genetic algorithms and population structures: a massively parallel algorithm , 1991 .
[10] John J. Grefenstette,et al. Optimization of Control Parameters for Genetic Algorithms , 1986, IEEE Transactions on Systems, Man, and Cybernetics.
[11] Kalyanmoy Deb,et al. Messy Genetic Algorithms: Motivation, Analysis, and First Results , 1989, Complex Syst..
[12] Ingo Rechenberg,et al. Evolutionsstrategie : Optimierung technischer Systeme nach Prinzipien der biologischen Evolution , 1973 .
[13] Reinhard Männer,et al. Towards an Optimal Mutation Probability for Genetic Algorithms , 1990, PPSN.
[14] L. Darrell Whitley,et al. Fundamental Principles of Deception in Genetic Search , 1990, FOGA.