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...

Full description

Bibliographic Details
Main Authors: Md Sultan, Abu Bakar, Mahmod, Ramlan, Sulaiman, Md. Nasir, Abu Bakar, Mohd Rizam
Format: Article
Language:English
English
Published: Penerbit UTM Press 2006
Online Access:http://psasir.upm.edu.my/id/eprint/15508/
http://psasir.upm.edu.my/id/eprint/15508/1/Maintaining%20diversity%20for%20genetic%20algorithm.pdf
_version_ 1848842697124610048
author Md Sultan, Abu Bakar
Mahmod, Ramlan
Sulaiman, Md. Nasir
Abu Bakar, Mohd Rizam
author_facet Md Sultan, Abu Bakar
Mahmod, Ramlan
Sulaiman, Md. Nasir
Abu Bakar, Mohd Rizam
author_sort Md Sultan, Abu Bakar
building UPM Institutional Repository
collection Online Access
description 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.
first_indexed 2025-11-15T08:03:15Z
format Article
id upm-15508
institution Universiti Putra Malaysia
institution_category Local University
language English
English
last_indexed 2025-11-15T08:03:15Z
publishDate 2006
publisher Penerbit UTM Press
recordtype eprints
repository_type Digital Repository
spelling upm-155082015-10-26T02:55:29Z http://psasir.upm.edu.my/id/eprint/15508/ Maintaining diversity for genetic algorithm : a case of timetabling problem. Md Sultan, Abu Bakar Mahmod, Ramlan Sulaiman, Md. Nasir Abu Bakar, Mohd Rizam 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. Penerbit UTM Press 2006 Article PeerReviewed application/pdf en http://psasir.upm.edu.my/id/eprint/15508/1/Maintaining%20diversity%20for%20genetic%20algorithm.pdf 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 English
spellingShingle Md Sultan, Abu Bakar
Mahmod, Ramlan
Sulaiman, Md. Nasir
Abu Bakar, Mohd Rizam
Maintaining diversity for genetic algorithm : a case of timetabling problem.
title Maintaining diversity for genetic algorithm : a case of timetabling problem.
title_full Maintaining diversity for genetic algorithm : a case of timetabling problem.
title_fullStr Maintaining diversity for genetic algorithm : a case of timetabling problem.
title_full_unstemmed Maintaining diversity for genetic algorithm : a case of timetabling problem.
title_short Maintaining diversity for genetic algorithm : a case of timetabling problem.
title_sort maintaining diversity for genetic algorithm : a case of timetabling problem.
url http://psasir.upm.edu.my/id/eprint/15508/
http://psasir.upm.edu.my/id/eprint/15508/1/Maintaining%20diversity%20for%20genetic%20algorithm.pdf