Dissertation/Thesis Abstract

Methods for improving the design and performance of evolutionary algorithms
by Bassett, Jeffrey K., Ph.D., George Mason University, 2012, 159; 3549855
Abstract (Summary)

Evolutionary Algorithms (EAs) can be applied to almost any optimization or learning problem by making some simple customizations to the underlying representation and/or reproductive operators. This makes them an appealing choice when facing a new or unusual problem. Unfortunately, while making these changes is often easy, getting a customized EA to operate effectively (i.e. find a good solution quickly) can be much more difficult.

Ideally one would hope that theory would provide some guidance here, but in these cases, evolutionary computation (EC) theories are not easily applied. They either require customization themselves, or they require information about the problem that essentially includes the solution. Consequently most practitioners rely on an ad-hoc approach, incrementally modifying and testing various customizations until they find something that works reasonably well.

The drawback that most EC theories face is that they are closely associated with the underlying representation of an individual (i.e. the genetic code). There has been some success at addressing this limitation by applying a biology theory called quantitative genetics to EAs. This approach allows one to monitor the behavior of an EA by observing distributions of an outwardly observable phenotypic trait (usually fitness), and thus avoid modeling the algorithm's internal details. Unfortunately, observing a single trait does not provide enough information to diagnose most problems within an EA. It is my hypothesis that using multiple traits will allow one to observe how the population is traversing the search space, thus making more detailed diagnosis possible.

In this work, I adapt a newer multivariate form of quantitative genetics theory for use with evolutionary algorithms and derive a general equation of population variance dynamics. This provides a foundation for building a set of tools that can measure and visualize important characteristics of an algorithm, such as exploration, exploitation, and heritability, throughout an EA run. Finally I demonstrate that the tools can actually be used to identify and fix problems in two well known EA variants: Pittsburgh approach rule systems and genetic programming trees.

Indexing (document details)
Advisor: Jong, Kenneth A. De
Commitee: Grefenstette, John J., Luke, Sean, Wang, Pearl
School: George Mason University
Department: Computer Science
School Location: United States -- Virginia
Source: DAI-B 74/05(E), Dissertation Abstracts International
Source Type: DISSERTATION
Subjects: Computer science
Keywords: Customization, Evolutionary computation, Genetic programming, Heritability, Price's theorem, Quantitative genetics
Publication Number: 3549855
ISBN: 9781267866516
Copyright © 2019 ProQuest LLC. All rights reserved. Terms and Conditions Privacy Policy Cookie Policy
ProQuest