基于改进遗传算法的异步并行拆卸序列规划  

Asynchronous Parallel Disassembly Sequence Planning Based on Improved Genetic Algorithm

作　　者：孙娴静 唐秋华 邓明星[3] SUN Xianjing;TANG Qiuhua;DENG Mingxing(Key Laboratory of Metallurgical Equipment and Control of Ministry of Education;Hubei Provincial Key Laboratory of Mechanical Transmission and Manufacturing Engineering;School of Automobile and Traffic Engineering,Wuhan University of Science and Technology,Wuhan 430081,China)

机构地区：[1]武汉科技大学冶金装备及其控制教育部重点实验室,湖北武汉430081 [2]武汉科技大学机械传动与制造工程湖北省重点实验室,湖北武汉430081 [3]武汉科技大学汽车与交通工程学院,湖北武汉430081

出　　处：《工业工程》2022年第4期151-157,共7页Industrial Engineering Journal

基　　金：国家自然科学基金资助项目(51875421)。

摘　　要：针对考虑优先关系约束和机器工作区域冲突约束的异步并行拆卸序列规划问题,提出加入路径重连策略的遗传算法。通过定义零部件之间的与或优先关系,对拆卸方向进行简化。且根据工作区域冲突约束,避免零部件拆卸过程中产生工作区域冲突。在此基础上,对种群进行编码解码,并加入路径重连算子,将遗传算法迭代得到的精英解进行路径重连以增强算法的局部搜索能力。最后通过多个实际案例证明算法的有效性。Aiming at the problem of asynchronous parallel disassembly sequence planning considering the priority relationship constraint and the machine working area conflict constraint, a genetic algorithm with path reconnection strategy is proposed. The disassembly direction is simplified by defining the And/Or priority relationship between components. And via the working area conflict constraint, the working area conflict is avoided during the disassembly process of the parts. On this basis, the population is encoded and decoded, and a path reconnection operator is added to reconnect the elite solution obtained by the genetic algorithm iteration to enhance the local search ability of the algorithm. Finally, a number of actual cases prove the effectiveness of the algorithm.

关 键 词：异步并行拆卸 遗传算法 路径重连 

分 类 号：TH186[机械工程—机械制造及自动化]