Use of dynamic pool size to regulate selection pressure in cooperative coevolutionary algorithms
by Angeles, Mary Stankovich, Ph.D., NOVA SOUTHEASTERN UNIVERSITY, 2010, 465 pages; 3402079

Abstract:

Cooperative coevolutionary algorithms (CCEA) are a form of evolutionary algorithm that is applicable when the problem can be decomposed into components. Each component is assigned a subpopulation that evolves a good solution to the subproblem. To compute an individual's fitness, it is combined with collaborators drawn from the other subpopulations to form a complete solution. The individual's fitness is a function of this solution's fitness. The contributors to the comprehensive fitness formula are known as collaborators. The number of collaborators allowed from each subpopulation is called pool size. It has been shown that the outcome of the CCEA can be improved by allowing multiple collaborators from each subpopulation. This results in larger pool sizes, but improved fitness. The improvement in fitness afforded by larger pool sizes is offset by increased calculation costs. This study targeted the pool size parameter of CCEAs by devising dynamic strategies for the assignment of pool size to regulate selection pressure. Subpopulations were rewarded with a larger pool size or penalized with a smaller pool size based on measures of their diversity and/or fitness. Measures for population diversity and fitness used in this study were derived from various works involving evolutionary computation. This study showed that dynamically assigning pool size based on these measures of the diversity and fitness of the subpopulations can yield improved fitness results with significant reduction in calculation costs over statically assigned pool sizes.

 
AdviserMichael J. Laszlo
SchoolNOVA SOUTHEASTERN UNIVERSITY
SourceDAI/B 71-05, p. , May 2010
Source TypeDissertation
SubjectsComputer science
Publication Number3402079
Adobe PDF Access the complete dissertation:
 

» Find an electronic copy at your library.
  Use the link below to access a full citation record of this graduate work:
  http://gateway.proquest.com/openurl%3furl_ver=Z39.88-2004%26res_dat=xri:pqdiss%26rft_val_fmt=info:ofi/fmt:kev:mtx:dissertation%26rft_dat=xri:pqdiss:3402079
  If your library subscribes to the ProQuest Dissertations & Theses (PQDT) database, you may be entitled to a free electronic version of this graduate work. If not, you will have the option to purchase one, and access a 24 page preview for free (if available).

About ProQuest Dissertations & Theses
With over 2.3 million records, the ProQuest Dissertations & Theses (PQDT) database is the most comprehensive collection of dissertations and theses in the world. It is the database of record for graduate research.

The database includes citations of graduate works ranging from the first U.S. dissertation, accepted in 1861, to those accepted as recently as last semester. Of the 2.3 million graduate works included in the database, ProQuest offers more than 1.9 million in full text formats. Of those, over 860,000 are available in PDF format. More than 60,000 dissertations and theses are added to the database each year.

If you have questions, please feel free to visit the ProQuest Web site - http://www.proquest.com - or call ProQuest Hotline Customer Support at 1-800-521-3042.