A genetic algorithm with self-generated random parameters

9Citations
Citations of this article
6Readers
Mendeley users who have this article in their library.

Abstract

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.

Cite

CITATION STYLE

APA

Novkovic, S., & Sverko, D. (2003). A genetic algorithm with self-generated random parameters. Journal of Computing and Information Technology, 11(4), 271–283. https://doi.org/10.2498/cit.2003.04.02

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free