To develop a simulation tool for automatic disassembly in computer aid design (CAD) environment two difficulties are found: the huge space of generated sequences and their feasibility especially in combinatory generation. This article deals with automatic sequence generation for selective disassembly of mechanical product. Starting from a CAD model a new appropriate connection tree of a target component is constructed. This tree aims at reducing space solution by eliminatory rules. The generation of sequence is based on reading of connection tree branches and eliminatory tests of feasibility. The feasibility is checked by updating the disassembly mobility of each sequence’s element. A case study is presented to prove the effectiveness of the proposed approach.
WangLKeshavarzmaneshSFengH-Y. Assembly process planning and its future in collaborative manufacturing: A review. Int J Adv Manuf Technol2009; 41: 132–144.
3.
Demoly F. Integrated design and management of technical data: application in product engineering and its assembly sequence. PhD thesis, Doctoral school of engineering science and Microtechnics SPIM-France (Ecole doctorale Sciences Pour l'Ingénieur et Microtechniques – SPIM-France), 2010.
4.
MooreKEGungorAGuptaSM. Petri net approach for disassembly process planning for products with complex AND/OR precedence relationships. Eur J Oper Res2001; 135: 428–449.
5.
WangHXiangDDuanG. A genetic algorithm for product disassembly sequence planning. Neurocomputing2008; 71: 2720–2726.
6.
WangHRongaYXiangD. Mechanical assembly planning using ant colony optimization. Comput-Aid Des2014; 47: 50–71.
7.
MooreKEGungorAGuptaSM. A petri net approach to disassembly process planning. J Comput Ind Eng1998; 35(1–2): 165–165.
8.
Cittolin A. Study of universal filters for automatic determination and selection of assembly lines of industrial products. PhD thesis, Ecole Polytechnique Fédérale de Lausanne, Switzerland, 1997.
9.
De FazioTLWhitneyDE. Simplified generation of all mechanical assembly sequences. IEEE J Robot Autom1987; 3(6): 640–658.
10.
Bourjault A. Contribution of a methodological approach to automated assembly: Development of automatic operating sequences. State thesis of Franche-Comté, 1984.
11.
Rejneri N. Determination and simulation of assembly operations during the design of mechanical systems. PhD thesis, National polytechnic institute of Grenoble-France (institut national polytechnique de Grenoble-france), 2000.
12.
AvikalSJainRMishraPK. A heuristic for U-shaped disassembly line balancing problems. MIT Int J Mech Eng2013; 13: 51–56.
13.
Zhang HC and Kuo TC. A graph-based approach to disassembly model for end-of-life product recycling. In: Proceedings of 19th IEEE/CPMT symposium on international electronics manufacturing technology, Austin, TX, USA, October 1996, pp.247–254.
14.
DuttaDWooTC. Algorithm for multiple disassembly and parallel assemblies. J Eng Ind1995; 17: 102–109.
15.
Srinivasan H and Gadh R. Selective disassembly: Representation and comparative analysis of wave propagation abstractions in sequence planning. In: Proceedings of IEEE international symposium on assembly and task planning, Portugal, 1999, pp.129–134.
16.
Homem de MelloLSSandersonAC. A correct and complete algorithm for the generation of mechanical assembly sequences. IEEE Trans Robot Autom1991; 7(2): 228–240.
17.
CaoTHSandersonAC. AND/OR net representation for robotic task sequence planning. IEEE Trans Syst Man Cybernet Appl Rev1998; 28(2): 204–218.
18.
Suzuki T, Kanehara T, Inaba A, et al. On algebraic and graph structural properties of assembly petri net. In: Proceedings of IEEE international conference on robotics & automation, Atlanta, GA, USA, 1993, pp.507–514.
19.
ZussmanEZhouMC. Design and implementation of an adaptive process planner for disassembly processes. IEEE Trans Robot Autom2000; 16(2): 171–179.
20.
CapelliFDeloguMPieriniM. Design for disassembly: A methodology for identifying the optimal disassembly sequence. J Eng Des2007; 18(6): 563–575.
21.
KuoTCZhangHCHuangSH. Disassembly analysis for electromechanical products: A graph-based heuristic approach. Int J Product Res2000; 38(5): 993–1000.
22.
LiaJRKhoobLPTorbSB. Generation of possible multiple components disassembly sequence for maintenance using a disassembly constraint graph. Int J Product Econom2006; 102: 51–65.
23.
McGovernSMGuptaSM. Combinatorial optimization analysis of the unary NP complete disassembly line balancing problem. Int J Product Res2007; 45(18–19): 4485–4511.
24.
AvikalSMishraPKJainR. An AHP and PROMETHEE methods-based environment friendly heuristic for disassembly line balancing problems. Interdisc Environ Rev2013; 14: 69–85.
25.
RickliJLCamelioJA. Multi-objective partial disassembly optimization based on sequence feasibility. J Manuf Syst2013; 32: 281–293.
26.
GoTFWahabDARahman MNAb. Disassemblability of end-of-life vehicle: A critical review of evaluation methods. J Clean Product2011; 19: 1536–1546.
27.
WangJ-fLiuJ-hLiS-q. Intelligent selective disassembly using the ant colony algorithm. Artif Intell Eng Des Anal Manuf2003; 17(4): 325–333.
28.
YehW-C. Simplified swarm optimization in disassembly sequencing problems with learning effects. Comput Oper Res2012; 39: 2168–2177.
29.
KongarEGuptaSM. Disassembly sequencing using genetic algorithm. Int J Adv Manuf Technol2006; 30(5–6): 497–506.
30.
McGovernSMGuptaSM. A balancing method and genetic algorithm for disassembly line balancing. Eur J Oper Res2007; 179: 692–708.
31.
KalayciCBGuptaSM. A particle swarm optimization algorithm with neighborhood-based mutation for sequence-dependent disassembly line balancing problem. Int J Adv Manuf Technol2013; 69: 197–209.
32.
KalayciCBGuptaSM. Artificial bee colony algorithm for solving sequence-dependent disassembly line balancing problem. Exp Syst Appl2013; 40: 7231–7241.
33.
McGovernSMGuptaSM. Ant colony optimization for disassembly sequencing with multiple objectives. Int J Adv Manuf Technol2006; 30: 481–496.
34.
AvikalSMishraaPKJainR. A fuzzy AHP and PROMETHEE method-based heuristic for disassembly line balancing problems. Int J Product Res2014; 52: 1306–1317.
35.
LuCLiuY-C. A disassembly sequence planning approach with an advanced immune algorithm. Proc IMechE, Part C: J Mechanical Engineering Science2014; 226(11): 2739–2749.
36.
GungorAGuptaSM. An evaluation methodology for disassembly process. J Comput Ind Eng1997; 33: 329–332.
37.
DiniGFailliFLazzeriniB. Generation of optimized assembly sequences using genetic algorithms. Ann CIRP1999; 48: 17–20.
