The week's pick
Random Articles
Reseach Article
An Application of Genetic Algorithm for University Course Timetabling Problem
| International Journal of Applied Information Systems |
| Foundation of Computer Science (FCS), NY, USA |
| Volume 11 - Number 3 |
| Year of Publication: 2016 |
| Authors: Sanjay R. Sutar, Rajan S. Bichkar |
10.5120/ijais2016451590
|
Sanjay R. Sutar, Rajan S. Bichkar . An Application of Genetic Algorithm for University Course Timetabling Problem. International Journal of Applied Information Systems. 11, 3 ( Aug 2016), 26-30. DOI=10.5120/ijais2016451590
Abstract
Timetabling problem is a process of assigning given set of events and resources to the limited space and time under hard constraints which are rigidly enforced and soft constraints which are satisfied as nearly as possible. As a kind of timetabling problems, University course timetabling is a very important administrative activity for a wide variety of institutes. Genetic algorithm is an advanced heuristics method which is very effective in many areas. It is frequently deployed meta-heuristics algorithm to solve difficult combinatorial optimization problems. In this paper, genetic algorithm is used to solve university course timetabling problem. At first, a model of problem to be solved is defined. Then, the genetic representation is determined and a fitness function is established according to the constraints. Finally, a case of university course timetabling from real-world is discussed and solved. It is demonstrated that the method proposed in this paper is feasible and efficient.
References
- Burke E.K. and Newall J., “Enhancing Timetable Solutions with Local Search Methods,” Burke E.K. and De Causmaecker P. (eds.), Selected Papers from the 4th International Conference on the Practice and Theory of Automated Timetabling, Lecture Notes in Computer Science, 2740, pp. 195-206, 2002.
- E.K. Burke, S. Petrovic and R. Qu, “Case Based Heuristic Selection for Examination Timetabling,” Proceedings of the Seal'02, 277-281, 18-22, Orchid Country Club, Singapore, 2002.
- T. B. Cooper and J. H. Kingston, “The Complexity of Timetable Construction Problems,” Proceedings of the 1st International Conference on Practice and Theory of Automated Timetabling (PATAT 1995), LNCS-1153, pages 283–295. Springer Verlag, 1996.
- Colorni A., Dorigo and M. Maniezzo, “Genetic Algorithms and Highly Constrained Problems: The Time-Table Case,” Parallel Problem Solving from Nature, Goos and Hartmanis (eds.), Springer-Verlag, pp. 55-59, 1990.
- Hitoshi Kanoh and Yusuke Sakamoto, “Interactive Timetabling System Using Knowledge Based Genetic Algorithms,” IEEE, International Conference on Systems, Man and Cybernetics, 2004.
- Alexander Brownlee, “An application of Genetic Algorithms to University Timetabling,” Honors Project, 2005.
- Maciej Norberciak, “Universal Method for Solving Timetabling Problems Based on Evolutionary Approach,” Proceedings of the International Multiconference on Computer Science and Information Technology, pp. 149 – 157, 2006.
- Mihaela Oprea, “MAS_UP-UCT: A Multi-Agent System for University Course Timetable Scheduling,” International Journal of Computers, Communications and Control, Vol. II , No. 1, pp. 94-102, 2007.
- Adilah Binti Abdullah, “Timetable Management System Using Genetic Algorithm,” Technical Report submitted at University of Malaya, May, 2008.
- Pariwat Khonggamnerd and Supachate Innet, “Improvement of Effectiveness in Automatic University Timetabling Arrangement with Applied Genetic Algorithm,” 4th International Conference on Computer Sciences and Convergence Information Technology, 2009.
- Nabeel R., “Hybrid Genetic Algorithms with Great Deluge for Course Timetabling,” IJCSNS, International Journal of Computer Science and Network Security, Vol.10, No.4, April, 2010.
Index Terms
Keywords