Modeling and Optimization of Parallel Disassembly Line Balancing Problem With Parallel Workstations

Liang, Wei; Zhang, Zeqiang; Zeng, Yanqing; Yin, Tao; Wu, Tengfei

doi:10.1109/tii.2023.3241583

Cited by 8 publications

(2 citation statements)

References 36 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The authors propose a tensorial memetic algorithm that is tested on real disassembly instances of a smartphone and washing machine. Liang et al [7] focus on the reasonable arrangement of disassembling equipment and establish a nonlinear model that minimizes the length of the line and the number of workstations. The authors present an enhanced evolution algorithm that performs better than four heuristic peers.…”

Section: Introductionmentioning

confidence: 99%

“…Constraint (5) implies that task i immediately precedes task j. Constraint (6) means that if task j is performed, the execution of the immediately preceding task i of task j must be ensured. Constraint (7) guarantees that the conflict relation of tasks must be satisfied. Constraint (8) indicates that the worker on the workstation needs to use the corresponding disassembly skill to perform the task.…”

mentioning

confidence: 99%

See 1 more Smart Citation

An Improved Discrete Bat Algorithm for Multi-Objective Partial Parallel Disassembly Line Balancing Problem

Zhang,

Xing,

Yao

et al. 2024

Mathematics

View full text Add to dashboard Cite

Product disassembly is an effective means of waste recycling and reutilization that has received much attention recently. In terms of disassembly efficiency, the number of disassembly skills possessed by workers plays a crucial role in improving disassembly efficiency. Therefore, in order to effectively and reasonably disassemble discarded products, this paper proposes a partial parallel disassembly line balancing problem (PP-DLBP) that takes into account the number of worker skills. In this paper, the disassembly tasks and the disassembly relationships between components are described using AND–OR graphs. In this paper, a multi-objective optimization model is established aiming to maximize the net profit of disassembly and minimize the number of skills for the workers. Based on the bat algorithm (BA), we propose an improved discrete bat algorithm (IDBA), which involves designing adaptive composite optimization operators to replace the original continuous formula expressions and applying them to solve the PP-DLBP. To demonstrate the advantages of IDBA, we compares it with NSGA-II, NSGA-III, SPEA-II, ESPEA, and MOEA/D. Experimental results show that IDBA outperforms the other five algorithms in real disassembly cases and exhibits high efficiency.

show abstract

Section: Introductionmentioning

confidence: 99%

mentioning

confidence: 99%