Algorithms for solving assembly sequence planning problems

Assembly sequence planning is one of the key issues in DFA and computer-aided assembly process planning research for concurrent engineering. The purpose of this paper is to solve the problem of insufficient individual intelligence in evolutionary algorithms for assembly sequence planning, and a evolutionary algorithm for assembly sequence planning is designed. In this paper, the particle swarm optimization (PSO) algorithm is used to optimize the hybrid assembly sequence planning and assembly line balance problems. According to the assembly sequence problem, the number of assembly tool changes and the number of assembly orientation changes are transformed into the operation time of the assembly line. At the same time, the transportation of heavy parts in the assembly balance problem is considered. Then, by extracting the connection relationship and information of the parts, the disassembly method is used to inversely obtain the disassembly support matrix, and then, it is used to obtain the priority relationship diagram of the assembly operation tasks that indicate the order constraints of the job tasks on the assembly line. Aiming at the shortcoming that particle swarm optimization algorithm is easy to fall into local optimum, a various population strategy is adopted to shorten the evolution stagnation time, improve the evolution efficiency of particle swarm optimization algorithm, and enhance the optimization ability of the algorithm. Combined with the three evaluation indicators of assembly geometric feasibility, assembly process continuity, and assembly tool change times, a fitness function is constructed to achieve multi-objective optimization. Finally, experiments show that the multi-agent evolutionary algorithm is incorporated into the planning process to obtain an accurate solution through the various population strategy–particle swarm optimization algorithm, which proves the feasibility of the compound algorithm and has better performance in solving assembly sequence planning problems.