基于遗传算法的焊接生产线工位平衡规划方法

A Genetic-algorithm-based Approach to The Welding Productive Line Work-station Balance Planning

在现代化大规模大批量的流水装配制造业中,数量众多的作用分配和多工位的合理安排使工位平衡问题显得更为突出。针对第一类工位平衡问题,即在给定的生产节拍下最小化工位数,首先分析了该问题并建立了数学模型,进而提出了一种基于改进遗传算法求解工位平衡问题的方法。该算法以焊接任务的操作顺序优先关系为约束前提,在初始种群的生产以及交叉和变异过程中保证了染色体解的可行性,同时在遗传算法的选择过程中考虑了具有相同工位数的最优作业方案的工时标准差,从而提高了算法的搜索效率和解的可靠性。最后通过实例求解验证了该算法的有效性。

In the modern large-scale and large quantities assembly line of manufacturing, the reasonable distribution of tasks and arrangements of multiple stations make assembly line balance problem more and more important. The first type of assembly line balancing is analyzed in this article, that is, minimizing the number of stations under a given production cycle time. The mathematical model is estabilished first and then the genetic algorithm for solving this problem is presented. In this algorithm, the order of welding task precedence relations operating premise for the constraints in the production of the initial population and crossover and mutation process to ensure the feasibility of the chromosome solution. While the genetic algorithm selection process the standard diviation of operating time is considered for different task distribution solutions with equal number of stations. This method improves the search efficiency and the result reliability. An example is solved to demonstrate the effectiveness of the algorithm.