Sixth International Conference on Intelligent Systems Design and Applications (ISDA'06) Volume 1 A Hybrid Heuristic Approach for Disassembly/Recycle Applications Jinan, China October 16-October 18 ISBN: 0-7695-2528-8
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/ISDA.2006.60
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. 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). 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.
Citation:
Hui Wang, Dong Xiang, Guanghong Duan, Jie Song, "A Hybrid Heuristic Approach for Disassembly/Recycle Applications," isda, vol. 1, pp.985-995, Sixth International Conference on Intelligent Systems Design and Applications (ISDA'06) Volume 1, 2006 Usage of this product signifies your acceptance of the Terms of Use. | |||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||