Unlock instant, AI-driven research and patent intelligence for your innovation.

A Component Allocation Method for Multifunctional Mounter Based on Iterative Binary Genetic Algorithm

A technology of genetic algorithm and allocation method, which is applied in the field of component allocation of multi-function placement machines based on iterative binary genetic algorithm, can solve the problems of insufficient search randomness and failure to output the optimal solution, etc., to increase diversity and improve production efficiency Effect

Active Publication Date: 2021-08-13
宁波亦唐智能科技有限公司
View PDF9 Cites 0 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

[0015] The purpose of the present invention is to solve the problem that the existing method directly uses expert experience to limit the search range of the element type number matrix, which leads to insufficient randomness of the search and cannot output the optimal solution, and proposes a method based on iterative binary genetic algorithm Component allocation method of multi-function placement machine

Method used

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
View more

Image

Smart Image Click on the blue labels to locate them in the text.
Viewing Examples
Smart Image
  • A Component Allocation Method for Multifunctional Mounter Based on Iterative Binary Genetic Algorithm
  • A Component Allocation Method for Multifunctional Mounter Based on Iterative Binary Genetic Algorithm
  • A Component Allocation Method for Multifunctional Mounter Based on Iterative Binary Genetic Algorithm

Examples

Experimental program
Comparison scheme
Effect test

specific Embodiment approach 1

[0035] Specific implementation mode one: combine Figure 6 This embodiment will be described. A method for allocating components of a multifunctional placement machine based on an iterative binary genetic algorithm described in this embodiment, the method is specifically implemented through the following steps:

[0036] Step 1: Import PCB component information;

[0037] Step 2: Group all placement points according to the component types in the imported PCB component information to obtain the initial component group, and perform step 3 with the initial component group as the current component group;

[0038] Step 3: use the current element group to initialize the chromosome population array, and then decode the coding information of each chromosome in the chromosome population array to obtain the fitness function value of each chromosome;

[0039] Step 4: Set the termination condition for iterative optimization of the chromosome population array;

[0040] Step 5: According t...

specific Embodiment approach 2

[0049] Specific embodiment two: the difference between this embodiment and specific embodiment one is that: in the step 1, the PCB component information is imported, and the imported PCB component information specifically includes:

[0050] Component type number information: "Cpc" indicates the c-type component, c=1,2,...,C, C represents the total number of component types;

[0051] Information on the number of mounting points corresponding to various components: Φ(c) indicates the number of mounting points corresponding to the c-type component;

[0052] Nozzle type information: "Nzn" indicates the nth nozzle type, n∈{1,2,...,N}, N represents the total number of nozzle types, η(c) indicates the nozzle corresponding to the c-th type component type index;

[0053] Feeder serial number information: "Fdf" means the f-th feeder, f=1, 2,..., F, F means the total number of feeders, ξ(c) means the corresponding component of the c-th type The serial number index of the feeder, ξ(c)∈{...

specific Embodiment approach 3

[0056] Specific implementation mode three: the difference between this implementation mode and specific implementation modes one to two is: the specific process of the step 2 is:

[0057] Group components of the same component type into one group to obtain the initial component group, and perform step 3 with the initial component group as the current component group;

[0058] Use CC{ψ} to represent component groups, the total number of component groups is Ψ, the index of component groups is ψ=1,2,...,Ψ, the total number of component groups Ψ is equal to the number of component types C;

[0059] Each component group contains two component information, where the first component information is the component type number, expressed as CC{ψ}(1)=c, and the second component information is the mounting point corresponding to the component type number Number, expressed as CC{ψ}(2)=Φ(c).

[0060] In the initial component group obtained from the component information in Table 1, CC{1}=[1...

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to View More

PUM

No PUM Login to View More

Abstract

The invention discloses a method for allocating components of a multifunctional chip mounter based on an iterative binary genetic algorithm, which belongs to the technical field of surface mount technology optimization for chip mounters. The invention solves the problem that the existing methods directly use expert experience to limit the search range of the element type number matrix, resulting in insufficient randomness of the search and failure to output the optimal solution. The invention uses expert experience to design a heuristic algorithm to limit the search space, and at the same time uses a genetic algorithm to increase the diversity of searched component allocation results, and can output optimal component allocation results within a reasonable operation time. Experimental results show that the method provided by the invention can greatly improve the production efficiency of the placement machine, and the improvement of component distribution results reaches 9.68%. The invention can be applied to the optimization of the surface mount technology of the mounter.

Description

technical field [0001] The invention belongs to the technical field of surface mount technology optimization of a chip mounter, and in particular relates to a method for allocating components of a multifunctional chip mounter based on an iterative binary genetic algorithm. Background technique [0002] Modern production and life are filled with all kinds of electronic equipment. Printed Circuit Board (PCB) is the core component of these electronic equipment. The assembly line, large-scale and flexible surface mounting tasks of circuit boards have great impact on the production efficiency of placement. Higher requirements are put forward, and whether more PCBs can be produced in a short period of time is directly related to the competitiveness and efficiency of manufacturers. For a placement machine with a specific structure, it is difficult to increase the speed of mechanical movement, so the key bottleneck to further improve the placement production efficiency is whether th...

Claims

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to View More

Application Information

Patent Timeline
no application Login to View More
Patent Type & Authority Patents(China)
IPC IPC(8): H05K13/04H05K13/08H05K3/34G06Q50/04G06Q10/06G06Q10/04G06N3/12
CPCG06N3/126G06Q10/04G06Q10/0631G06Q50/04H05K3/341H05K13/0404H05K13/0417H05K13/046H05K13/0465H05K13/041H05K13/085Y02P90/30
Inventor 高会军李政锴邱剑彬于兴虎
Owner 宁波亦唐智能科技有限公司