.png){kind=icon}
Return
A Block-based genetic algorithm for disassembly sequence planning
.png){kind=icon}
PRE
AI
DOI：10.1016/j.eswa.2017.11.004.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Disassembly sequence planning refers to the study of the sequential order of disassembly based on the limit attributes of parts in the process of disassembly after the product design. The present study proposes a new block-based genetic algorithm for disassembly sequence planning based upon the comparison of Kongar and Gupta's genetic algorithm and Dijkstra's algorithms. It is expected that the disassembly sequence planning problem can be solved more efficiently. Four examples are used to test the algorithms developed in this study. Finally, it shown that the quality of the solution generates met the expected effect. (C) 2017 Elsevier Ltd. All rights reserved.
Keywords:
Disassembly sequence planning
Block-based genetic algorithms
Kongar and Gupta's genetic algorithms
Dijkstra's algorithms
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
7.5
Papers:
3.0W
Citations:
10.2W
Organization
Cited Papers
Reading disorders in a language with shallow orthography: A multiple single-case study in Italian.png)
Aphasiology
AphasiologyIF0
PREAI
ShareSaveShareSaveShareSaveShareSaveShareSave
View more