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

第34卷第2期 合肥工业大学学报(自然科学版) V01．34No．2 JOURNAI。OFHEFEIUNIVERSITYOFTECHNOLOGY 2011牟2月 Feb．201l Doi．10。3969／j．issn．1003—5060．2011．02．001 基于模拟退火粒子群优化算法的拆卸序列规划 刘志峰， 杨德军， 顾国刚 (合肥工业大学机械与汽车工程学院，安徽合肥230009) 摘要：文章将模拟退火粒子群优化算法应用于拆卸序列规划求解过程，基于拆卸约束图构建了产品结构表 达模型，将拆卸过程相关信息赋予拆卸约束图的节点与边，定义了判断拆卸序列优劣的适应度函数，将算法与 模型进行了映射；最后以某款料理机主机体为例，运用模拟退火粒子群优化算法求解其拆卸序列，并与单一粒 子群优化算法相比较．验证了该算法的有效性。 关键词：拆卸序列规划；粒子群优化算法；模拟退火算法；拆卸约束图 中图分类号：THl22 文献标识码：A 文章编号：1003-5060(2011)02-0161-06 on based Disassemblysequenceplanning particle swarm-simulatedanneal ingoptimization LIU YANGun， GU Zhi—feng， De-j Guo-gang of andAutomobile of (Sch∞lMachinery Englneering，Hefeikhology。Hefei230009，China) University Abstract：A called swarm-simulated is hybridoptimizationalgorithmparticle annealingoptimizationalgorithm usedindisassemble buildsthe constructionmodelbasedon sequence planningprocess．Thispaper production constraint makesthenotesand inDCGalsocontaintheinformationof disassemblygraph(DCG)，and edges the definesthefitnessfunctionto thedisassemble con— disassemblyprocess．Thepaper judge sequence，and ducts fl is U- the fromthe tothemodeLThenthemain ofkindofblender mapping algorithm part analyzedby the swarm-simulated asan