A GENETIC ALGORITHM APPROACH FOR TIMETABLING PROBLEM: THE TIME GROUP STRATEGY

Authors

  • A. B. M. Sultan Faculty of Computer Science and Information Technology University Putra Malaysia, 43400 UPM Serdang Selangor, Malaysia
  • R. Mahmod Faculty of Computer Science and Information Technology University Putra Malaysia, 43400 UPM Serdang Selangor, Malaysia
  • M. N. Sulaiman Faculty of Computer Science and Information Technology University Putra Malaysia, 43400 UPM Serdang Selangor, Malaysia
  • M. R. A. Bakar Department of Mathematic Faculty of Science and Environmental Studies University Putra Malaysia

Keywords:

timetabling, heuristic, genetic algorithm

Abstract

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.

 

Additional Files

Published

30-11-2004

How to Cite

Sultan, A. B. M., Mahmod, R., Sulaiman, M. N., & A. Bakar, M. R. (2004). A GENETIC ALGORITHM APPROACH FOR TIMETABLING PROBLEM: THE TIME GROUP STRATEGY. Journal of Information and Communication Technology, 3(2), 1–14. Retrieved from https://e-journal.uum.edu.my/index.php/jict/article/view/8041

Issue

Vol. 3 No. 2 (2004): Journal of Information and Communication Technology (JICT) Vol. 3, No.2 Dec 2004

Section

Articles