An application of genetic algorithm for university course timetabling problem

Timetabling problems are a process of assigning a 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 ve...

Full description

Saved in:
Bibliographic Details
Main Authors: Xinyang Deng, Yajuan Zhang, Bingyi Kang, Jiyi Wu, Xiaohong Sun, Yong Deng
Format: Conference Proceeding
Language:English
Subjects:
Computers
Educational institutions
Genetic algorithm
Genetic algorithms
Genetics
Heuristic method
Optimization
Search problems
Timetabling problems
Online Access:Request full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Timetabling problems are a process of assigning a 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 schools. Genetic algorithm is an advanced heuristic method which is very effective in many fields. 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.
ISSN:1948-9439
1948-9447
DOI:10.1109/CCDC.2011.5968555