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

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.

[1]  Arthur C. Sanderson,et al.  AND/OR graph representation of assembly plans , 1986, IEEE Trans. Robotics Autom..

[2]  Günther Seliger,et al.  Emulation-based control of a disassembly system for LCD monitors , 2009 .

[3]  T. C. Kuo,et al.  A graph-based disassembly sequence planning for EOL product recycling , 1997, Twenty First IEEE/CPMT International Electronics Manufacturing Technology Symposium Proceedings 1997 IEMT Symposium.

[4]  Surendra M. Gupta,et al.  Petri net approach to disassembly process planning for products with complex AND/OR precedence relationships , 2001, Eur. J. Oper. Res..

[5]  H. Kaebernick,et al.  A Method for Sequencing the Disassembly of Products , 2000 .

[6]  Fernando Torres,et al.  TASK PLANNER FOR A COOPERATIVE DISASSEMBLY ROBOTIC SYSTEM , 2006 .

[7]  Shiang-Fong Chen,et al.  Parallel Disassembly by Onion Peeling , 1997 .

[8]  Dong-Ho Lee,et al.  Parallel disassembly sequencing with sequence-dependent operation times , 2001 .

[9]  Surendra M. Gupta,et al.  Disassembly sequence plan generation using a branch-and-bound algorithm , 2001 .

[10]  S. Tor,et al.  A Novel Representation Scheme for Disassembly Sequence Planning , 2002 .

[11]  Belarmino Adenso-Díaz,et al.  A scatter search approach to the optimum disassembly sequence problem , 2006, Comput. Oper. Res..

[12]  Liang Gao,et al.  Optimization of flexible process planning by genetic programming , 2008 .

[13]  Alfred J.D. Lambert,et al.  Methods for optimum and near optimum disassembly sequencing , 2008 .

[14]  Surendra M. Gupta,et al.  Ant colony optimization for disassembly sequencing with multiple objectives , 2006 .

[15]  S. Q. Li,et al.  Intelligent selective disassembly using the ant colony algorithm , 2003, Artificial Intelligence for Engineering Design, Analysis and Manufacturing.

[16]  Rafael Aracil,et al.  Disassembly Planning Based on Precedence Relations among Assemblies , 2003 .

[17]  Manoj Kumar Tiwari,et al.  Real world disassembly modeling and sequencing problem: Optimization by Algorithm of Self-Guided Ants (ASGA) , 2009 .

[18]  Surendra M. Gupta,et al.  Disassembly sequencing using genetic algorithm , 2006 .

[19]  T. C. Woo,et al.  Algorithm for multiple disassembly and parallel assemblies , 1995 .

[20]  D. Dutta,et al.  Automatic Disassembly and Total Ordering in Three Dimensions , 1991 .