期刊
EXPERT SYSTEMS WITH APPLICATIONS
卷 96, 期 -, 页码 492-505出版社
PERGAMON-ELSEVIER SCIENCE LTD
DOI: 10.1016/j.eswa.2017.11.004
关键词
Disassembly sequence planning; Block-based genetic algorithms; Kongar and Gupta's genetic algorithms; Dijkstra's algorithms
类别
资金
- Ministry of Science and Technology of the Republic of China [MOST 105-2410-H-167-007]
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.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据