Implicit representation in genetic algorithms using redundancy.

Abstract excerpt

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...

Topics

Share this publication in a Topic to start or enrich a Post.

• Share to Algorithms
• Share to Biological Evolution
• Share to Evaluation Studies as Topic