文献类型：期刊文献

中文题名：改进的蚁群算法在排课系统及约束条件问题中的应用研究

英文题名：Research and Application of Improved Ant Colony Algorithm on the Curriculum Arrangement System and the Constraint Problem

作者：冯月华[1]

第一作者：冯月华

机构：[1]甘肃中医药大学定西校区理科部,甘肃兰州743000

第一机构：甘肃中医药大学定西校区

年份：2017

卷号：39

期号：6

起止页码：80

中文期刊名：泰山学院学报

外文期刊名：Journal of Taishan University

收录：国家哲学社会科学学术期刊数据库

基金：国家自然科学基金资助项目(61363058);甘肃中医药大学定西校区校级资助项目(TD2016YB04)

语种：中文

中文关键词：改进蚁群算法;信息素动态更新;排课系统;约束条件

外文关键词：improved ant colony algorithm; dynamic pheromone updating; curriculum arrangement system; constraint

摘要：针对复杂约束条件的排课算法中的组合优化问题,使用改进的蚁群算法,将排课问题简化为二分的最大匹配问题,并在带精英的MMAS算法基础上,提出信息素的动态调整策略,提高了对最短路径的敏感度和收敛速度,找出一种问题求解的优化方案.通过测试实验,证明改进算法在排课系统完全可行,能满足排课问题中的硬性约束条件,也能最大限度地满足软约束条件.
Pointing at the combinatorial optimization problem of course scheduling algorithm of complex constraints,this paper reduces the scheduling problem to the maximum matching problem of two points by using the improved ant colony algorithm.Also,this paper puts forward the information dynamic adjustment strategy based on elitist MMAS algorithm which improves the sensitivity and speed of convergence,and finally,find a solution to the optimization scheme.Through the test experiment,it is proved that the improved algorithm is feasible in the course scheduling system,and can meet the rigid constraints,and also can satisfy the soft constraint condition to the maximum.