國立虎尾科技大學 |

Methods for improving the design and performance of evolutionary algorithms.

紀錄類型:	書目-語言資料,手稿 : Monograph/item
正題名/作者:	Methods for improving the design and performance of evolutionary algorithms./
作者:	Bassett, Jeffrey K.
面頁冊數:	1 online resource (159 pages)
附註:	Source: Dissertation Abstracts International, Volume: 74-05(E), Section: B.
標題:	Computer science. -
電子資源:	click for full text (PQDT)
ISBN:	9781267866516

Methods for improving the design and performance of evolutionary algorithms.
Bassett, Jeffrey K.

Methods for improving the design and performance of evolutionary algorithms. - 1 online resource (159 pages)

Source: Dissertation Abstracts International, Volume: 74-05(E), Section: B.

Thesis (Ph.D.)--George Mason University, 2012.

Includes bibliographical references

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.

Electronic reproduction.
Ann Arbor, Mich. :
ProQuest,
2018

Mode of access: World Wide Web

ISBN: 9781267866516Subjects--Topical Terms:

573171
Computer science.
Index Terms--Genre/Form:

554714
Electronic books.

Methods for improving the design and performance of evolutionary algorithms.
LDR:03411ntm a2200349K 4500 001 915389
005 20180727125214.5
006 m o u
007 cr mn||||a|a||
008 190606s2012 xx obm 000 0 eng d
020 $a 9781267866516
035 $a (MiAaPQ)AAI3549855
035 $a (MiAaPQ)gmu:10215
035 $a AAI3549855
040 $a MiAaPQ $b eng $c MiAaPQ
100 1 $a Bassett, Jeffrey K. $3 1188723
245 1 0 $a Methods for improving the design and performance of evolutionary algorithms.
264 0 $c 2012
300 $a 1 online resource (159 pages)
336 $a text $b txt $2 rdacontent
337 $a computer $b c $2 rdamedia
338 $a online resource $b cr $2 rdacarrier
500 $a Source: Dissertation Abstracts International, Volume: 74-05(E), Section: B.
500 $a Adviser: Kenneth A. De Jong.
502 $a Thesis (Ph.D.)--George Mason University, 2012.
504 $a Includes bibliographical references
520 $a 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.
520 $a 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.
520 $a 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.
520 $a 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.
533 $a Electronic reproduction. $b Ann Arbor, Mich. : $c ProQuest, $d 2018
538 $a Mode of access: World Wide Web
650 4 $a Computer science. $3 573171
655 7 $a Electronic books. $2 local $3 554714
690 $a 0984
710 2 $a ProQuest Information and Learning Co. $3 1178819
710 2 $a George Mason University. $b Computer Science. $3 1188721
856 4 0 $u http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=3549855 $z click for full text (PQDT)