The virtual gene genetic algorithm

Authors:
Manuel Valenzuela-Rendón
Affiliations:
ITESM, Monterrey, Centro de Sistemas Inteligentes, Monterrey, N.L., México
Venue:
GECCO'03 Proceedings of the 2003 international conference on Genetic and evolutionary computation: PartII
Year:
2003

Citing 3
Cited 2

Genetic algorithms + data structures = evolution programs (2nd, extended ed.)

Genetic algorithms + data structures = evolution programs (2nd, extended ed.)
Adaptation in Natural and Artificial Systems: An Introductory Analysis with Applications to Biology, Control and Artificial Intelligence

Adaptation in Natural and Artificial Systems: An Introductory Analysis with Applications to Biology, Control and Artificial Intelligence
Genetic Algorithms in Search, Optimization and Machine Learning

Genetic Algorithms in Search, Optimization and Machine Learning

Linear Wind Farm Layout Optimization through Computational Intelligence

MICAI '09 Proceedings of the 8th Mexican International Conference on Artificial Intelligence
Inventive problem solving based on dialectical negation, using evolutionary algorithms and TRIZ heuristics

Computers in Industry

Quantified Score

Hi-index	0.00

Visualization

Abstract

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