基于改进引力搜索算法的异步并行拆卸序列规划研究  

Asynchronous parallel disassembly sequence planning base on improved gravitational search algorithm

作　　者：李佰霖 武攀旗 吴志超[3] 付文龙 LI Bai-lin;WU Pan-qi;WU Zhi-chao;FU Wen-long(College of Electrical Engineering and New Energy,China Three Gorges University,Yichang 443002,China;Hubei Provincial Key Laboratory for Operation and Control of Cascaded Hydropower Station,China Three Gorges University,Yichang 443002,China;Harbin Electric Machinery Company Limited,Harbin 150040,China)

机构地区：[1]三峡大学电气与新能源学院,湖北宜昌443002 [2]三峡大学梯级水电站运行与控制湖北省重点实验室,湖北宜昌443002 [3]哈尔滨电机厂有限责任公司,黑龙江哈尔滨150040

出　　处：《机电工程》2023年第1期113-121,共9页Journal of Mechanical & Electrical Engineering

基　　金：国家自然科学基金资助项目(51741907);湖北省水电机械设备设计与维护重点实验室(三峡大学)开放基金资助项目(2021KJX12)。

摘　　要：在大型复杂机械设备的检修过程中,涉及对维修目标件的拆卸,存在多人协同作业建模困难和拆卸序列求解效率低的问题,为此,对异步并行拆卸序列规划的拆卸模型和求解算法进行了研究,提出了一种基于改进引力搜索算法的异步并行拆卸序列规划方法。首先,研究了拆卸工作区域干涉和零部件之间的几何约束,建立了优先约束模型,并基于优先关系和拆卸目标件,逆向搜索出了最小待拆卸零部件集合;然后,建立了异步并行拆卸序列规划的数学模型,以拆卸时间最小化为优化目标建立了目标函数,针对异步并行拆卸序列构造了其编码和解码方法,并重构了引力搜索算法中个体进化的更新公式,设计了逃脱算子以跳出局部最优;最后,以水轮机主轴密封检修为例进行了实验,以验证GSA算法的有效性,并将其结果与采用传统算法所得结果进行对比,以证明新方法的优越性。研究结果表明:相比于传统算法,改进的引力搜索算法可以实现更少的时间代价,因此在处理复杂设备维修拆卸过程中更加有效。Aiming at the difficulty of multi-person collaborative operation modeling and the low efficiency of disassembly sequence solution in the maintenance of large and complex equipment,the disassembly model of the asynchronous parallel disassembly sequence planning and solving algorithm were studied,and an asynchronous parallel disassembly sequence planning method based on an improved gravitational search algorithm(GSA)was proposed.Firstly,the disassembly work area interference and geometric constraints between components were studied to establish a priority constraint model.Based on the priority relationship and the disassembly target parts,the minimum set of parts to be disassembled was searched backward.Then,the mathematical model of asynchronous parallel disassembly sequence planning was established,and the objective function was built with the optimization goal of minimizing disassembly time.Encoding and decoding methods were constructed for the asynchronous parallel disassembly sequences.In addition,the updated formula of the individual evolution in GSA was reconstructed,and the escape operator was designed to jump out of the local optimum.Finally,taking the hydraulic turbine main shaft seal as an example,and the effectiveness of the proposed method was proved by comparing with the traditional algorithm.The results show that improved GSA achieves less time cost than comparison algorithms and is more effective in dealing with complex equipment disassembly.

关 键 词：机械设备维修 引力搜索算法 组合优化 多人协同作业 拆卸模型 求解算法 

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