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: Md Sultan, Abu Bakar, Mahmod, Ramlan, Sulaiman, Md. Nasir, Abu Bakar, Mohd Rizam
格式: Article
语言:English
English
出版: Penerbit UTM Press 2006
在线阅读:http://psasir.upm.edu.my/id/eprint/15508/1/Maintaining%20diversity%20for%20genetic%20algorithm.pdf
http://psasir.upm.edu.my/id/eprint/15508/
标签: 添加标签
没有标签, 成为第一个标记此记录!
实物特征
总结: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.