The Dynamics of a Genetic Algorithm on a Model Hard Optimization Problem
A model of a hard optimization problem suggested in the literature is considered. The dynamics of a genetic algorithm (GA) using ranking selection, mutation and uniform crossover are completely modeled on this problem. These results are general and are valid for any symmetrical concave function of u...
Main Authors: | , |
---|---|
Format: | Article |
Language: | English |
Published: |
2000-05.
|
Subjects: | |
Online Access: | Get fulltext |