基于模拟退火粒子群优化算法的拆卸序列规划  

Disassembly sequence planning based on particle swarm-simulated annealing optimization

作　　者：刘志峰[1] 杨德军[1] 顾国刚[1] 

机构地区：[1]合肥工业大学机械与汽车工程学院,安徽合肥230009

出　　处：《合肥工业大学学报（自然科学版）》2011年第2期161-165,179,共6页Journal of Hefei University of Technology：Natural Science

基　　金：国家"十一五"科技支撑计划资助项目(2006BAF02A02-02)

摘　　要：文章将模拟退火粒子群优化算法应用于拆卸序列规划求解过程,基于拆卸约束图构建了产品结构表达模型,将拆卸过程相关信息赋予拆卸约束图的节点与边,定义了判断拆卸序列优劣的适应度函数,将算法与模型进行了映射;最后以某款料理机主机体为例,运用模拟退火粒子群优化算法求解其拆卸序列,并与单一粒子群优化算法相比较,验证了该算法的有效性。A hybrid optimization algorithm called particle swarm-simulated annealing optimization algorithm is used in disassemble sequence planning process.This paper builds the production construction model based on disassembly constraint graph（DCG）,and makes the notes and edges in DCG also contain the information of the disassembly process.The paper defines the fitness function to judge the disassemble sequence,and conducts the mapping from the algorithm to the model.Then the main part of a kind of blender is analyzed by using the particle swarm-simulated annealing optimization algorithm as an example to compare with the particle swarm optimization（PSO） and the result verifies the effectiveness of the proposed algorithm.

关 键 词：拆卸序列规划 粒子群优化算法 模拟退火算法 拆卸约束图 

分 类 号：TH122[机械工程—机械设计及理论]