An Assembly Sequence Planning Method Based on Discrete Difference Genetic Algorithm

The assembly sequence of products directly affects the assembly quality and assembly cost of products. Artificial planning assembly sequence can no longer meet the increasingly complex requirements of assembly. More and more intelligent algorithms are applied to the field of sequence planning. In order to improve product assembly efficiency, the paper proposes an assembly sequence planning method based on the discrete difference genetic algorithm. Differential evolution algorithm is a heuristic search algorithm that can be programmed with real numbers and has a simple structure and is easy to implement. According to the characteristics of assembly sequence planning, the operations of variation, crossover and mutation were redefined, and the fitness function model with the feasibility, stability, assembly direction change times and assembly tool change times as the evaluation index was established. The algorithm is analyzed by the vise assembly example. The feasibility and stability of the algorithm are verified. The comparison with genetic algorithm proves: the method is more efficient; the convergence speed is faster; the quality and quantity dependence of the initial population is smaller.