Draidi, Fady (2004) Parameterless genetic algorithms : review, comparison and improvement. Masters thesis, Concordia University.
MQ91020.pdf - Accepted Version
This dissertation compares the performance of five existing Genetic Algorithms (GAs) that do not require the manual tuning of their parameters, and are thus called Parameterless Genetic Algorithms (pGAs). The five pGAs selected for evaluation span the three most important categories of Parameterless GAs: Deterministic, Adaptive and Self-Adaptive pGAs. The five test functions used to evaluate the performance of the pGAs include unimodal, multimodal and deceptive functions. We assess performance in terms of fitness, diversity, reliability, speed and memory load. Surprisingly , the simplest Parameterless GA tested proves to be the best overall performer. Last, but not least, we describe a new parameterless Genetic Algorithm (nGA), one that is easy to understand and implement, and which bests all five tested pGAs in terms of performance, particularly on hard and deceptive surfaces.
|Divisions:||Concordia University > Faculty of Engineering and Computer Science > Electrical and Computer Engineering|
|Item Type:||Thesis (Masters)|
|Pagination:||x, 126 leaves : ill. ; 29 cm.|
|Degree Name:||M.A. Sc.|
|Program:||Electrical and Computer Engineering|
|Thesis Supervisor(s):||Khamma, Nawaf|
|Deposited By:||Concordia University Libraries|
|Deposited On:||18 Aug 2011 18:11|
|Last Modified:||04 Nov 2016 23:47|
Repository Staff Only: item control page