Doctoral Dissertations

Title

The art of parameterless evolutionary algorithms

Abstract

"Evolutionary Algorithms (EAs) can be powerful problem solving tools when other methods fail. EAs maintain a collection of solutions and go through many iterations of recombining and randomly modifying current solutions, deleting some of the discovered solutions and giving the better solutions a higher chance of surviving. In such a manner EAs explore the search space in the pursuit of globally optimal solutions. To make an EA successful in its pursuit of globally optimal solutions on any particular problem, the evolutionary operators and relevant parameters must be carefully tuned. The tuning of operators and parameters is often manual and time consuming. The focus of this dissertation is on automatic tuning of operators and parameters. This dissertation presents methodologies for automating the tuning of the population size parameter and the choice of the mate selection operator"--Abstract, leaf iii.

Advisor(s)

Tauritz, Daniel R.

Committee Member(s)

McMillin, Bruce M.
Thakur, Mayur
Wilkerson, Ralph W.
Morgan, Ilene H.

Department(s)

Computer Science

Degree Name

Ph. D. in Computer Science

Publisher

Missouri University of Science and Technology

Publication Date

Spring 2008

Pagination

xiv, 103 leaves

Note about bibliography

Includes bibliographical references (leaves 98-102).

Rights

© 2008 Ekaterina A. Holdener, All rights reserved.

Document Type

Dissertation - Citation

File Type

text

Language

English

Library of Congress Subject Headings

Computer algorithms
Distributed parameter systems
Evolutionary programming (Computer science)
Genetic algorithms

Thesis Number

T 9387

Print OCLC #

270996914

Link to Catalog Record

Full-text not available: Request this publication directly from Missouri S&T Library or contact your local library.

http://laurel.lso.missouri.edu/record=b6526431~S5

This document is currently not available here.

Share

 
COinS