The University of Edinburgh -
Division of Informatics
Forrest Hill & 80 South Bridge

MSc Thesis #9580

Title:Adapting Operator Probabilities in Genetic Algorithms
Date: 1995
Abstract:In the vast majority of genetic algorithm implementations, the operator probabilities are fixed throughout a given run. However, it can be convincingly argued that these probabilities should vary over the course of a genetic algorithm run - so as to account for changes in the ability of the operators to produce children of increased fitness. This dissertation describes an empirical investigation into this question. The effect upon genetic algorithm performance of adaptation methods upon both well-studied theoretical problems, and a hard problem from Operations Research - the flowshop sequencing problem, is examined.

[Search These Pages] [DAI Home Page] [Comment]