基于拆卸Petri网和混沌粒子群的拆卸序列规划  

Disassembly Sequence Planning Based on Disassembly Petri Nets and Chaos Particle Swarm Optimization Algorithm

作　　者：王攀[1] 程培源[1] 王威[1] 张爽[1] 

机构地区：[1]空军工程大学防空反导学院,陕西西安710051

出　　处：《机械设计与制造》2015年第1期251-255,共5页Machinery Design & Manufacture

基　　金：国家自然科学基金(51075395)

摘　　要：为解决燃气涡轮发电机组虚拟拆装训练中拆卸序列规划问题,提出了基于拆卸Petri网和混沌粒子群优化算法的拆卸序列规划方法。在基本Petri网的基础上进行拓展,引入了时间元素,构建了拆卸Petri网模型;针对粒子群优化算法容易陷入局部极值的不足,将混沌寻优方法嵌入到粒子群优化算法中,结合早熟评判标准,提高粒子群算法全局寻优能力。运用上述方法,以最短时间为目标,对分配机匣的完全拆卸序列进行仿真实验,得到了符合实际操作规律,可行有效的拆卸序列。In order to plan the disassembly sequence of the gas turbine generator virtual system,a method disassembly sequence planning based on disassembly Petri nets and chaos particle swarm optimization algorithm was put forward.The time element was introduced to basic Petri nets,and a disassembly Petri nets model was built combined with disassembly precedence matrix.Chaos state was introduced into the original particle swam optimization,and combined with the judge standard of early-maturing to improve computational precision.The method was used to plan the complete disassembly sequence of the distributor cartridge with the goal for the shortest time,and the result of experiment was effective.

关 键 词：拆卸序列 拆卸Petri网 混沌 粒子群优化算法 

分 类 号：TH16[机械工程—机械制造及自动化] TP391[自动化与计算机技术—计算机应用技术]