An Intelligent Product Disassembly Planning Method

Abstract

Disassembly sequence planning problem is a NP-hard combinatorial optimization problem. Generally, with the increasing of components number, the computational complexity of searching for good disassembly solution(s) in a large search space of disassembly solutions will be increased more. Therefore, to avoid the exploded combination, heuristic methods are often used for the goal of finding optimum solution(s) at a high efficiency. In the proposed research, we present the disassembly feasibility information graph (DFIG) to describe product's disassembly operations (sequences) information. In fact, this graph is a model of simulated all possible disassembly operations, and meanwhile, stored relevant information of operations which includes feasibility of operations and disassembly processes if these operations are feasible. Based on this graph, product's disassembly sequences planning problem could be transformed into this problem: On the DFIG, to find out a path with an optimized sum value, which starts from the start point, and could tour all the components of product just one time, along with the weighed, directed edges