A Genetic Algorithm With Self-Generated Random Parameters.

In this paper we present a version of genetic algorithm (GA) where parameters are created by the GA, rather than predetermined by the programmer. Chromosome portions which do not translate into fitness ("genetic residual") are given function to diversify control parameters for the GA, providing random parameter setting along the way, and doing away with fine-tuning of probabilities of crossover and mutation. We test the algorithm on Royal Road functions to examine the difference between our version (GAR) and the simple genetic algorithm (SGA) in the speed of discovering schema and creating building blocks. We also look at the usefulness of other standard improvements, such as non-coding segments, elitist selection and multiple crossover on the evolution of schema. [ABSTRACT FROM AUTHOR]

Copyright of Journal of Computing & Information Technology is the property of CIT. Journal of Computing & Information Technology and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)