复杂产品混合ASP和ALB问题研究  

Research on the hybrid ASP and ALB problem of complex products

作　　者：崔若梁 颜伟[1] 孙佳旭 CUI Ruoliang;YAN Wei;SUN Jiaxu(School of Energy and Mining Engineering,Shandong University of Science and Technology,Qingdao 266590,China)

机构地区：[1]山东科技大学能源与矿业工程学院,青岛266590

出　　处：《现代制造工程》2022年第11期1-7,共7页Modern Manufacturing Engineering

基　　金：山东省自然科学基金项目(ZR2021ME086);青岛市社科规划项目(QDSKL2001153)。

摘　　要：为了缩短产品研制周期、提高产品生产效率,通过使用基于分级贪心策略的蚁群优化算法,对复杂产品的混合装配序列规划(Assembly Sequence Planning,ASP)和装配线平衡(Assembly Line Balance,ALB)问题进行优化求解。在获得产品装配网络计划图和可行装配序列的基础上,使装配线上的工作负荷均衡达到预计的理想情况,同时最大化装配线平衡率以及最小化装配线平滑指数。最后通过算例进行验证,改进后的蚁群优化算法可在较少次迭代过程中求出最优解,且算法随着求解问题的复杂度增加仍能保持较高的求解效率。In order to shorten the product development cycle and improve production efficiency,the ant colony optimization algorithm based on hierarchical greedy strategy was used to optimize the hybrid Assembly Sequence Planning(ASP)and Assembly Line Balance(ALB)problems of complex products.On the basis of obtaining the product assembly network plan and feasible assembly sequence,the work load balance on the assembly line can reach the expected ideal situation,while maximizing the production efficiency and minimizing the smoothness index of the assembly line.Finally,it is verified by an example that the improved ant colony optimization algorithm can obtain the optimal solution in fewer iterations,and the algorithm can still maintain a high solution efficiency as the complexity of the solution increases.

关 键 词：装配序列规划 装配线平衡 蚁群优化算法 分级贪心策略 

分 类 号：TP391[自动化与计算机技术—计算机应用技术]