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

Lab Course Problems Study Based on Discrete Particle Swarm

作　　者：王超[1] 

机构地区：[1]重庆商务职业学院,重庆400036

出　　处：《计算机光盘软件与应用》2012年第3期206-207,共2页Computer CD Software and Application

摘　　要：粒子群优化算法以其实现容易、精度高、收敛快等优点引起了学术界的重视,并且在解决实际问题中展示了其优越性。本文通过改造离散粒子群算法使之适合机房排课问题的求解。从而达到为机房排课问题的解决提供一种新的思路。The particle swarm optimization algorithm for its easy implementation,high accuracy,fast convergence advantages attracted the attention of academia,and demonstrated its superiority in solving practical problems.In this paper,the transformation of discrete particle swarm optimization to solving for Lab Course.So as to achieve the solution to the problem for the Lab Course provides a new way of thinking.

关 键 词：粒子群优化算法 离散粒子群算法 机房排课 

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