4.6 Article

Product cooperative disassembly sequence planning based on branch-and-bound algorithm

期刊

出版社

SPRINGER LONDON LTD
DOI: 10.1007/s00170-010-2682-7

关键词

Cooperative disassembly; Disassembly sequence planning (DSP); Disassembly hybrid graph model (DHGM)

资金

  1. National Key Technology R &D Program, China [2007BA F13B02]
  2. Natural Science Foundation of Zhejiang Province, China [Z107416]
  3. National Natural Science Foundation of China [50775201]
  4. PhD Programs Foundation of Ministry of Education of China [200803350031]

向作者/读者索取更多资源

This paper focuses on the cooperative disassembly sequence planning (CDSP) problem which is essential to disassembly a large and complex product in practice. A disassembly hybrid graph model (DHGM) is constructed to describe the mating contact and noncontact priority relationships among constituting product components. Thus, the disassemblability constraint expression can be deduced from it by reasoning. The CDSP is different from the disassembly sequence planning except for they are NP-complete. Therefore, a novel method is presented to generate cooperative disassembly hierarchical tree (CDHT) from the DHGM based on branch-and-bound algorithm in which two user-defined variables are introduced to control the size of the CDHT .The optimal solutions with a minimal disassembly time are derived according to the objection function. Finally, an example illustrates the proposed method.

作者

我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。

评论

主要评分

4.6
评分不足

次要评分

新颖性
-
重要性
-
科学严谨性
-
评价这篇论文

推荐

暂无数据
暂无数据