Product cooperative disassembly sequence planning based on branch-and-bound algorithm
Source: The International Journal of Advanced Manufacturing Technology, Volume 51, Numbers 9-12, December 2010 , pp. 1139-1147(9)
Abstract: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.
Document Type: Research Article
Affiliations: 1: State Key Laboratory of Fluid Power Transmission and Control, Zhejiang University, Room No. 408 of the First Teaching Building, Hangzhou, People’s Republic of China, 310027 2: State Key Laboratory of Fluid Power Transmission and Control, Zhejiang University, Room No. 408 of the First Teaching Building, Hangzhou, People’s Republic of China, 310027, Email: firstname.lastname@example.org
Publication date: December 2010