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

Disassembly sequence planning based on improved genetic algorithm

作　　者：王运涛 刘钢 薛俊芳[2] WANG Yuntao;LIU Gang;XUE Junfang(Hebei Vocational College of Rail Transportation,Shijiazhuang 050000,China;School of Mechanical Engineering,Inner Mongolia University of Technology,Huhhot 010000,China)

机构地区：[1]河北轨道运输职业技术学院,石家庄050000 [2]内蒙古工业大学机械学院,呼和浩特010000

出　　处：《现代制造工程》2022年第1期137-142,136,共7页Modern Manufacturing Engineering

摘　　要：拆卸序列规划是拆卸回收的关键部分,为了提高拆卸效率,找到产品最优拆卸方案,根据产品拆卸对象的优先关系和连接关系建立优先约束矩阵,同时依据拆卸组合优化的特点改进基本遗传算法的染色体编码方式和遗传算子,基于优先约束矩阵判别拆卸序列的可行性,改进算法流程,并利用MATLAB软件进行编码运行计算,得出产品的最优拆卸序列,最后通过实例证明了该方法的有效性。Disassembly sequence planning is a key part of disassembly and recycling.In order to improve the disassembly efficiency,find the most effective disassembly plan for the product,a priority constraint matrix based on the priority relationship and connection relationship of the product disassembly object was established.At the same time,according to the characteristics of disassembly combination optimization,the chromosome coding form and genetic operator of the basic genetic algorithm were improved,and the feasibility of disassembly sequence was distinguished based on priority constraint matrix to improve algorithm flow.And MATLAB software was used to perform coding operation calculation to obtain the optimal disassembly sequence of the product.Finally,an example proved the effectiveness of the method.

关 键 词：拆卸序列规划 优先约束矩阵 遗传算法 

分 类 号：TP18[自动化与计算机技术—控制理论与控制工程]