摘要
深入分析了排课问题,提出一种基于离散粒子群的排课算法,构建了相应的解题框架。针对粒子群算法有后期收敛速度慢、易收敛于局部最优的缺点,结合排课问题的特点,对粒子群算法作了改进。在三维空间中建立模型,采用避免冲突的种群初始化加快收敛,并且引入变异操作避免陷入局部最优等。实践表明改进后的粒子群算法能有效地解决排课问题。
After analyzing the problems of curriculum scheduling, an algorithm based on discrete particle swarm algorithm for the curriculum scheduling was proposed, with a framework for solving the problem. Because the particle swarm algorithm has a slow convergence speed during late period of its iterations and can easily be trapped in local optimal solution, an improved algorithm was applied with fully considering the features of curriculum scheduling. The algorithm was modeled in three-dimensional space, its particles were initialized with avoiding conflicts, and mutation was introduced to avoid being trapped in optimal solution, etc. The application makes it clear that the proposed algorithm can solve the curriculum scheduling problem effectively.
出处
《计算机应用》
CSCD
北大核心
2013年第1期207-210,共4页
journal of Computer Applications
关键词
排课问题
粒子群优化算法
组合优化
变异
curriculum scheduling problem
Particle Swarm Optimization （PSO） algorithm
combinatorial optimization
mutation
作者简介
通信作者电子邮箱red_lotus@139．com 王念桥（1971-），男，湖北武汉人，讲师，硕士，主要研究方向：软件工程、智能控制机器人；
姚四改（1965-），女，湖北襄樊人，副教授，主要研究方向：计算机辅助设计。
