基于Memetic算法的某轻型飞机U型装配线平衡研究

The U-shaped Assembly Line Balancing of a Light Airplane Applying Memetic Algorithm

为解决传统遗传算法(GA)在某轻型飞机第Ⅱ类U型装配线平衡问题(UALBP-Ⅱ)优化计算中容易陷入早熟的问题,应用Memetic算法进行平衡优化计算。考虑了设备能力,以装配线节拍的最小化和各工作站间能力平衡为优化目标,针对某轻型飞机的U型装配线,建立了多目标、多类约束数学模型,并给出工序操作顺序、设备能力等约束条件。在标准遗传算法基础上引入贪婪算法,实现全局和局部寻优,并给出算法的流程。最后以某轻型飞机装配线为对象进行优化计算,通过对Memetic算法和标准遗传算法求解结果的比较,说明Memetic算法收敛性更好,能更快地找到目标函数的最优解。

In order to solve the precocious problem of traditional genetic algorithm（ GA） in a light airplane u-shaped assembly line balancing type-Ⅱ problem（ UALBP-Ⅱ）,Memetic algorithm was proposed in optimization calculation. Taking into account equipment capacity,mathematical model of multi-objective,multiple constraints was adapted to a light airplane u-shaped assembly line for aiming at minimizing the cycle time of assembly line and smoothing the workload between each workstation,and described the constraints of process operation sequence,equipment capacity and so on in detail. Greedy algorithm was added based on genetic algorithm to achieve global and local optimization,and the process of the algorithm was provided. Finally,the optimization calculation results of Memetic algorithm and standard genetic algorithm in a light aircraft assembly line show that Memetic algorithm is in a better astringency and was more quickly to find the optimal solution of objective function.