求解高校教室调度问题的混合粒子群算法  

Solving for timetabling problem in universities based on hybrid particle swarm optimization

作　　者：曹策俊[1] 杨琴[2] 李从东[1] 

机构地区：[1]暨南大学管理学院,广州510632 [2]四川师范大学商学院,成都610101

出　　处：《计算机应用研究》2012年第12期4451-4454,共4页Application Research of Computers

基　　金：国家自然科学基金资助项目(70672013);四川省哲学社会科学"十二五"规划项目(SC11C042);四川省教育厅科研资助项目(10ZC004);暨南大学优秀本科推免生科研创新培育计划资助课题

摘　　要：针对高校教室调度问题进行了研究,综合考虑教室集中时间利用率和学生需求,采用三元组方式,用任务表示课程,用设备表示不同类型的教室。据此,教室排课问题被描述为一类以最小化Cmax与滞后时间和为调度目标,具有机器适用限制的并行机调度问题。然后结合问题特性,建立对应的运筹学调度模型,并运用混合粒子群算法求解该类调度问题。最后仿真结果表明实现了所讨论的两个优化调度目标,获得了满意解;同时通过与其他算法解的比较,得出混合粒子群算法非常适合求解这里所讨论的教室排课问题这一结论。The timetabling problem in universities is to assign the courses into classrooms.Taking the classrooms＇ utilization and students＇ requirements into consideration,job denoted course and machine denoting the different types of classrooms by a triplet.Thus,the parallel machine scheduling with the machine eligibility restrictions could represent the classroom curriculum problem.Its ultimate objective was minimizing Cmax and the sum of tardiness.Then,it proposed the corresponding operational scheduling model on the basis of analyzing the problem＇s features.And it applied hybrid particle swarm optimization（HPSO） algorithm to solve this problem.In the end,results show that HPSO maks the two objectives come true.It tested the feasibility of proposed algorithm by comparing the results of HPSO with that of other algorithms.

关 键 词：高校教室调度 三元组 并行机调度 运筹学模型 混合粒子群算法 

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