The Community for Technology Leaders
Intelligent Systems Design and Applications, International Conference on (2006)
Jinan, China
Oct. 16, 2006 to Oct. 18, 2006
ISBN: 0-7695-2528-8
pp: 985-995
Hui Wang , Tsinghua University, China
Dong Xiang , Tsinghua University, China
Guanghong Duan , Tsinghua University, China
Jie Song , Beihang University, China
<p>Over the past several years, heuristic methods are often used to find optimal solution(s) of disassembly/recycle sequencing problem, for it is a NP-hard combinatorial optimization problem.</p> <p>In the proposed research, first, we present a method: product disassembly sequence planning problem could map onto a problem of searching the optimal tour in the Disassembly Feasibility Information Graph (DFIG).</p> <p>Then a genetic algorithm is proposed to search the optimal solution of disassembly/recycle problem. Optimization objective is the performance of a solution, which is mainly related with three factors: disassembling process, environment impact and disassembly &recycle line. In particular, scheduling disassembly &recycle line is also a NP-hard problem. Therefore, a heuristic genetic operator, combined with disassembly &recycle processes tree, is also presented to schedule the disassembly &recycle line.</p>

D. Xiang, H. Wang, G. Duan and J. Song, "A Hybrid Heuristic Approach for Disassembly/Recycle Applications," 2006 6th International Conference on Intelligent Systems Design and Applications(ISDA), Jinan, 2006, pp. 985-995.
96 ms
(Ver 3.3 (11022016))