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 satis.ed 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.
Timetabling problems Genetic algorithm Optimization Heuristic method
Xinyang Deng Yajuan Zhang Bingyi Kang Jiyi Wu Xiaohong Sun Yong Deng
School of Computer and Information Sciences, Southwest University, Chongqing,400715, China Hangzhou Key Lab of E-Business and InformationSecurity, Hangzhou Normal University, Hangzhou, Zhejia College of Food Science and Technology, Shanghai Ocean University, 999 Hucheng Huan Road, Shanghai, School of Computer and Information Sciences, Southwest University, Chongqing,400715, China;Key Subje
国际会议
2011 China Control and Decision Conference(2011中国控制与决策会议 CCDC)
四川绵阳
英文
2123-2126
2011-05-23（万方平台首次上网日期，不代表论文的发表时间）