Back to search

University of Missouri--Rolla

Considerations for rapidly converging genetic algorithms designed for application to problems with expensive evaluation functions

Abstract

dc:description.abstract

<p>"A genetic algorithm is a technique designed to search large problem spaces using the Darwinian concepts of evolution. Solution representations are treated as living organisms. The procedure attempts to evolve increasingly superior solutions. As in natural genetics, however, there is no guarantee that the optimum organism will be produced.</p> <p>One of the problems in producing optimal organisms in a genetic algorithm is the difficulty of premature convergence. Premature convergence occurs when the organisms converge in similarity to a pattern which is sub-optimal, but insufficient genetic material is present to continue the search beyond this sub-optimal level, called a local maximum.</p> <p>The prevention of premature convergence of the organisms is crucial to the success of most genetic algorithms. In order to prevent such convergence, numerous operators have been developed and refined. All such operators, however, rely on the property of the underlying problem that the evaluation of individuals is a computationally inexpensive process.</p> <p>In this paper, the design of genetic algorithms which intentionally converge rapidly is addressed. The design considerations are outlined, and the concept is applied to an NP-Complete problem, known as a Crozzle, which does not have an inexpensive evaluation function. This property would normally make the Crozzle unsuitable for processing by a genetic algorithm. It is shown that a rapidly converging genetic algorithm can successfully reduce the effective complexity of the problem"--Abstract, page iii.</p>

Degree

thesis:*
Name thesis:degree_name
Ph. D. in Computer Science
Grantor
University of Missouri--Rolla
Year dc:date.available
2016

Author and committee

dc:creator, dc:contributor.*
Author dc:creator
  • Rankin, Richard Patrick

Subjects

dc:subject × 1

Identifiers

dc:identifier.*
OAI identifier oai:identifier
oai:scholarsmine.mst.edu:doctoral_dissertations-2014

Chain of custody

source
Harvested from
Missouri University of Science and Technology
Base URL
scholarsmine.mst.edu/do/oai/
Last updated
2026-07-24
Source record
OAI-PMH GetRecord
citation

Rankin, Richard Patrick. Considerations for rapidly converging genetic algorithms designed for application to problems with expensive evaluation functions. University of Missouri--Rolla, 2016. https://scholarsmine.mst.edu/doctoral_dissertations/1012