Asynchronous parallel disassembly sequence planning for multi-manipulator based on improved shuffled frog leaping algorithm

Abstract

To solve the problem of low disassembly efficiency of complex products, an asynchronous parallel disassembly sequence planning method of multi-manipulator based on improved shuffled frog leaping algorithm was proposed. Depending on the characteristics of this method, the disassembly manipulators are taken as the research object, and the minimum completion time of disassembly is taken as the optimization objective. Based on the basic disassembly time of parts, the disassembly preparation time caused by the change of disassembly tools and directions is considered, so that the objective function evaluation model is more realistic. Then, the mathematical model of asynchronous parallel disassembly sequence planning is constructed and the disassembly information modeling method is optimized. We proposed a new method based on the fastener constraint matrix and the part constraint matrix to build the information model of product disassembly. Based on this model, the detachable conditions are derived and the feasible disassembly sequence is obtained. In order to improve the performance of the proposed algorithm, a double-link encoding method and an efficient decoding operator is proposed. The adjustment orders which based on adjustment position and the substitution formulas are constructed to carry out the new segmental local evolution of frog individuals, and the update formula of frog position is reconstructed. Furthermore, the two-point mutation operator is added to the global information exchange strategy to enhance the search ability of the algorithm. The proposed algorithm is applied to a screw lifting mechanism and four products of varying complexity, and the results are compared with two algorithms. The results show that the proposed method can solve disassembly problems of different scales and is especially effective in solving large-scale disassembly problems.

Improved Brain-Storm Optimizer for Disassembly Line Balancing Problems Considering Hazardous Components and Task Switching Time

“…If any task is assigned to workstation w, i.e., ∑ j∈J ∑ k∈K x j,w,k = 1, the workstation has to be turned on, i.e., y w = 1. Constraint (9) limits the work cycle of each workstation to no longer than T. Constraints (10) and (11) are the ranges of the decision variables.…”

“…DLBPs can be classified into linear [10], parallel [11], bilateral [12], and U-shaped [13] ones according to different disassembly line layouts. Although the last three layouts are the new variants of a linear one, they are rarely used in practice due to two main limitations.…”

A Hybrid Approach Combining Improved Shuffled Frog-Leaping Algorithm With Dynamic Programming for Disassembly Process Planning

“…10) Although parallel disassembly can be more effective, it can only be applied to big products which allow parallel disassembly. In [36] the authors proposed an improved SFLA for asynchronous parallel disassembly sequence planning for complex product which usually faces the problem of low disassembly efficiency. However, that study did not take uncertainties of varying skill levels of operators and product conditions into account.…”

An improved multi-objective evolutionary algorithm for multiple-target asynchronous parallel selective disassembly sequence planning

“…It allows the operators to immediately start next task if the disassembly constraints are not violated, which eliminates the synchronization requirement between operators. Zhu et al 23 studied a APDSP considering the disassembly preparation time caused by the change of disassembly tool and direction. Xing et al 24 proposed a novel method to deal with the problems of highly time-dependent on asynchronous parallel disassembly mode.…”