.png){kind=icon}
.png){kind=icon}
Return
Evolutionary optimization using epsilon method for resource-constrained multi-robotic disassembly line balancing
.png){kind=icon}
PRE
AI
DOI：10.1016/j.jmsy.2020.06.006.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
This paper concentrates on a resource-constrained multi-robotic disassembly line balancing (RC-MDLB) problem. In this RC-MDLB problem, different types of end-of-life products are disassembled simultaneously on the same line under the following conditions: allocating multiple robots to a workstation to simultaneously process the disassembly tasks that have no precedence relationship with each other, each robot needs a fixed number of limited resources to process tasks, and the total resources for each workstation is fixed. A mathematical model is presented for the RC-MDLB problem to minimize the cycle time and the number of robots being occupied simultaneously. A constrained multi-objective evolutionary algorithm framework and a constrained NSGA-II (E-NSGA-II) algorithm with epsilon method are proposed to handle the constraints of the RC-MDLB problem. The proposed E-NSGA-II is applied to a set of RC-MDLB problem instances introduced in this paper and compared with five representative multi-objective evolutionary algorithms. The experimental results reveal that the proposed E-NSGA-II presents outstanding performance on most of the cases analyzed.
Keywords:
Robotic disassembly line balancing
Multi-objective optimization
Evolutionary algorithm
Resource constraints
Constraint handling
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
14.2
Papers:
2.7K
Citations:
1.6W