Load Balancing of Two-Sided Assembly Line Based on Deep Reinforcement Learning

被引:1
作者
Jia, Guangpeng [1 ]
Zhang, Yahui [2 ]
Shen, Shuqi [1 ]
Liu, Bozu [1 ]
Hu, Xiaofeng [3 ]
Wu, Chuanxun [2 ]
机构
[1] China Natl Heavy Duty Truck Grp Co Ltd, Proc Res Inst, Jinan 250100, Peoples R China
[2] Shanghai Jiao Tong Univ, Inst Marine Equipment, 5G Intelligent Mfg Res Ctr, Shanghai 200240, Peoples R China
[3] Shanghai Jiao Tong Univ, Inst Intelligent Mfg & Informat Engn, Sch Mech Engn, Shanghai 200240, Peoples R China
来源
APPLIED SCIENCES-BASEL | 2023年 / 13卷 / 13期
关键词
two-sided assembly line; load balancing; deep reinforcement learning; distributed multiple processes; GENETIC ALGORITHM; SEARCH; MODEL;
D O I
10.3390/app13137439
中图分类号
O6 [化学];
学科分类号
0703 ;
摘要
In the complex and ever-changing manufacturing environment, maintaining the long-term steady and efficient work of the assembly line is the ultimate goal pursued by relevant enterprises, the foundation of which is a balanced load. Therefore, this paper carries out research on the two-sided assembly line balance problem (TALBP) for load balancing. At first, a mathematical programming model is established with the objectives of optimizing the line efficiency, smoothness index, and completion time smoothness index of the two-sided assembly line (TAL). Secondly, a deep reinforcement learning algorithm combining distributed proximal policy optimization (DPPO) and the convolutional neural network (CNN) is proposed. Based on the distributed reinforcement learning agent structure assisted by the marker layer, the task assignment states of the two-sided assembly and decisions of selecting tasks are defined. Task assignment logic and reward function are designed according to the optimization objectives to guide task selection and assignment. Finally, the performance of the proposed algorithm is verified on the benchmark problem.
引用
收藏
页数:24
相关论文
共 50 条
[31]   Workload smoothing in two-sided assembly lines [J].
Hu, Xiaofeng ;
Wu, Chunaxun .
ASSEMBLY AUTOMATION, 2018, 38 (01) :51-56
[32]   Improved moth flame optimization algorithm to optimize cost-oriented two-sided assembly line balancing [J].
Ab Rashid, Mohd Fadzil Faisae ;
Rose, Ahmad Nasser Mohd ;
Mohamed, Nik Mohd Zuki Nik ;
Romlay, Fadhlur Rahman Mohd .
ENGINEERING COMPUTATIONS, 2020, 37 (02) :638-663
[33]   AN IMPROVED GENETIC SIMULATED ANNEALING ALGORITHM FOR STOCHASTIC TWO-SIDED ASSEMBLY LINE BALANCING PROBLEM [J].
Yang, M. S. ;
Ba, L. ;
Liu, Y. ;
Zheng, H. Y. ;
Yan, J. T. ;
Gao, X. Q. ;
Xiao, J. M. .
INTERNATIONAL JOURNAL OF SIMULATION MODELLING, 2019, 18 (01) :175-186
[34]   An improved ant colony optimization for two-sided assembly line balancing problem [J].
Zheng, Q.-X. (zqxlm1978@163.com), 1600, Chinese Institute of Electronics (42) :841-845
[35]   Maximizing production rate and workload balancing in a two-sided assembly line using Harmony Search [J].
Purnomo, Hindriyanto Dwi ;
Wee, Hui-Ming .
COMPUTERS & INDUSTRIAL ENGINEERING, 2014, 76 :222-230
[36]   A multi-objective TLBO algorithm for balancing two-sided assembly line with multiple constraints [J].
Li, Dashuang ;
Zhang, Chaoyong ;
Shao, Xinyu ;
Lin, Wenwen .
JOURNAL OF INTELLIGENT MANUFACTURING, 2016, 27 (04) :725-739
[37]   An effective artificial fish swarm optimization algorithm for two-sided assembly line balancing problems [J].
Zhong, Yuguang ;
Deng, Zexiao ;
Xu, Ke .
COMPUTERS & INDUSTRIAL ENGINEERING, 2019, 138
[38]   Stochastic two-sided U-type assembly line balancing: a genetic algorithm approach [J].
Delice, Yilmaz ;
Aydogan, Emel Kizilkaya ;
Ozcan, Ugur .
INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, 2016, 54 (11) :3429-3451
[39]   Artificial bee colony algorithms for two-sided assembly line worker assignment and balancing problem [J].
Janardhanan, Mukund Nilakantan ;
Li, Zixiang ;
Nielsen, Peter ;
Tang, Qiuhua .
DISTRIBUTED COMPUTING AND ARTIFICIAL INTELLIGENCE, 2018, 620 :11-18
[40]   One- and two-sided assembly line balancing problems with real-world constraints [J].
Gansterer, Margaretha ;
Hartl, Richard F. .
INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, 2018, 56 (08) :3025-3042