| 求解无等待Job Shop调度的量子粒子群算法 |
| |
| 引用本文： | 施若,宗利永.求解无等待Job Shop调度的量子粒子群算法[J].计算机工程与应用,2010,46(26):200-202. |
| |
| 作者姓名： | 施若 宗利永 |
| |
| 作者单位： | 1.贵州财经学院 金融学院，贵阳 550004 2.上海理工大学 管理学院，上海 200093 |
| |
| 摘 要： | 针对无等待Job Shop问题，采用量子粒子群优化算法对其进行了求解。该算法采用位置矢量的编码方式，全左移验证方式计算适应值。最后通过MATLAB对实例问题的仿真测试，量子粒子群优化算法不仅收敛速度快，而且还具有较好的求解质量。
|
| 关 键 词： | 无等待JobShop问题 量子粒子群优化算法 粒子群优化算法 |
| 收稿时间： | 2009-11-5 |
| 修稿时间： | 2010-3-29
|
Solve no wait job shop scheduling problem based on quantum particle swarm algorithm |
| |
| SHI Ruo,ZONG Li-yong.Solve no wait job shop scheduling problem based on quantum particle swarm algorithm[J].Computer Engineering and Applications,2010,46(26):200-202. |
| |
| Authors: | SHI Ruo ZONG Li-yong |
| |
| Affiliation: | 1.School of Finance，College of Finance and Economy of Guizhou，Guiyang 550004，China 2.College of Management，University of Shanghai for Science and Technology，Shanghai 200093，China |
| |
| Abstract: | Coping with no wait job shop scheduling problem,the method that quantum particle swarm algorithm is proposed to be applied to no wait job shop scheduling problem, this algorithm uses location of the vector encoding scheme and the method of left shift timetabling to compute fitness.Then this algorithm is applied to benchmarks problems and tested with MATLAB simulation,the result shows that this algorithm has better answers and more rapid convergence. |
| |
| Keywords: | no-wait job shop scheduling problem quantum particle swarm optimization particle swarm optimization |
| 本文献已被 维普 万方数据 等数据库收录！ |
| 点击此处可从《计算机工程与应用》浏览原始摘要信息 |
|
点击此处可从《计算机工程与应用》下载全文 |
