基于改进Floyd算法的转向机拆卸序列研究

Disassembly sequence planning of steering machine based on the improved Floyd algorithm

针对循环球式转向机拆卸方向多,组件需作为整体拆卸,难以规划拆卸序列的问题,提出了拆卸网络图和改进Floyd算法相结合的拆卸序列规划方法。首先建立了循环球式转向机的拆卸网络图,基于方法时间衡量(MTM)法得到了每个拆卸步骤的拆卸耗时,从而得到了拆卸网络图的赋值矩阵;比较了已有的两种改进Floyd算法的计算效率和适用范围,通过融合两种算法的改进思想得到了新的改进Floyd算法,大幅减少了循环次数和算法复杂度;最后用改进后的Floyd算法在Matlab软件中仿真得到了结果。研究结果表明:通过拆卸网络图和改进Floyd算法的有效结合,能减少计算量,提高运算效率,从而更有效地得到转向机基于完全拆解下的最优拆卸序列。

Aiming at the problem that recycling ball steering machine is difficult to plan disassembly sequence,a planning method combining the network graph of disassembly and the improved Floyd algorithm was proposed. The assignment matrix was obtained by establishing the network graph of disassembly and calculating the demolition time based on the method time measurement（ MTM）. After comparing the computational efficiency and the applicable range of two existing improved Floyd algorithms,a new algorithm was improved,the complexity of which was greatly reduced. Finally,the improved Floyd algorithm was used to simulate in Matlab. The results indicate that the efficiency of calculation is improved by using the improved Floyd algorithm,and it is more practical to obtain the optimal disassembly sequence of the steering machine for complete dismantling.