UPM Institutional Repository

A genetic algorithm approach for timetabling problem: the time group strategy


Md Sultan, Abu Bakar and Mahmod, Ramlan and Sulaiman, Md. Nasir and Abu Bakar, Mohd Rizam (2004) A genetic algorithm approach for timetabling problem: the time group strategy. Journal of Information and Communication Technology, 3 (2). pp. 1-14. ISSN 1675-414X; ESSN: 2180-3862


The university timetabling problems (TTP) deal with the scheduling of the teaching program. Over the last decade variant of Genetic Algorithm (GA) approaches have been used to solve various types of TTP with great success. Most of the approaches are problem dependent, applied only to the institutions where they were designed. In this paper we proposed time group strategy and Simple GA (TGGA) to solve highly constrained TTP. The proposed model promises to solve highly constrained timetabling with less effort. The model is tested and results are discussed.

Download File

PDF (Abstract)
A genetic algorithm approach for timetabling problem the time group strategy.pdf

Download (34kB) | Preview

Additional Metadata

Item Type: Article
Divisions: Faculty of Computer Science and Information Technology
Faculty of Science and Environmental Studies
Publisher: Universiti Utara Malaysia Press
Keywords: Timetabling; Heuristic; Genetic algorithm
Depositing User: Nurul Ainie Mokhtar
Date Deposited: 10 Oct 2016 04:19
Last Modified: 10 Oct 2016 04:19
URI: http://psasir.upm.edu.my/id/eprint/34841
Statistic Details: View Download Statistic

Actions (login required)

View Item View Item