Division of Informatics
Forrest Hill & 80 South Bridge
Research Paper #821 | |
|---|---|
| Title: | Adapting Operator Settings in Genetic Algorithms |
| Authors: | Tuson,AL; Ross,PM |
| Date: | Jul 1996 |
| Presented: | Submitted to Evolutionary Computation |
| Keywords: | |
| Abstract: | In the vast majority of genetic algorithm implementations, the operator settings are fixed throughout a given run. However, it has sometimes been argued that these settings 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 paper describes an empirical investigation into this question. The effect upon genetic algorithm performance of two adaptation methods upon both well-studied theoretical problems, and a hard problem from Operations Research - the flowshop sequencing problem, is examined. The results obtained indicate that the applicability of operator adaptation is problem-dependent. |
| Download: | POSTSCRIPT COPY |
![[Search These Pages]](http://www.dai.ed.ac.uk/icons/dai_search.gif){kind=icon}
![[DAI Home Page]](http://www.dai.ed.ac.uk/icons/dai_home.gif){kind=icon}
![[Comment]](http://www.dai.ed.ac.uk/icons/dai_comment.gif){kind=icon}