Show simple item record

dc.contributor.advisorChairperson, Graduate Committee: John Paxton; Alden Wright (co-chair)en
dc.contributor.authorRichter, James Nealen
dc.date.accessioned2013-06-25T18:37:15Z
dc.date.available2013-06-25T18:37:15Z
dc.date.issued2010en
dc.identifier.urihttps://scholarworks.montana.edu/xmlui/handle/1/2132en
dc.description.abstractThe Evolutionary Algorithm is a population-based metaheuristic optimization algorithm. The EA employs mutation, crossover and selection operators inspired by biological evolution. It is commonly applied to find exact or approximate solutions to combinatorial search and optimization problems. This dissertation describes a series of theoretical and experimental studies on a variety of evolutionary algorithms and models of those algorithms. The effects of the crossover and mutation operators are analyzed. Multiple examples of deceptive fitness functions are given where the crossover operator is shown or proven to be detrimental to the speedy optimization of a function. While other research monographs have shown the benefits of crossover on various fitness functions, this is one of the few (or only) doing the inverse. A background literature review is given of both population genetics and evolutionary computation with a focus on results and opinions on the relative merits of crossover and mutation. Next, a family of new fitness functions is introduced and proven to be difficult for crossover to optimize. This is followed by the construction and evaluation of executable theoretical models of EAs in order to explore the effects of parameterized mutation and crossover. These models link the EA to the Metropolis-Hastings algorithm. Dynamical systems analysis is performed on models of EAs to explore their attributes and fixed points. Additional crossover deceptive functions are shown and analyzed to examine the movement of fixed points under changing parameters. Finally, a set of online adaptive parameter experiments with common fitness functions is presented.en
dc.language.isoenen
dc.publisherMontana State University - Bozeman, College of Engineeringen
dc.subject.lcshGenetic algorithmsen
dc.subject.lcshDynamicsen
dc.titleOn mutation and crossover in the theory of evolutionary algorithmsen
dc.typeDissertationen
dc.rights.holderCopyright 2010 by James Neal Richteren
thesis.catalog.ckey1520981en
thesis.degree.committeemembersMembers, Graduate Committee: Tomas Gedeon; Rafal A. Angryk; Gary Harin; Douglas J. Youngen
thesis.degree.departmentComputer Science.en
thesis.degree.genreDissertationen
thesis.degree.namePhDen
thesis.format.extentfirstpage1en
thesis.format.extentlastpage283en


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record


MSU uses DSpace software, copyright © 2002-2017  Duraspace. For library collections that are not accessible, we are committed to providing reasonable accommodations and timely access to users with disabilities. For assistance, please submit an accessibility request for library material.