On a self-organizing property of genetic algorithms

Author

Nishikawa, Yoshikazu ; Tamaki, Hisashi ; Kita, Hajime ; Shimizu, Nobuhiko

Author_Institution

Dept. of Electr. Eng., Kyoto Univ., Japan

fYear

1993

fDate

1993

Firstpage

338

Lastpage

344

Abstract

The dynamics of a genetic algorithm (GA) is investigated from the viewpoint of self-organization. The dynamics of the simple GA is modeled by difference equations. The equations are examined by computer simulation, and it is shown that the GA selects a genotype robust to a mutation. This property becomes remarkable when a crossover operator is introduced. The GA is applied to a simple optimization problem with redundant genetic coding. Results of computer simulations show that the GA selects a genetic representation that is robust to reduction of fitness value by the mutation and the crossover as well

Keywords

difference equations; digital simulation; genetic algorithms; self-adjusting systems; crossover operator; difference equations; fitness value; genetic algorithms; genetic representation; genotype; mutation robustness; optimization; redundant genetic coding; self-organizing property; Computational modeling; Computer simulation; Difference equations; Genetic algorithms; Genetic mutations; Robustness; Stochastic processes;

fLanguage

English

Publisher

ieee

Conference_Titel

Autonomous Decentralized Systems, 1993. Proceedings. ISADS 93., International Symposium on

Conference_Location

Kawasaki

Print_ISBN

0-8186-3125-2

Type

conf

DOI

10.1109/ISADS.1993.262685

Filename

262685