基于改进遗传算法的产品拆卸序列规划  

Product Disassembly Sequence Planning Based on Improved Genetic Algorithm

作　　者：吴昊[1] 左洪福[1] 

机构地区：[1]南京航空航天大学,南京210016

出　　处：《中国机械工程》2009年第6期699-703,共5页China Mechanical Engineering

基　　金：国家863高技术研究发展计划资助项目(2006AA04Z427);国家自然科学基金资助项目(60672164)

摘　　要：为了能以较高的效率求解出产品拆卸序列的方案,首先,根据拆卸特点构建了产品拆卸混合图模型,该模型描述了零部件之间的连接关系和优先关系。然后,通过推理的方法生成产品所有可行的拆卸序列。在有了可行解的基础上建立目标函数,并利用基于二叉树的遗传算法对拆卸序列进行优化。最后,通过一个实例验证了该方法的可行性及优化算法的有效性。To solve product disassembly sequence planning problem efficiently, product disassembly hybrid graph model, which described the connection, non-connection and precedence relationships between the product parts, was established based on the characteristics of disassembly. All the feasible disassembly sequence was obtained through inference method. Further, the optimization model was provided to optimize disassembly sequence. And the solution methodology based on genetic algorithm with binary- tree algorithm was given out. Finally, an example was analyzed in detail, and the result shows that the model is correct and efficient.

关 键 词：拆卸序列规划 拆卸混合图 连接矩阵 优先矩阵 二叉树算法 遗传算法 

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