TY - JOUR
T1 - Automatic derivation of transition matrix for end-of-life decision making
AU - Kang, Chang Muk
AU - Kwak, Min Jung
AU - Cho, Nam Wook
AU - Hong, Yoo Suk
PY - 2010/1
Y1 - 2010/1
N2 - Recently strengthened environmental regulations have obligated manufacturing companies to treat end-of-life (EOL) products both environmentally consciously and economically. EOL treatment begins with disassembling a product into recyclable or disposable sub-assemblies. Therefore, the economic value of an EOL product is largely a function of the plan for its disassembly: the means by which it is to be disassembled into smaller sub-assemblies, and the choice of sub-assemblies to be disassembled first. In order to make these decisions, a disassembly structure describing every possible sub-assembly division and its disassembly path from the original product has to be presented in a typical form. A widely used form of such a structure is a transition matrix. A transition matrix shows all feasible sub-assemblies and their disassembly hierarchy. Whereas it can be easily transformed into mathematical disassembly planning problem, the tedious work required for its generation limits its practical use. In this paper, we propose an algorithm for automatic derivation of a transition matrix. The proposed algorithm provides an efficient way to derive a transition matrix based on a product's architectural information, which includes the product's physical connections and the relative geometric locations between individual parts. The algorithm was validated in deriving a transition matrix of a car door-trim. Our algorithm can significantly expand the applicability of transition-matrix-based disassembly planning research.
AB - Recently strengthened environmental regulations have obligated manufacturing companies to treat end-of-life (EOL) products both environmentally consciously and economically. EOL treatment begins with disassembling a product into recyclable or disposable sub-assemblies. Therefore, the economic value of an EOL product is largely a function of the plan for its disassembly: the means by which it is to be disassembled into smaller sub-assemblies, and the choice of sub-assemblies to be disassembled first. In order to make these decisions, a disassembly structure describing every possible sub-assembly division and its disassembly path from the original product has to be presented in a typical form. A widely used form of such a structure is a transition matrix. A transition matrix shows all feasible sub-assemblies and their disassembly hierarchy. Whereas it can be easily transformed into mathematical disassembly planning problem, the tedious work required for its generation limits its practical use. In this paper, we propose an algorithm for automatic derivation of a transition matrix. The proposed algorithm provides an efficient way to derive a transition matrix based on a product's architectural information, which includes the product's physical connections and the relative geometric locations between individual parts. The algorithm was validated in deriving a transition matrix of a car door-trim. Our algorithm can significantly expand the applicability of transition-matrix-based disassembly planning research.
KW - Connection graph
KW - Disassembly planning
KW - End-of-life treatment
KW - Precedence graph
KW - Product architecture
KW - Transition matrix
UR - http://www.scopus.com/inward/record.url?scp=77951145054&partnerID=8YFLogxK
U2 - 10.1080/00207540902729918
DO - 10.1080/00207540902729918
M3 - Article
AN - SCOPUS:77951145054
SN - 0020-7543
VL - 48
SP - 3269
EP - 3298
JO - International Journal of Production Research
JF - International Journal of Production Research
IS - 11
ER -