.png){kind=icon}
返回
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}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
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.
Keyword:
Disassembly sequence planning
Block-based genetic algorithms
Kongar and Gupta's genetic algorithms
Dijkstra's algorithms
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
7.5
论文数:
3.0W
被引数:
10.2W
机构
引用论文
Reading disorders in a language with shallow orthography: A multiple single-case study in Italian浅拼字法语言的阅读障碍: 意大利语的多个单例研究.png)
Aphasiology
AphasiologyIF0
PREAI
分享收藏Multi-objective partial disassembly optimization based on sequence feasibility基于序列可行性的多目标局部拆卸优化
PREAI
分享收藏分享收藏Environmentally conscious manufacturing and product recovery (ECMPRO): A review of the state of the art环保意识的制造和产品回收 (ECMPRO): 对最新技术的回顾
PREAI
分享收藏
查看更多内容