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, Malaysia

DOI:

https://doi.org/10.32890/jict2004.3.2.1

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.

 

References

Burke, E. K., & Petrovic, S. (2002). Recent research direction in automated tmetabling. Exropean Journal of Operational Research 140, 266-280.

Carrasco, M. P., & Pato, M.V. (2001). A multiobjective genetic algorithm for class/teacher timetabling problem. in E.Burke and W.Exben (Ed.): The International Series of Conferences on the Practice and Theory of Automated Timetabling (PATAT) 2000, Lecture Notes for Computer Science 2079, 3-17.

Carter, M. W., & Laporte, G. (1998). Recent development in practical course timetabling. In: E Burke E.: M. Carter (Ed.) : The International Series of Conferences on the Practice and Theory of Automated Timetabling (PATAT)1997, Lecture Notes for Computer Science 1408, 3-19.

Daskalaki, S., Birbas, T., & Housos E. (2003). An integer programming formulation for a case study in university timetabling. Ewropean Journal of Operational Research, Article in Press. Journal of ICT, 3 (2), pp: 1-

Deris, S., Omatu, S., Ohta, H., & Saad P. (1999). Incorporating constraint ptopagation in genetic algorithm for university timetabling planning. Engineering Application of Artificial Intelligence 12, 241-253.

Dimopoulou. M., & Miliotois, P. (2001). Implementation of a university course and examination timetabling system. Exropean Journal of Operational Research 130, 202-213.

Marin, H.T. (1998). Combinations of GAs and CSP strategies for solving the examination Timetabling Problem. Ph.d Thesis, Department of Computer Science, University of Monterrey, Mexico.

Newall, J P. (1999). Hybrid Methods for Auto Timetabling. PAD Thesis, Department of Computer Science, University of Nottingham UK.

Paechter, B., Rankin, R. C., & Cumming, A. (1998). Improving a lecture timetabling System for University. Lecture Notes for Computer Science 1408, 156-165.

Popovic, D. (1997). Retaining diversity of search point distribution through a breeder genetic algorithm For Neural Network Learning. IEEE international Conference on Neural Network 1, Jane 9—12. (pp. 495-498), Houston, USA: IEEE Press. t.uum.edu.my/

Qu, R. (2002). Case-Based Reasoning for course timetabling problems. PH.D Thesis, Department of Computer Science, University of Nottingham UK [IC J /|

Ross, P., Hart, E., & Corne, P., (1998). Some observation about GA-based 8 exam timetabling. in E.Burke, M.Carter (Eds), The International Series of OQ. Conferences on the Practice and Theory of Automated Timetabling — (PATAT)1997, Lecture Notes for Computer Science 1408,115-129. — Schaerf, A. (1999). A survey of automated timetabling, Artificial Intelligence Review 13(2), 87-127.

Ueda, H., Ouchi. D., Takashi, K., & Miyahara, H. (2001) A co-evolving timeslots/room assignment genetic algorithm technique for university timetabling. In E.Burke and W.Erben (Ed), The International Series of Conferences on the Practice and Theory of Automated Timetabling (PATAT) 2000, Lecture Notes for Computer Science 2079,48-63. t.uum.edu.my/ /Iic http Journal of ICT, 3 (2), pp: 1-

Ursem, U. K. (2002). Diversity-guided evolutionary algorithms. Lecture Notes for Computer Science 2439, 462-471.

Yu, E., & Sung, K. (2002). A genetic algorithm for a university weekly courses timetabling. International Transactions in Operational Research(9),703-717.

Wang, Y.Z. (2003). Using Genetic Algorithm Methods to solve Course Scheduling, Journal of Expert system with Application(22), 295-302.

Downloads

Published

30-11-2004

Issue

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

Section

Articles

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. https://doi.org/10.32890/jict2004.3.2.1

Research impact

Harvested 2026-09-06
7 citations, from OpenAlex — the highest of the sources checked

Counts differ between services because each indexes a different body of literature. None of them is the whole picture.

Identifiers DOI 10.32890/jict2004.3.2.1 OpenAlex W2730784422

Most read articles by the same author(s)