Maintaining diversity for genetic algorithm : a case of timetabling problem.
Over the last decade, variant of genetic algorithm (GA) approaches have been used to solve various type of optimization problems. Premature convergence is the main problem for GA performance. A common hyphothesis is that high diversity is important to avoid this problem. Failure to maintain GA popu...
Saved in:
| Main Authors: | , , , |
|---|---|
| Format: | Article |
| Language: | English English |
| Published: |
Penerbit UTM Press
2006
|
| Online Access: | http://psasir.upm.edu.my/id/eprint/15508/1/Maintaining%20diversity%20for%20genetic%20algorithm.pdf http://psasir.upm.edu.my/id/eprint/15508/ |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Summary: | Over the last decade, variant of genetic algorithm (GA) approaches have been used to solve various type of optimization problems. Premature convergence is the main problem for GA performance. A common hyphothesis is that high diversity is important to avoid this problem. Failure
to maintain GA population diversity will lead to this problem and affected quality of result will be produced. In this paper, we proposed two-problem representation and two strategies to retain population diversity as well as preventing premature convergence. The algorithm was then applied to timetabling problem and showed promising result. |
|---|