基于离散粒子群算法的排课问题研究  

Research of Curriculum Schedule Problem Based on Discrete Particle Swarm Optimization Algorithm

作　　者：于承敏[1] 姜华[1] 李寰[1] 贾保先[1] 

机构地区：[1]聊城大学计算机学院,山东聊城252059

出　　处：《微计算机应用》2010年第7期67-71,共5页Microcomputer Applications

基　　金：聊城大学科研基金资助项目;(编号X09031)

摘　　要：针对高校排课问题,提出了一种改进的离散粒子群算法。采用基于矩阵的编码方式,对粒子的位置和速度更新方法进行重新定义。利用C#语言实现了一个基于离散粒子群算法的排课系统。并以不同学院一个学期的课程表为依据对系统进行了评估,结果验证了粒子群算法在排课系统中应用的可行性,在一定程度上解决了高校复杂的排课难题,实现了智能化、人性化的排课过程。An improved discrete Particle Swarm Optimization（PSO） algorithm is presented to tackle the curriculum schedule problem of university. In the algorithm,a Matrix based encoding is designed,and a new method is used to update the positions and velocity of particles. Using C# language implemented the curriculum scheduling system based on discrete particle swarm optimization algorithm. It also makes some evaluations on the system according to class Curriculum Schedule among different schools for a half academic year. The result verified the feasibility of using the particle swarm optimization algorithm in the curriculum schedule problem,and to some extent,complex problem of curriculum schedule in university is solved,intellectualized and humanized scheduling process is realized.

关 键 词：排课 粒子群优化 离散粒子群优化 

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