The virtual gene genetic algorithm

作者: Manuel Valenzuela-Rendón

DOI: 10.1007/3-540-45110-2_18

关键词:

摘要: This paper presents the virtual gene genetic algorithm (vgGA) which is a generalization of traditional algorithms that use binary linear chromosomes. In vgGA, one point crossover and mutation are implemented as arithmetic functions over integers or reals chromosome represents. implementation allows to chromosomes alphabets any cardinality. Also, sites where fall can be generalized in vgGA values do not necessarily correspond positions between bits digits another base, thus implementing digits. Preliminary results indicate outperforms GA with on integer real valued problems underlying structure presented.

参考文章(8)
Zbigniew Michalewicz, Genetic algorithms + data structures = evolution programs (2nd, extended ed.) Springer-Verlag New York, Inc.. ,(1994)
Larry J. Eshelman, J. David Schaffer, Real-Coded Genetic Algorithms and Interval-Schemata foundations of genetic algorithms. ,vol. 2, pp. 187- 202 ,(1993) , 10.1016/B978-0-08-094832-4.50018-0
David E. Goldberg, Kalyanmoy Deb, A Comparative Analysis of Selection Schemes Used in Genetic Algorithms Foundations of Genetic Algorithms. ,vol. 1, pp. 69- 93 ,(1991) , 10.1016/B978-0-08-050684-5.50008-2
Alden H. Wright, Genetic Algorithms for Real Parameter Optimization Foundations of Genetic Algorithms. ,vol. 1, pp. 205- 218 ,(1991) , 10.1016/B978-0-08-050684-5.50016-1