UPM Institutional Repository

Maintaining diversity for genetic algorithm : a case of timetabling problem.


Citation

Md Sultan, Abu Bakar and Mahmod, Ramlan and Sulaiman, Md. Nasir and Abu Bakar, Mohd Rizam (2006) Maintaining diversity for genetic algorithm : a case of timetabling problem. Jurnal Teknologi, 44(D) (Jun). 123 - 130. ISSN 0127-9696

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.


Download File

[img]
Preview
PDF (Abstract)
Maintaining diversity for genetic algorithm.pdf

Download (83kB) | Preview

Additional Metadata

Item Type: Article
Divisions: Faculty of Science
Publisher: Penerbit UTM Press
Keywords: Genetic algorithm; Premature convergence; Diversity; Timetabling; Optimization.
Depositing User: Najwani Amir Sariffudin
Date Deposited: 16 Oct 2013 08:20
Last Modified: 26 Oct 2015 02:55
URI: http://psasir.upm.edu.my/id/eprint/15508
Statistic Details: View Download Statistic

Actions (login required)

View Item View Item