Login | Register

Parameterless genetic algorithms : review, comparison and improvement


Parameterless genetic algorithms : review, comparison and improvement

Draidi, Fady (2004) Parameterless genetic algorithms : review, comparison and improvement. Masters thesis, Concordia University.

Text (application/pdf)
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 > Gina Cody School of Engineering and Computer Science > Electrical and Computer Engineering
Item Type:Thesis (Masters)
Authors:Draidi, Fady
Pagination:x, 126 leaves : ill. ; 29 cm.
Institution:Concordia University
Degree Name:M.A. Sc.
Program:Electrical and Computer Engineering
Thesis Supervisor(s):Khamma, Nawaf
ID Code:7941
Deposited By: Concordia University Library
Deposited On:18 Aug 2011 18:11
Last Modified:18 Jan 2018 17:31
Related URLs:
All items in Spectrum are protected by copyright, with all rights reserved. The use of items is governed by Spectrum's terms of access.

Repository Staff Only: item control page

Downloads per month over past year

Back to top Back to top