Title of article :
Maintaining Diversity for Genetic Algorithm: A Case of Timetabling Problem
Author/Authors :
MD. SULTAN, ABU BAKAR Universiti Putra Malaysia - Faculty of Computer Science and Information Technology, Malaysia , MAHMOD, RAMLAN Universiti Putra Malaysia - Faculty of Computer Science and Information Technology, Malaysia , SULAIMAN, MD. NASIR Universiti Putra Malaysia - Faculty of Computer Science and Information Technology, Malaysia , ABU BAKAR, MOHD. RIZAM Universiti Putra Malaysia - Department of Mathematics, Malaysia
From page :
123
To page :
130
Abstract :
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.
Keywords :
Genetic algorithm , premature convergence , diversity , timetabling , optimization
Journal title :
Jurnal Teknologi :D
Journal title :
Jurnal Teknologi :D
Record number :
2666061
Link To Document :
بازگشت