Research on the Disassembly Sequence Planning for Mechanical Product

Article Preview

Abstract:

Mechanical products have been inevitably disassembled when they are regarded to be recycled or repaired. The disassembling procedure must be decided no matter what way is used to disassemble. The key is to decide the disassembly sequence for parts/components. In order to generate the disassembly sequence rapidly and correctly, similar thread binary tree and graph algorithm are used to establish the model of disassembly after analyzing the characteristics of Mechanical products. Firstly, generate the related matrix obtained from the 3D CAD assembly model; secondly, transform the undirected graph to the directed graph based on the practical constraints between parts/components; finally, search the restrictions among the directed graph and generate the efficient disassembly sequence. A prototype system of disassembly sequence planning based on UG was implemented which has the functions such as parts and assembly information extraction, definition constraints between components, disassembly sequence planning and etc. The centrifugal lubricating oil filter case study proves the validity and feasibility of the proposed method.

You might also be interested in these eBooks

Info:

Periodical:

Pages:

1300-1304

Citation:

Online since:

July 2011

Export:

Price:

Permissions CCC:

Permissions PLS:

Сopyright:

© 2011 Trans Tech Publications Ltd. All Rights Reserved

Share:

Citation:

[1] Zhang Ling, Wang Zhengxiao, et al. Generation and Evaluation of Disassembly Sequences in Green Design[J]. Transactions of the Chinese Society for Agricultural Machinery, 2010, 41(11): 199-204.

Google Scholar

[2] Li Shiting, Zhu Bo, et al. Research on Petri Net Disassembly Process Model Based on Constraint Relationship of Parts for Mechanical Equipment[J]. China Mechanical Engineering, 2008, 19(19): 2032-(2035).

Google Scholar

[3] ZHANG Xiufen, ZHANG Shuyou, et al. Object Selective Disassembly Sequence Planning for Complex Mechanical Products[J]. Journal of Mechanical Engineering, 2010, 46(11): 172-178.

DOI: 10.3901/jme.2010.11.172

Google Scholar

[4] MENGXian-gang, YAN Hong-sen. Disassembly of simple electromechanical products based on fuzzy number Petri nets[J]. Computer Integrated Manufacturing Systems, 2010, 16(4): 717-722.

Google Scholar

[5] MOORE K E, GUNGOR A, GUPTA S M. Petri net approach to disassembly process planning for products with complex AND/OR precedence relationships[J]. European Journal of Operational Research, 2001, 135(2): 428-449.

DOI: 10.1016/s0377-2217(00)00321-0

Google Scholar

[6] LI J R, LI P K, TOR S B. An object-oriented intelligent disassembly sequence planner for maintenance[J]. Computers in Industry, 2005, 56(7): 699-718.

DOI: 10.1016/j.compind.2005.03.005

Google Scholar

[7] WANG Hui, XIANG Dong, DUAN Guanghong. Agenetic algorithm for product disassembly sequence planning[J]. Neurocomputing, 2008, 71(13-15): 2720-2726.

DOI: 10.1016/j.neucom.2007.11.042

Google Scholar

[8] LAMBERT A J D. Optimizing disassembly processes subjected to sequence-dependent cost[J]. Computers & Operations Research, 2007, 24(2): 536-551.

DOI: 10.1016/j.cor.2005.03.012

Google Scholar

[9] HU Shu-jie, YUHong-jie. Improvem ent on Threaded Binary-Tree Algorithm[J]. Transactions of Shenyang Ligong University, 2008, 27(6): 18-20.

Google Scholar

[10] Zhao Shu-en. Research and Realize on the Disassembly Sequence Generated Automatically of Automobile Components and Parts[D]. Chongqing: The Thesis for Master Degree of Chongqing University, (2005).

Google Scholar