Open Access. Powered by Scholars. Published by Universities.®
Physical Sciences and Mathematics Commons™
Open Access. Powered by Scholars. Published by Universities.®
Articles 1 - 2 of 2
Full-Text Articles in Physical Sciences and Mathematics
Advanced Techniques For Improving Canonical Genetic Programming, Adam Tyler Harter
Advanced Techniques For Improving Canonical Genetic Programming, Adam Tyler Harter
Masters Theses
"Genetic Programming (GP) is a type of Evolutionary Algorithm (EA) commonly employed for automated program generation and model identification. Despite this, GP, as most forms of EA's, is plagued by long evaluation times, and is thus generally reserved for highly complex problems. Two major impacting factors for the runtime are the heterogeneous evaluation time for the individuals and the choice of algorithmic primitives. The first paper in this thesis utilizes Asynchronous Parallel Evolutionary Algorithms (APEA) for reducing the runtime by eliminating the need to wait for an entire generation to be evaluated before continuing the search. APEA is applied to …
Evolved Parameterized Selection For Evolutionary Algorithms, Samuel Nathan Richter
Evolved Parameterized Selection For Evolutionary Algorithms, Samuel Nathan Richter
Masters Theses
"Selection functions enable Evolutionary Algorithms (EAs) to apply selection pressure to a population of individuals, by regulating the probability that an individual's genes survive, typically based on fitness. Various conventional fitness based selection functions exist, each providing a unique method of selecting individuals based on their fitness, fitness ranking within the population, and/or various other factors. However, the full space of selection algorithms is only limited by max algorithm size, and each possible selection algorithm is optimal for some EA configuration applied to a particular problem class. Therefore, improved performance is likely to be obtained by tuning an EA's selection …