Disassembly sequencing is a concurrent research subject in design for life-cycle. Many past and recent researches are made to give practical methods for disassembly sequencing. The problem of assembly information’s modeling is one of the important sub-problems of disassembly simulation. The problem includes connection determination, disassembly direction identification, and part mobility state definition. In the present paper, the authors propose a new representation model of disassembly directions, starting from geometric and assembly data of computer aid design models. This model is based on a mobility matrix definition for every part. This matrix is also called disassembly direction matrix. The model gives information about the mobility state of a part during disassembly sequencing by updating its mobility matrix. Mobility state data are used in a practical computing of disassembly sequence feasibility. In this paper, theoretical explication of this modeling is given and validated by computational results. In the validation section, the model is applied to a computer aid design mechanism using a selective disassembly.
ZhuBSarigeciliMRoyU. Disassembly information model incorporating dynamic capabilities for disassembly sequence generation. Robot Comput-Integr Manuf2013; 29: 396–409.
2.
IssaouiLAifaouiNBenamaraA. Solution space reduction of disassembly sequences generated automatically via computer aids. Proc IMechE, Part C: J Mechanical Engineering Science2015; 229: 2977–2986.
3.
LiaJRKhoobLPTorbSB. Generation of possible multiple components disassembly sequence for maintenance using a disassembly constraint graph. Int J Product Econ2006; 102: 51–65.
4.
LambertAJD. Exact methods in optimum disassembly sequence search for problems subject to sequence dependent costs. Omega2006; 34: 538–549.
5.
ChenW-CDengW-JTaiP-Het al.A three-stage integrated approach for assembly sequence planning using neural networks. Exp Syst Appl2008; 34: 1777–1786.
6.
OuL-MXuX. Relationship matrix based automatic assembly sequence generation from a CAD model. J Comput-Aid Design2013; 45: 1053–1067.
7.
WegenerWAndrewSRaatzAet al.Disassembly of electric vehicle batteries using the example of the Audi Q5 hybrid system. Proc CIRP2014; 23: 155–160.
8.
MooreKEGungorAGuptaSM. Petri net approach to disassembly process planning for products with complex AND/OR precedence relations. Eur J Oper Res2001; 135: 428–449.
9.
YoonCJ. Assembly simulations in virtual environments with optimized haptic path and sequence. Robot Comput-Integr Manuf2011; 27: 306–317.
10.
SmithSSmithGChenW-H. Disassembly sequence structure graphs: an optimal approach for multiple-target selective disassembly sequence planning. Adv Eng Inform2012; 26: 306–316.
11.
ChungCPengQ. An integrated approach to selective-disassembly sequence planning. Robot Comput-Integr Manuf2005; 21: 475–485.
KuoTCZhangHCHuangSH. Disassembly analysis for electromechanical products: a graph-based heuristic approach. Int J Prod Res2000; 38: 993–993.
14.
Mascle C, Dupinet E and Maranzana R. Feature modeling in assembly planning. Presented at Congrès de l’IFIP, modélisation et reconnaissance de caractéristiques en CFAO, Valanciennes, France, May 1994.
15.
LaperrièreLEl MaraghyHA. GAPP: a generative assembly process planner. J Manuf Syst1996; 15: 282–293.
16.
DiniGSantocchiM. Automated sequencing and subassembly detection in assembly planning. Ann CIRP1992; 41: 1–1.
17.
SmithSSChenW-H. Rule-based recursive selective disassembly sequence planning for green design. Adv Eng Inform2011; 25: 77–87.
18.
XiaKGaoLLiWet al.Disassembly sequence planning using a simplified teaching–learning-based optimization algorithm. Adv Eng Inform2014; 28: 518–527.
19.
DongTTongRZhangLet al.A collaborative approach to assembly sequence planning. Adv Eng Inform2005; 19: 155–168.
20.
GungorAGuptaSM. An evaluation methodology for disassembly processes. Comput Ind Eng1997; 33: 329–332.
21.
DiniGFaillilFMarcelloniLF. Generation of optimized assembly sequences using genetic algorithms. Ann CIRP1999; 48: 1–1.
22.
McGovernSMGuptaSM. A balancing method and genetic algorithm for disassembly line balancing. Eur J Oper Res2007; 179: 692–708.
23.
YehW-C. Simplified swarm optimization in disassembly sequencing problems with learning effects. Comput Oper Res2012; 39: 2168–2177.
TianGZhouMChuJ. A chance constrained programming approach to determine the optimal disassembly sequence. IEEE Trans Automat Sci Eng2013; 10: 4–4.
26.
GuptaSMImtanavanichP. Evolutionary computational approach for disassembly sequencing in a multiproduct environment. Biomed Soft Comput Human Sci2009; 15: 73–78.
27.
WangHRongYXiangD. Mechanical assembly planning using ant colony optimization. J Comput-Aid Design2014; 47: 59–71.
28.
WangHDongXDuanG. A genetic algorithm for product disassembly sequence planning. Neurocomputing2008; 71: 13–15.
29.
McGovernSMGuptaSM. Ant colony optimization for disassembly sequencing with multiple objectives. Int J Adv Manuf Technol2006; 30: 481–496.
30.
DingZHonB. Constraints analysis and evaluation of manual assembly. CIRP Ann Manuf Technol2013; 62: 1–4.
31.
WangHSCheZHChiangCJ. A hybrid genetic algorithm for multi-objective product plan selection problem with ASP and ALB. Expert Syst Appl2012; 39: 5440–5450.
32.
ZhangHLiuHLiL. Research on a kind of assembly sequence planning based on immune algorithm and particle swarm optimization algorithm. Int J Adv Manuf Technol2014; 71: 795–808.
SiddiqueZRosenD. A virtual prototyping approach to product disassembly reasoning. J Comput-Aid Design1997; 29: 847–860.
35.
WilsonRHLatombeJ-C. Geometric reasoning about mechanical assembly. Artif Intell1994; 71: 371–396.
36.
Latombe J-C and Wilson R. Assembly sequencing with tolerance parts. ASM, Proceeding SMA '95 Proceedings of the third ACM symposium on Solid modeling and applications. DOI: 10.1145/218013.218037.
37.
Mattikali RS and Khosla PK. Proceedings Issues in Design Manufacture/Integration., Winter annual meeting of ASME', Vol. 39. Atlanta, Georgia, USA, December 1991, pp. 65–71.
38.
PomaresJPuenteSTTorresFet al.Virtual disassembly of products based on geometric models. J Comput Ind2004; 55: 1–14.
39.
ShyamsundarNGadhR. Geometric abstractions to support disassembly analysis. IIE Trans1999; 31: 935–946.
40.
MoJZhangQGadhR. Virtual disassembly. Int J CAD/CAM2002; 2: 29–37.
41.
CappelliFDeloguMPieriniMet al.Design for disassembly: a methodology for identifying the optimal disassembly sequence. J Eng Design2007; 18: 563–575.
42.
RomneyRGodardCGoldwasserMet al.An efficient system for geometric assembly sequence generation and evaluation. Proc ASME Int Comput Eng1995, pp. 699–712.
43.
DongTZhangLTongRet al.A hierarchical approach to disassembly sequence planning for mechanical product. Int J Adv Manuf Technol2006; 30: 507–520.
44.
WangCGMitrouchevPLiGQet al.Disassembly operations’ efficiency evaluation in a virtual environment. Int J Comput Integr Manuf2016; 29: 309–322.
45.
MitrouchevPWangCGLuLXet al.Selective disassembly sequence generation based on lowest level disassembly graph method. Int J Adv Manuf Technol2015; 80: 141–159.
46.
SuaQLaiS-JJunLB. Geometric computation based assembly sequencing and evaluating in terms of assembly angle, direction, reorientation, and stability. J Comput-Aided Design2009; 41: 479–489.
47.
SuQ. Computer aided geometric feasible assembly sequence planning and optimizing. Int J Adv Manuf Technol2007; 33: 48–57.
48.
Rejneri N. Determination and simulation of assembly simulation during mechanical product design. PhD thesis, National Polytechnic Institute of Grenoble, 2000.
49.
IacobRMitrouchevPLéonJ-C. Assembly simulation incorporating component mobility modeling based on functional surfaces. Int J Interact Design Manuf2011; 5: 119–132.
50.
PopescuDIacobR. Disassembly method based on connection interface and mobility operator concepts. Int J Adv Manuf Technol2013; 69: 1511–1525.
51.
SuQLaiS-JLiuJ. Geometric computation based assembly sequencing and evaluating in terms of assembly angle, direction, reorientation, and stability. J Comput-Aided Design2009; 41: 479–489.
52.
GhandiSMasehianE. Review and taxonomies of assembly and disassembly path planning problems and approaches. J Comput-Aided Design2015; 67–68: 58–86.
