基于改进蚁群算法的机房排课问题及仿真研究  

The Research on Computer Room Scheduling Problems and Simulation Based on Improved Ant Colony Algorithm

作　　者：王文君[1] WANG Wen-jun(Minjiang University,Fuzhou 350108,China)

机构地区：[1]闽江学院,福州350108

出　　处：《长春工程学院学报（自然科学版）》2020年第4期109-112,共4页Journal of Changchun Institute of Technology：Natural Sciences Edition

摘　　要：为提高机房排课的质量,提出一种遗传算法结合蚁群算法的机房排课二分图模型求解方法。在将机房排课问题转换为二分图的基础上,利用蚁群算法对排课二分图模型进行求解。其中针对蚁群算法在路径搜索方面存在的局限,提出利用最大—最小蚂蚁系统对蚁群算法进行改进,同时结合遗传算法对蚁群算法初始信息素分布进行寻优。仿真实验表明,提出的遗传结合蚁群的混合算法,无论是在排课质量还是在最优适应度值方面,都具有无可比拟的优势。In order to improve the quality of course arrangement in computer room,this paper proposes a method to solve the bipartite graph model of course arrangement in computer room by combining genetic algorithm and ant colony algorithm.On the basis of converting the scheduling problems of computer room into bipartite graph,and the model of bipartite graph is solved by ant colony algorithm.However,in view of the limitations of ant colony algorithm in path search,the maximum-minimum ant system to improve the ant colony algorithm,and the combining with the genetic algorithm to optimize the initial pheromone distribution of the ant colony algorithm are proposed.The simulation results show that the genetic ant colony hybrid algorithm proposed in this paper has incomparable advantages in both the quality of course arrangement and the optimal fitness value.

关 键 词：机房排课 蚁群算法 遗传算法 二分图 

分 类 号：TP301[自动化与计算机技术—计算机系统结构]