The Nature of Niching: Genetic Algorithms and the Evolution of Optimal, Cooperative Populations

We extend the above analysis by looking at some aspects of the general case of multiple overlapping niches. We discover that calculating the equilibrium point for three or more niches under resource sharing can be computationally expensive, as evidenced by the difficulty that GA selection has in reaching it. We present some evidence that equilibrium can thus represent solutions to hard problems, and that selection plus sharing might be a computationally intensive yet efficient algorithm (even without the exploration operators of recombination and mutation). (Abstract shortened by UMI.).

Name thesis:degree_name

Ph.D.

Level thesis:degree_level

Dissertation

Discipline thesis:degree_discipline

Computer Science

Grantor

University of Illinois at Urbana-Champaign

Year dc:date

2015

Author dc:creator

• Horn, Jeffrey

Contributors dc:contributor

• Goldberg, D.E.

• Biology, Ecology

Language dc:language

eng

Identifier

(MiAaPQ)AAI9812622

OAI identifier oai:identifier

oai:www.ideals.illinois.edu:2142/81895