几种智能算法在排课问题中的比较  

Comparative Analysis on the Course Scheduling Problem in Several Intelligent Algorithms

作　　者：张丽丽[1] 许峰[1] 

机构地区：[1]安徽理工大学理学院数学系,安徽淮南232001

出　　处：《湖南理工学院学报（自然科学版）》2014年第2期50-53,共4页Journal of Hunan Institute of Science and Technology(Natural Sciences)

基　　金：安徽省优秀青年人才基金(2012SQRL259)

摘　　要：排课问题是个NP完全问题,没有最优解,只有满意解.将智能算法应用于排课问题的求解取得了有效的研究成果.主要对遗传算法、模拟退火算法和蚁群算法求解排课问题做了比较分析,阐述了各算法的基本原理及算法特点,分析了各个算法用在排课问题上的优缺点.The scheduling problem is a NP complete problem, no optimal solution, and only a satisfactory solution. The intelligent algorithm was applied to solve the scheduling problem and acquired effective results. The genetic algorithm, simulated annealing algorithm and ant colony algorithm for solving timetabling problem were compared and analyzed. The basic principle and algorithm of the characteristics of the algorithm were summarized. advantages and disadvantages of each algorithm used in the course scheduling problems were analyzed.

关 键 词：排课问题 遗传算法 模拟退火 蚁群算法 比较分析 

分 类 号：TP311[自动化与计算机技术—计算机软件与理论]