By Topic

On a self-organizing property of genetic algorithms

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Nishikawa, Y. ; Dept. of Electr. Eng., Kyoto Univ., Japan ; Tamaki, H. ; Kita, H. ; Shimizu, N.

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

Published in:

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

Date of Conference: