成组蚁群算法求解考虑工序关联的第Ⅰ类双边装配线平衡问题  

Grouped Ant Colony System for Solving the Type I Two-sided Assembly Line Balancing Problem Considering Task Correlation

作　　者：罗亚波[1] 雷威 LUO Yabo;LEI Wei(School of Mechanical and Electrical Engineering,Wuhan University of Technology,Wuhan,Hubei 430070,China)

机构地区：[1]武汉理工大学机电工程学院,湖北武汉430070

出　　处：《工业工程与管理》2024年第3期192-199,共8页Industrial Engineering and Management

基　　金：国家自然科学基金资助项目(51875430)。

摘　　要：在第I类双边装配线平衡问题的研究中,鲜有针对相同优化程度的可行解内任务关联性分析的现状。基于此,本文提出了任务之间的连续性关联属性和对称性关联属性以衡量任务间的关联度,以最小化工位数为一级目标、最大化任务关联度为二级目标,建立了考虑任务关联度的双边装配线平衡优化模型。提出了一种新型成组蚁群算法,将蚂蚁群体划分为组内分工相异的多组蚂蚁,每组蚂蚁作为一个整体进行多路径的构建,从而实现模型的求解。算法重新设计了路径选择公式和信息素更新公式,并以一个小型案例阐明了成组蚁群的路径构建方法。以三种规模的标杆算例和一个大型实例为对比实验案例,通过与现有文献比对,表明了所提算法在求解双边装配线平衡问题方面的有效性和可靠性。Combined with the fact that there is little research on task correlation within the same optimized feasible solutions in the type-I two-sided assembly line balancing problem,the attribute of the continuity correlation and symmetry correlation between tasks were proposed to measure the correlation degree between tasks.Taking the minimum number of workstations as the first-level objective and maximum task correlation degree as the second-level objective,a two-sided assembly line balance optimization model was established.A new grouped ant colony system algorithm was proposed,which divided the ant colony into multiple groups of different ants.A multi-path was constructed as a whole by each group of ants to the model.The path selection formula and pheromone update formula were redesigned and a small case was used to illustrate the muti-path construction method of the proposed algorithm.Taking three scale benchmark examples and a large-scale instance as comparative experimental cases,the effectiveness and reliability of the proposed algorithm were verified by comparing with the existing literature.

关 键 词：双边装配线平衡问题 任务关联 蚁群算法 启发式算法 

分 类 号：C934[经济管理—管理学]