@inproceedings{27d4a47ce88f4793b943534341b15815,
title = "An application of genetic algorithm for university course timetabling problem",
abstract = "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.",
keywords = "Genetic algorithm, Heuristic method, Optimization, Timetabling problems",
author = "Xinyang Deng and Yajuan Zhang and Bingyi Kang and Jiyi Wu and Xiaohong Sun and Yong Deng",
year = "2011",
doi = "10.1109/CCDC.2011.5968555",
language = "英语",
isbn = "9781424487363",
series = "Proceedings of the 2011 Chinese Control and Decision Conference, CCDC 2011",
pages = "2119--2122",
booktitle = "Proceedings of the 2011 Chinese Control and Decision Conference, CCDC 2011",
note = "2011 Chinese Control and Decision Conference, CCDC 2011 ; Conference date: 23-05-2011 Through 25-05-2011",
}