Isomorphisms of genetic algorithms
β Scribed by David L. Battle; Michael D. Vose
- Publisher
- Elsevier Science
- Year
- 1993
- Tongue
- English
- Weight
- 389 KB
- Volume
- 60
- Category
- Article
- ISSN
- 0004-3702
No coin nor oath required. For personal study only.
β¦ Synopsis
Battle, D.L. and M.D. Vose, Isomorphisms of genetic algorithms (Research Note), Artificial Intelligence 60 (1993) 155-165.
We begin with the premise that the role of Holland schemata in directing genetic search should be granted both as a matter of empirical fact and as a natural consequence of the Schema Theorem. From this we conclude that schemata more general than Holland's can also be made to direct genetic search, and that a duality exists between problem representations and which schemata are relevant for their optimization. This duality provides a theoretical framework in which to interpret problem representations.
π SIMILAR VOLUMES
Genetic algorithm behavior is determined by the explorationrexploitation balance kept throughout the run. When this balance is disproportionate, the premature convergence problem will probably appear, causing a drop in the genetic algorithm's efficacy. One approach presented for dealing with this pr