Integrated optimization method for arch truss chip mounter based on coevolution

Abstract

The invention provides an integrated optimization method for an arch truss chip mounter based on coevolution. The method mainly comprises the following steps: (1) building a suction nozzle configuration optimization model and an integrated optimization mathematical model combining feeder allocation and component bonding order; (2) utilizing linear program to solve the suction nozzle configuration optimization model; (3) conducting coevolution on the feeder allocation and the component patching order adopting evolution strategies of neighborhood competition, cross-connection, variation and partial search based on coevolution to enable moving path of a bonding head to be minimum during a bonding process. The integrated optimization method has the advantages that working time of the chip mounter is shortened, and bonding efficiency is effectively improved; the method can be applied to optimization control of the arch truss chip mounter during a surface assemble process; the method overcomes the defect that conventional optimization methods are instable and simplex to solve a complex multi-decision optimization problem, and adopts coevolution to conduct simultaneous optimization on multiple subproblems.

Description

technical field [0001] The invention relates to an operation optimization control technology of an arch type mounter, in particular to an integrated optimization method for an arch type mounter based on collaborative evolution. Background technique [0002] The placement machine is an electronic assembly equipment that directly solders surface mount micro components to the printed circuit board (Printed Circuit Board referred to as PCB) or the surface of the substrate. It is the key equipment for component placement and belongs to the production line. Optimizing the operation of the placement machine is an important breakthrough point to improve assembly efficiency. [0003] This paper studies on the arch mounter. According to the literature, the placement optimization problem of a placement machine for a certain PCB board can be divided into the following three optimization sub-problems: (1) nozzle assignment problem, that is, how to assign different types of nozzles to th...

AI Technical Summary

Problems solved by technology

[0004] The operation optimization problem of multi-head placement machine has been proved to be an NP-hard combinatorial optimization problem, and it is impossible to solve such large-scale optimization problems quickly by using only classical optimization algorithms (such as linear programming, dynamic programming, integer programming, etc.) Get better optimization results

The above three sub-problems are highly related. If it is assumed that two of the problems have been solved and the solution of one of the problems is studied separately, the algorithm optimization results in actual production will be greatly reduced.

Images