A Genetic Algorithm for Product Disassembly Sequence Planning

Author

Hui, Wang ; Dong, Xiang ; Guanghong, Duan

Author_Institution

Dept. of Precision Instrum. & Mechanology, Tsinghua Univ., Beijing

fYear

0

fDate

0-0 0

Firstpage

1

Lastpage

5

Abstract

This paper´s concern is on product´s disassembly sequence planning which is a complex NP-hard problem. Disassembly feasibility information graph (DFIG) is presented for describing product´s disassembly operations (sequences) information. Based on the DFIG, the problem of disassembly sequence planning is transformed into a problem of searching optimum path. A genetic algorithm is introduced to search for feasible and optimum solution of product disassembly sequence with a well efficiency. Finally, a simply case example is used to illustrate the method

Keywords

computational complexity; design for disassembly; genetic algorithms; graph theory; product design; complex NP-hard problem; disassembly feasibility information graph; genetic algorithm; optimum path searching; product disassembly sequence planning; Algorithm design and analysis; Biological cells; Encoding; Engines; Genetic algorithms; Instruments; NP-hard problem; Optimization methods; Path planning; Product design; Disassembly sequence planning; Genetic algorithm;

fLanguage

English

Publisher

ieee

Conference_Titel

Engineering of Intelligent Systems, 2006 IEEE International Conference on

Conference_Location

Islamabad

Print_ISBN

1-4244-0456-8

Type

conf

DOI

10.1109/ICEIS.2006.1703209

Filename

1703209