Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

Implicit Representation in Genetic Algorithms Using Redundancy

Implicit Representation in Genetic Algorithms Using Redundancy A new representation combining redundancy and implicit fitness constraints is introduced that performs better than a simple genetic algorithm (GA) and a structured GA in experiments. The implicit redundant representation (IRR) consists of a string that is over-specified, allowing for sections of the string to remain inactive during function evaluation. The representation does not require the user to prespecify the number of parameters to evaluate or the location of these parameters within the string. This information is obtained implicitly by the fitness function during the GA operations. The good performance of the IRR can be attributed to several factors: less disruption of existing fit members due to the increased probability of crossovers and mutation affecting only redundant material; discovery of fit members through the conversion of redundant material into essential information; and the ability to enlarge or reduce the search space dynamically by varying the number of variables evaluated by the fitness function. The IRR GA provides a more biologically parallel representation that maintains a diverse population throughout the evolution process. In addition, the IRR provides the necessary flexibility to represent unstructured problem domains that do not have the explicit constraints required by fixed representations. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png Evolutionary Computation MIT Press

Implicit Representation in Genetic Algorithms Using Redundancy

Download PDF
26 pages

Loading next page...
 
/lp/mit-press/implicit-representation-in-genetic-algorithms-using-redundancy-XMfj6EUmLJ

References (15)

Publisher
MIT Press
Copyright
© 1997 by the Massachusetts Institute of Technology
ISSN
1063-6560
eISSN
1530-9304
DOI
10.1162/evco.1997.5.3.277
Publisher site
See Article on Publisher Site

Abstract

A new representation combining redundancy and implicit fitness constraints is introduced that performs better than a simple genetic algorithm (GA) and a structured GA in experiments. The implicit redundant representation (IRR) consists of a string that is over-specified, allowing for sections of the string to remain inactive during function evaluation. The representation does not require the user to prespecify the number of parameters to evaluate or the location of these parameters within the string. This information is obtained implicitly by the fitness function during the GA operations. The good performance of the IRR can be attributed to several factors: less disruption of existing fit members due to the increased probability of crossovers and mutation affecting only redundant material; discovery of fit members through the conversion of redundant material into essential information; and the ability to enlarge or reduce the search space dynamically by varying the number of variables evaluated by the fitness function. The IRR GA provides a more biologically parallel representation that maintains a diverse population throughout the evolution process. In addition, the IRR provides the necessary flexibility to represent unstructured problem domains that do not have the explicit constraints required by fixed representations.

Journal

Evolutionary Computation – MIT Press

Published: Sep 1, 1997

Keywords: Implicit representation; redundancy; genetic algorithms; implicit constraints; deception; population diversity; unstructured problems

There are no references for this article.