| 关于多处理机调度问题的量子粒子群算法研究 |
| |
| 引用本文： | 黄天赦,叶春明,叶伟.关于多处理机调度问题的量子粒子群算法研究[J].计算机工程与应用,2009,45(19):49-51. |
| |
| 作者姓名： | 黄天赦 叶春明 叶伟 |
| |
| 作者单位： | 上海理工大学 管理学院，上海 200093 |
| |
| 摘 要： | 对多处理机调度问题建立数学模型，提出了将量子计算和粒子群算法相结合的方法来解决这类调度问题，该方法不仅寻优速度快，而且提高了进化后期算法的收敛精度。通过对比测试，体现了量子粒子群算法的有效性。
|
| 关 键 词： | 粒子群算法 量子 多处理机调度问题 模拟退火 优化 |
| 收稿时间： | 2008-4-21 |
| 修稿时间： | 2008-7-21
|
Study on multiprocessor scheduling problem on quantum particle swarm optimization |
| |
| HUANG Tian-she,YE Chun-ming,YE Wei.Study on multiprocessor scheduling problem on quantum particle swarm optimization[J].Computer Engineering and Applications,2009,45(19):49-51. |
| |
| Authors: | HUANG Tian-she YE Chun-ming YE Wei |
| |
| Affiliation: | School of Business，University of Shanghai for Science and Technology，Shanghai 200093，China |
| |
| Abstract: | The paper gives an optimization mathematical model of multiprocessor scheduling problem.A novel hybrid Particle Swarm Optimization (PSO) algorithm called Quantum Particle Swarm Optimization (QPSO) for this problem is proposed.The algorithm not only has the fast optimum search ability,but also improves the accuracy in the later evolution period.The experimental results of QPSO on multiprocessor scheduling problem show the efficiency of the new algorithm. |
| |
| Keywords: | Particle Swarm Optimization（PSO） quantum multiprocessor scheduling problem simulated annealing optimization |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
| 点击此处可从《计算机工程与应用》浏览原始摘要信息 |
|
点击此处可从《计算机工程与应用》下载全文 |
