A HYBRID GENETIC ALGORITHM FOR SOLVING UNIVERSITY COURSE-SCHEDULE PROBLEM

摘要：

The course-schedule problem is a multi-objective optimization problem, the global near-optimal solution couldnt be obtained by only using the direct heuristic algorithm, and the constringency would be slow by only using the standard genetic algorithm. So a hybrid genetic algorithm (abbreviated to HGA) which combined the direct heuristic algorithm with the standard genetic algorithm is put forward. By using a new simple intuitive two-dimensional space-time array encoding and a new block crossover operator, HGA only have little course-unit conflicts after crossing and mutating, and the conflict is easy to digest. The experiments show that the global nearoptimal solution can be obtained quickly by using HGA.

关键词： Course-schedule Hybrid genetic algorithm Direct heuristic algorithm Space-time-array Course-unit

作者: SHU LAN-YING

作者单位: College of Computer Science, China West Normal University, Nan-Chong, China

会议类型: 国际会议

会议名称: 3rd International Conference on Mechanical and Electrical Technology(ICMET2011) (2011第三届机械与电气技术国际会议)

会议地点: 大连

会议语种:英文

页码: 281-285

在线出版日期: 2011-08-26（万方平台首次上网日期，不代表论文的发表时间）