基于遗传算法的多台贴片机物料调度问题

The Problem of Distributing Component between Multi-Placement Equipments Based on Genetic Algorithm

分析了传统生产中贴片机物料优化分配的问题,建立了多台贴片机物料调度的数学模型。针对该模型利用遗传算法进行了优化计算。在该计算过程中,首先对优化目标进行染色体编码,采用二进制编码方式,每个染色体都代表一组可用于具体分配方案的规则组合。其次定义种群规模,设计适应度函数,最后通过选择、交叉、变异等操作,得到目标的全局较优解。本文针对多台贴片机物料调度问题,提出了一种新的解决办法,并对某一工程实例,给出了物料分配优化的仿真结果,仿真实例证明了所提的方法具有很好的并行性,并能快速的求出问题的最优解。

Based on the analysis of traditional production of distributing component between placement equipments, the mathematical modal of the distributing problem was built. A kind of genetic algorithm was used to solve it in this paper. In the computing process, firstly, the form of binary coding was used to encode the chromosomes. Each chromosome represents that a rule of combination used in distribution. Secondly, the population size was premised for the optimized goal of distributing problem. And then the fitness function was designed. At last, after using selection, crossover and mutation operator, and then elitist strategy to prevent the premature convergence, a best or satisfactory scheduling path can be found. A new method to solve the distribution component between multi placement equipments is proposed in the paper. And the executing results using the presented algorithms in certain project case are shown, which has proved that the method obtains favorable parallelity and the optimization calculation.