A Stochastic Sequence-Dependent Disassembly Line Balancing Problem with an Adaptive Large Neighbourhood Search Algorithm

The remanufacturing of end-of-life products is an effective approach to alleviating resource shortages, environmental pollution, and global warming. As the initial step in the remanufacturing process, the quality and efficiency of disassembly have a decisive impact on the entire workflow. However, the complexity of product structures poses numerous challenges to practical disassembly operations. These challenges include not only conventional precedence constraints among disassembly tasks but also sequential dependencies, where interference between tasks due to their execution order can prolong operation times and complicate the formulation of disassembly plans. Additionally, the inherent uncertainties in the disassembly process further affect the practical applicability of disassembly plans. Therefore, developing reliable disassembly plans must fully consider both sequential dependencies and uncertainties. To this end, this paper employs a chance-constrained programming model to characterise uncertain information and constructs a multi-objective sequence-dependent disassembly line balancing (MO-SDDLB) problem model under uncertain environments. The model aims to minimise the hazard index, workstation time variance, and energy consumption, achieving a multi-dimensional optimisation of the disassembly process. To efficiently solve this problem, this paper designs an innovative multi-objective adaptive large neighbourhood search (MO-ALNS) algorithm. The algorithm integrates three destruction and repair operators, combined with simulated annealing, roulette wheel selection, and local search strategies, significantly enhancing solution efficiency and quality. Practical disassembly experiments on a lithium-ion battery validate the effectiveness of the proposed model and algorithm. Moreover, the proposed MO-ALNS demonstrated a superior performance compared to other state-of-the-art methods. On average, against the best competitor results, MO-ALNS improved the number of Pareto solutions (NPS) by approximately 21%, reduced the inverted generational distance (IGD) by about 21%, and increased the hypervolume (HV) by nearly 8%. Furthermore, MO-ALNS exhibited a superior stability, providing a practical and feasible solution for disassembly optimisation.

Authors

Institutions

Publication Details

Journal
Processes
Published
2025-05-27
DOI
https://doi.org/10.3390/pr13061675
Primary Topic
Assembly Line Balancing Optimization
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

A Stochastic Sequence-Dependent Disassembly Line Balancing Problem with an Adaptive Large Neighbourhood Search Algorithm

X. Zhang, Zhu Dong, Changshu Zhan, Xinyue Huang et al.
Processes
Assembly Line Balancing Optimization
article

A Stochastic Sequence-Dependent Disassembly Line Balancing Problem with an Adaptive Large Neighbourhood Search Algorithm

X. Zhang, Zhu Dong, Changshu Zhan, Xinyue Huang, Duc Truong Pham
article en

Abstract

The remanufacturing of end-of-life products is an effective approach to alleviating resource shortages, environmental pollution, and global warming. As the initial step in the remanufacturing process, the quality and efficiency of disassembly have a decisive impact on the entire workflow. However, the complexity of product structures poses numerous challenges to practical disassembly operations. These challenges include not only conventional precedence constraints among disassembly tasks but also sequential dependencies, where interference between tasks due to their execution order can prolong operation times and complicate the formulation of disassembly plans. Additionally, the inherent uncertainties in the disassembly process further affect the practical applicability of disassembly plans. Therefore, developing reliable disassembly plans must fully consider both sequential dependencies and uncertainties. To this end, this paper employs a chance-constrained programming model to characterise uncertain information and constructs a multi-objective sequence-dependent disassembly line balancing (MO-SDDLB) problem model under uncertain environments. The model aims to minimise the hazard index, workstation time variance, and energy consumption, achieving a multi-dimensional optimisation of the disassembly process. To efficiently solve this problem, this paper designs an innovative multi-objective adaptive large neighbourhood search (MO-ALNS) algorithm. The algorithm integrates three destruction and repair operators, combined with simulated annealing, roulette wheel selection, and local search strategies, significantly enhancing solution efficiency and quality. Practical disassembly experiments on a lithium-ion battery validate the effectiveness of the proposed model and algorithm. Moreover, the proposed MO-ALNS demonstrated a superior performance compared to other state-of-the-art methods. On average, against the best competitor results, MO-ALNS improved the number of Pareto solutions (NPS) by approximately 21%, reduced the inverted generational distance (IGD) by about 21%, and increased the hypervolume (HV) by nearly 8%. Furthermore, MO-ALNS exhibited a superior stability, providing a practical and feasible solution for disassembly optimisation.

ProcessesVol. 13(6)
Northeast Forestry University (CN), University of Birmingham (GB)
Openalex Percentile: Top 84%
Assembly Line Balancing Optimization
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.