Bound-guided hybrid estimation of distribution algorithm for energy-efficient robotic assembly line balancing

被引:27
作者
Sun, Bin-qi [1 ]
Wang, Ling [1 ]
Peng, Zhi-ping [2 ]
机构
[1] Tsinghua Univ, Dept Automat, Beijing 100084, Peoples R China
[2] Guangdong Univ Petrochem Technol, Sch Comp, Maoming 525000, Peoples R China
基金
中国国家自然科学基金;
关键词
Estimation of distribution algorithm; Bound-guided sampling; Energy-efficient robotic assembly line balancing; Non-dominated robot allocation; EVOLUTIONARY ALGORITHM; GENETIC ALGORITHM; CYCLE TIME; CONSUMPTION; DECOMPOSITION; OPTIMIZATION;
D O I
10.1016/j.cie.2020.106604
中图分类号
TP39 [计算机的应用];
学科分类号
081203 ; 0835 ;
摘要
Under the pressure of climate change, energy-efficient manufacturing has attracted much attention. Robotic assembly lines are widely-used in automotive and electronic manufacturing. It is necessary to consider the energy saving and economic criteria simultaneously when robots are utilized to operate assembly tasks replacing human labor. This paper addresses an energy-efficient robotic assembly line balancing (EERALB) problem with the criteria to minimize both the cycle time and total energy consumption. We present a multi-objective mathematical model and propose a bound-guided hybrid estimation of distribution algorithm to solve the problem. When designing the optimization algorithm, we adopt estimation of distribution algorithm (EDA) to tackle the task assignment, and design a non-dominated robot allocation (NGRA) heuristic which is embedded into the EDA to allocate suitable robot to each workstation. Moreover, we propose a bound-guided sampling (BGS) method, which is able to reduce the search space of EDA and focus the search on the promising area. The computational complexity of the proposed algorithm is analyzed and the effectiveness of the proposed NGRA and BGS is tested. In addition, we compare the performances of the proposed mathematical model and the proposed algorithm with those of the existing model and algorithms on a set of widely-used benchmark instances. Comparative results demonstrate the effectiveness of the proposed model and algorithm.
引用
收藏
页数:13
相关论文
共 41 条
[1]  
[Anonymous], 2020, The Paris Agreement
[2]  
[Anonymous], 2008, THESIS
[3]  
Baluja S., 1994, POPULATION BASED INC
[4]   A survey on problems and methods in generalized assembly line balancing [J].
Becker, C ;
Scholl, A .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2006, 168 (03) :694-715
[5]   On solving the assembly line worker assignment and balancing problem via beam search [J].
Blum, Christian ;
Miralles, Cristobal .
COMPUTERS & OPERATIONS RESEARCH, 2011, 38 (01) :328-339
[6]   Exact and heuristic methods for solving the Robotic Assembly Line Balancing Problem [J].
Borba, Leonardo ;
Ritt, Marcus ;
Miralles, Cristobal .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2018, 270 (01) :146-156
[7]   A classification of assembly line balancing problems [J].
Boysen, Nils ;
Fliedner, Malte ;
Scholl, Armin .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2007, 183 (02) :674-693
[8]   Design of flexible assembly line to minimize equipment cost [J].
Bukchin, Joseph ;
Tzur, Michal .
IIE Transactions (Institute of Industrial Engineers), 2000, 32 (07) :585-598
[9]   A collaborative optimization algorithm for energy-efficient multi-objective distributed no-idle flow-shop scheduling [J].
Chen, Jing-fang ;
Wang, Ling ;
Peng, Zhi-ping .
SWARM AND EVOLUTIONARY COMPUTATION, 2019, 50
[10]  
Coello C, 2007, EVOLUTIONARY ALGORIT, Vsecond