Journal of Jilin University(Engineering and Technology Edition) ›› 2023, Vol. 53 ›› Issue (7): 2053-2060.doi: 10.13229/j.cnki.jdxbgxb.20211050

Previous Articles    

Balancing and collaborative optimization of two⁃sided U⁃type assembly line with multi⁃constraint

Yu-ling JIAO(),Xue DENG,Lin LI,Wen-jia LIU,Tian-ze ZHANG,Nan CAO   

  1. College of Transportation,Jilin University,Changchun 130022,China
  • Received:2021-10-18 Online:2023-07-01 Published:2023-07-20

Abstract:

Aiming at the efficiency improvement and layout optimization of the assembly line, combined with the advantages of the two-sided line and the U-type line, a collaborative optimization model of two-sided U-type assembly line is proposed. A new design with P-l partition layout is defined to simplify the balancing system of two-sided U-type assembly line balancing problem. Considering the task orientation and time sequencing in cross-workstation, to minimize the number of positions as the primary objective and minimize the number of workstations as the secondary objective, the mathematical model of two-sided U-type assembly line balance multi- constraint is established. And a heuristic algorithm based on multi-level priority rules is proposed to solve the model. 20 classic examples are calculated. The results of the heuristic algorithm are compared with the results of the modified particle swarm optimization algorithm and the bi-objective integer programming model method. The number of optimal results accounts for 95%, which verifies that the collaborative optimization model and algorithm are reasonable, and provides a useful reference for the modeling and solution of two-sided U-type assembly line balancing.

Key words: logistics engineering, two-sided U-type assembly line balancing, heuristic algorithm of a multi-priority rule, collaborative optimization, partition layout

CLC Number: 

  • TB491

Fig.1

Two-side U-type assembly line layout diagram"

Table 1

Symbol description"

C装配线节拍UA未分配作业集合
p位置循环变量,P=1,2,?,NPCAl1满足优先关系的候选作业集,l=1,2,3,4
l区域循环变量,l=1,2,3,4CAl2满足操作方位约束的候选作业集
NK工作站总数CAl3满足当前区域工作站允许开始时间候选作业集
NP位置总数CAl4满足节拍约束的候选作业集
ωp,l位置p区域l处工作站开启为1,否则为0Ap,l分配至位置p区域l工作站的作业集合
Crop位置p处交叉工作站指示变量(0为不交叉;1为交叉;2为未定义)TP,ls位置p区域l处工作站允许开始时间
ti作业i的操作时间,作业编号i?Tp,l位置p区域l处工作站总时间
tis作业i的开始时间g分配到装配线右边为1,装配线左边为0
tif作业i的完成时间xi,p,l,g作业i分配到位置p区域l的工作站为1,未分配为0
Hi作业i的时间阶位值vi,j作业i在作业j之前完成为1,否则为0
Q所有作业集合M一个很大的数
Bset优先关系集合,ij的先行作业,(i,j)Bset

Table 2

Types statistics of assignable jobs for locations"

属 性工作站所属区域
区域1区域2区域3区域4

工作站方位

作业方向

入口作业

L型E型

入口作业

R型E型

出口作业

R型E型

出口作业

L型E型

Fig.2

Job precedence diagram"

Table 3

Time order value calculation results"

参数符号作业编号
123456789101112
ti232311332221
Hi101788146555231

Fig.3

Task processing sequence diagram with 5cycle time"

Table 4

Summary of calculation results and indicators"

算例节拍理论值HAMPRPSO6BIOIP4
双边U型双边U型双边U型双边直线
NPNKCroNPNKNPNKNPNK
P936260262636
45250252535
54140141424
63130131323
P1255251252545
65251252535
74140141424
84140141424
156262262646
P16166260262636
185251252545
195251252535
205251252535
214252242444
P24224242141424
188382282848
207382272747
256262262636
305252252535
404140141424
1 Bartholdi J J. Balancing two-sided assembly lines: a case study[J]. International Journal of Production Research, 1993, 31(10): 2447-2461.
2 Miltenburg G J. The U-line line balancing problem[J]. Management Science, 1994, 40(10): 1378-1388.
3 Yegul M F, Agpak K, Yavuz M. A new algorithm for U-shaped two-sided assembly line balancing[J]. Transaction of The Canadian Society for Mechanical Engineering, 2010, 34(2): 225-241.
4 Agpak K, Yegul M F, Gokcen H. Two-sided U-type assembly line balancing problem[J]. International Journal of Production Research, 2012, 50(18): 5035-5047.
5 Delice Y, Aydogan E K, Ozcan U. Stochastic two-sided U-type assembly line balancing: a genetic algorithm approach[J]. International Journal of Production Research, 2016, 54(11): 3429-3451.
6 Delice Y, Aydogan E K, Ozcan U, et al. Balancing two-sided U-type assembly lines using modified particle swarm optimization algorithm[J]. 4OR-A Quarterly Journal of Operations Research, 2017,15(1):37-66.
7 Delice Y, Aydogan E K, Soylemez I, et al. An ant colony optimisation algorithm for balancing two-sided U-type assembly lines with sequence-dependent set-up times[J]. SADHANA-Academy Proceedings in Engineering Sciences, 2018, 43(12): No.133588301.
8 焦玉玲, 邢小翠, 朱春凤 等. 简单直线和U型装配线平衡中的改进阶位法[J].同济大学学报:自然科学版, 2019, 47(1): 143-148.
Jiao Yu-ling, Xing Xiao-cui, Zhu Chun-feng, et al. Modified ranked positional weight technique for assembly line balancing of simple line and U-shape[J]. Journal of Tongji University(Natural Science), 2019, 47(1): 143-148.
9 Zhang Zi-kai, Tang Qiu-hua, Li Zi-xiang, et al. Modelling and optimisation of energy-efficient U-shaped robotic assembly line balancing problems[J]. International Journal of Production Research,2019(17): 5520-5537.
10 Zhang Zi-kai, Tang Qiu-hua, Zhang Li-ping. Mathematical model and grey wolf optimization for low-carbon and low-noise U-shaped robotic assembly line balancing problem[J]. Journal of Cleaner Production,2019, 215: 744-756.
11 焦玉玲, 李名鹃, 王占中, 等. 一种随机双U型装配线优先权值平衡方法[J]. 吉林大学学报:工学版, 2020, 50(6): 2087-2093.
Jiao Yu-ling, Li Ming-juan, Wang Zhan-zhong, et al. A random double U-shaped assembly line balancing method using priority value[J]. Journal of Jilin University(Engineering and Technology Edition), 2020, 50(6): 2087-2093.
12 Jiao Yu-ling, Jin Han-qi, Xing Xiao-cui, et al. Assembly line balance research methods, literature and development review[J]. Concurrent Engineering, 2021, 29(2): 183-194.
[1] Fang ZONG,Yu-xuan LI,Hui-yong ZHANG,Fei GAO. Logistics distribution center allocation model along the Belt and Road [J]. Journal of Jilin University(Engineering and Technology Edition), 2022, 52(11): 2592-2599.
[2] GUO Hong-qiang, HE Hong-wen, LU Bing. Predictive model for cooperative braking system of electric vehicles [J]. 吉林大学学报(工学版), 2015, 45(3): 696-702.
[3] LI Bang-Guo, CHEN Xiao-Kai, LIN Yi. Reformed collaborative optimization method and its application [J]. 吉林大学学报(工学版), 2010, 40(06): 1497-1501.
Viewed
Full text


Abstract

Cited

  Shared   
  Discussed   
No Suggested Reading articles found!