基于人工蜂群算法求解高校排课问题  

Solving University Timetabling Problem Based on Artificial Bee Colony Algorithm

作　　者：兰秋华 叶晓明[1] 成晓北[1] Lan Qiuhua;Ye Xiaoming;Cheng Xiaobei

机构地区：[1]华中科技大学能源与动力工程学院

出　　处：《科教文汇》2019年第20期81-84,共4页Journal of Science and Education

基　　金：教育部高等学校能源动力类专业教育教学改革项目“面向现代教学的能源动力类本科实验教学体系建设研究”;华中科技大学教学研究项目“面向现代教学的能源动力类本科实验教学体系建设研究”;华中科技大学教学研究项目“热能与动力工程专业卓越工程师综合性实践能力培养体系的探索”

摘　　要：为了高效智能化求解高校排课问题,分析了高校排课问题的影响因素、约束条件以及求解目标,并建立了相应的数学模型。针对求解高校排课问题多约束、多目标等特点,采用了人工蜂群算法求解问题。根据算法特点,选用了矩阵表示法表示排课方案,确定了蜂群搜索方案以及问题求解步骤。通过实例仿真验证表明,人工蜂群算法能够满足排课问题中的硬约束条件,并较优地满足软约束条件,能有效地求解高校排课问题。In order to efficiently and intelligently solve university timetabling problem,the influencing factors,constraints and solving targets of University Timetabling Problem are analyzed,and corresponding mathematical models are established.Aiming at solving the problems of multi-constraint and multi-objective University Timetabling Problem,artificial bee colony algorithm is used.According to the characteristics of the algorithm,a matrix representation is used to represent the timetabling program,the bee colony search scheme and the problem solving procedure are determined.The simulation results show that the artificial bee colony algorithm can meet the hard constraints in University Timetabling Problem and to better meet the soft constraints,which can effectively solve University Timetabling Problem.

关 键 词：高校排课问题 人工蜂群算法 矩阵表示法 仿真验证 

分 类 号：G642[文化科学—高等教育学]