关键词: 拆卸, 拆卸序列规划, 粒子群优化算法, 拆卸赋权混合图, 机用虎钳

Abstract: To obtain the optimum disassembly sequence for complicated products, a novel Disassembly Weighted Hybrid Graph (DWHG) model was established to describe the mating contact and noncontact priority relationships among components. Then, disassembly sequence planning problem was mapped into the DWHG as an optimal path-searching problem. And the disassembly condition was deduced based on DWHG model, and feasible disassembly sequences were inferred through geometry inference method. Aiming at characteristics of complex products disassembly sequence planning, in order to map the DWHG model into particle swarm model, particles velocity, position formula and evolution rules were defined, particle fitness was also established. The optimal disassembly sequence planning was realized by particle swarm algorithm. Finally, a case study was given to illustrate effectiveness of the proposed method.

Key words: disassembly, disassembly sequence planning, particle swarm optimization algorithm, disassembly weighted hybrid graph, machine vice