Academic Journal
A Block-based genetic algorithm for disassembly sequence planning.
| Τίτλος: | A Block-based genetic algorithm for disassembly sequence planning. |
|---|---|
| Συγγραφείς: | Tseng, Hwai-En1 hwai_en@seed.net.tw, Chang, Chien-Cheng2 changcc@nuu.edu.tw, Lee, Shih-Chen3 d821104@ocu.edu.tw, Huang, Yu-Ming1 s3a315103@student.ncut.edu.tw |
| Πηγή: | Expert Systems with Applications. Apr2018, Vol. 96, p492-505. 14p. |
| Θεματικοί όροι: | *Genetic algorithms, *Disassemblers (Computer programs), *Product design, *Matrices (Mathematics), *Mathematical sequences |
| Περίληψη: | 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. [ABSTRACT FROM AUTHOR] |
| Βάση Δεδομένων: | Academic Search Index |
καταχωρήστε σχόλιο πρώτοι!