| 基于Petri网和混沌粒子群的JSP优化 |
| |
| 引用本文： | 安凤梅,乐晓波,周恺卿. 基于Petri网和混沌粒子群的JSP优化[J]. 计算机工程与应用, 2011, 47(18): 29-31. DOI: 10.3778/j.issn.1002-8331.2011.18.009 |
| |
| 作者姓名： | 安凤梅 乐晓波 周恺卿 |
| |
| 作者单位： | 长沙理工大学 计算机与通信工程学院，长沙 410076 |
| |
| 摘 要： | 以最小化完工时间为目标构建Petri网模型，并基于该模型将混沌原理和粒子群算法相结合，提出了一种基于Logistic映射的混沌粒子群优化（CPSO）算法。仿真实验结果表明，该算法能跳出局部最优，增强了全局寻优能力，进一步提高了计算精度和收敛速度。
|
| 关 键 词： | Petri网 混沌粒子群算法 车间调度 |
| 修稿时间： | |
Chaotic particle swarm optimization of JSP based on Petri nets |
| |
| AN Fengmei,YUE Xiaobo,ZHOU Kaiqing. Chaotic particle swarm optimization of JSP based on Petri nets[J]. Computer Engineering and Applications, 2011, 47(18): 29-31. DOI: 10.3778/j.issn.1002-8331.2011.18.009 |
| |
| Authors: | AN Fengmei YUE Xiaobo ZHOU Kaiqing |
| |
| Affiliation: | Computer and Communication Engineering School，Changsha University of Science and Technology，Changsha 410076，China |
| |
| Abstract: | To reach the goal of minimizing the completion time,one Petri nets mode is built,and based on this model,the chaos theory and particle swarm optimization are combined,and the Chaos Particle Swarm Optimization（CPSO） algorithm based on Logistic map is proposed.The experimental results demonstrate that this algorithm has the ability to avoid falling into local minima,and improves computational precision,convergence speed and the ability of global optimization. |
| |
| Keywords: | Petri nets Chaos Particle Swarm Optimization（CPSO） job shop scheduling |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
| 点击此处可从《计算机工程与应用》浏览原始摘要信息 |
|
点击此处可从《计算机工程与应用》下载免费的PDF全文 |
