2023
DOI: 10.1108/ria-06-2022-0156
|View full text |Cite
|
Sign up to set email alerts
|

Selective disassembly sequence optimization based on the improved immune algorithm

Abstract: Purpose The purpose of this paper is to improve the automation of selective disassembly sequence planning (SDSP) and generate the optimal or near-optimal disassembly sequences. Design/methodology/approach The disassembly constraints is automatically extracted from the computer-aided design (CAD) model of products and represented as disassembly constraint matrices for DSP. A new disassembly planning model is built for computing the optimal disassembly sequences. The immune algorithm (IA) is improved for findi… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
5
0

Year Published

2023
2023
2024
2024

Publication Types

Select...
5
2

Relationship

0
7

Authors

Journals

citations
Cited by 7 publications
(5 citation statements)
references
References 32 publications
0
5
0
Order By: Relevance
“…Then, the feasible solutions of the problem to be optimized are binary coded as antibodies, and an initial antibody population is randomly generated. The binary programming method can ensure the stability of the algorithm and the diversity of the population [29]. The affinity calculation of immune algorithm is shown in equation (7), where vw opt means the binding degree between antibody v and antigen w .…”
Section: B Design Of Ia-fdc Algorithm Optimizationmentioning
confidence: 99%
“…Then, the feasible solutions of the problem to be optimized are binary coded as antibodies, and an initial antibody population is randomly generated. The binary programming method can ensure the stability of the algorithm and the diversity of the population [29]. The affinity calculation of immune algorithm is shown in equation (7), where vw opt means the binding degree between antibody v and antigen w .…”
Section: B Design Of Ia-fdc Algorithm Optimizationmentioning
confidence: 99%
“…Their optimization objectives include total disassembly time, disassembly direction change frequency, and disassembly tool change frequency, offering new directions for multi-objective optimization of DSP problems [19]. Ji et al [20] enhanced the immune optimization algorithm, providing new tools for rapidly finding optimal or near-optimal disassembly sequences to solve DSP problems, which are essential for accelerating the DSP process and improving production efficiency, providing strong support for the manufacturing industry [20].…”
Section: Research On Dspmentioning
confidence: 99%
“…Case study A: undominated solution set. ,3, 1,16,4,20,19,5,7,10,12,18,6,17,21,14,11,9,8, 15 562.9, 586.9, 611.9 115 17 7 13, 1, 16, 2, 3, 4, 19, 20, 10, 5, 7, 12, 18, 6, 17, 21, 14, 15, 11, 9, 8 565.2, 589.4, 614.7 114 18 8 13, 1, 16, 2, 3, 4, 5, 7, 19, 20, 10, 6, 12, 18, 17, 21, 14, 11, 9, 8, 15 566.4, 590.7, 616.2 111 19 9 13, 1, 2, 16, 3, 4, 5, 7, 10, 20, 6, 12, 18, 17, 21, 14, 15, 11, 9, 8, 19 569.9, 594.5, 620.5 107 21 10 13, 19, 1, 16, 2, 3, 4, 10, 5, 7, 12, 17, 18, 21, 14, 15, 11, 9, 8, 6, 20 573.3, 598.2, 624.6 105 22…”
mentioning
confidence: 99%
“…Chen et al proposed an optimization algorithm based on Q-learning to optimize the DSP problem of discarded smartphones [24]. Ji et al improved the immune algorithm to find the optimal or near-optimal disassembly sequence [25]. Kheder et al customized and enhanced the genetic algorithm, considering variations in component volume, tool change, and disassembly direction in their research [26].…”
Section: Literature Reviewmentioning
confidence: 99%