Isomorphisms of genetic algorithms

摘要

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.