Optimizing method for product assembly sequences

Abstract

The invention discloses an optimizing method for product assembly sequences. The optimizing method includes the following steps that firstly, a three-dimensional space assembly interference matrix is constructed according to the geometrical relationship, the cooperative relationship and the motion constraint relationship of parts of a product to be assembled, and feasible product assembly sequences are obtained; secondly, the assembly cost serves as the index of program evaluation of the product assembly sequences, and a fitness function suitable for the universal gravitation search algorithm is constructed; thirdly, the calculation formula of the universal gravitation search algorithm is defined and transformed again, and a new universal gravitation search and calculation formula is constructed; fourthly, the new universal gravitation search and calculation formula is used for conducting iteration solving on the assembly sequences of products to be assembled, and an obtained calculation result is the optimal assembly sequence. According to the optimizing method for the product assembly sequences, the assembly cost serves as the index of program evaluation of the assembly sequence, the optimal assembly sequence can be rapidly and reliably obtained through the revised universal gravitation search algorithm, and the combination explosion problem of the assembly sequences of complex products is solved.

Description

technical field [0001] The invention relates to computer-aided manufacturing technology in manufacturing industry, in particular to an optimization method for product assembly sequence. Background technique [0002] According to statistics, the assembly cost accounts for about 40%-60% of the total cost of product design. How to find a reasonable and feasible assembly sequence that satisfies geometric constraints and other constraints (process, assembly cost, etc.) under the premise of a given product design plan , is very meaningful work. The essence of the assembly sequence planning problem is an NP combinatorial optimization problem. There are two traditional methods of assembly sequence planning: one is based on the knowledge and experience of the assembly engineer, and this method is greatly affected by the designer's knowledge limitations and subjectivity , especially for the assembly process of complex parts, the designed assembly sequence is often not optimal, or eve...

AI Technical Summary

Problems solved by technology

[0004] In order to solve the above-mentioned problems existing in the prior art, the object of the present invention is to provide a method for optimizing product assembly sequence, which uses assembly cost as the index of assembly sequence planning and evaluation, and establishes product assembly model to optimize the geometry of product parts. Information and non-geometric information are described, including part size, fit relationship between parts, motion constraint relationship, etc., to obtain a feasible product assembly sequence, and then introduce a revised gravitational search algorithm to treat complex product assembly parts as an independent system. On the basis of the search space, the fitness function is constructed according to the assembly cost, and the search for the optimal solution is completed through the new gravitational formula, so that the optimal assembly sequence can be obtained quickly and reliably, and the complex product assembly sequence can be effectively avoided. combinatorial explosion problem

Images