A genetic algorithm for product disassembly sequence planning

Hui Wang; Dong Xiang; Guanghong Duan

A genetic algorithm for product disassembly sequence planning

Hui Wang^*
, Dong Xiang
, Guanghong Duan

^*Corresponding author for this work

Tsinghua University

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

10 Scopus citations

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.

Original language	English
Title of host publication	IEEE International Conference on Engineering of Intelligent Systems, ICEIS 2006
State	Published - 2006
Externally published	Yes
Event	IEEE International Conference on Engineering of Intelligent Systems, ICEIS 2006 - Islamabad, Pakistan Duration: 22 Apr 2006 → 23 Apr 2006

Publication series

Name	IEEE International Conference on Engineering of Intelligent Systems, ICEIS 2006

Conference

Conference	IEEE International Conference on Engineering of Intelligent Systems, ICEIS 2006
Country/Territory	Pakistan
City	Islamabad
Period	22/04/06 → 23/04/06

Keywords

Disassembly sequence planning
Genetic algorithm

Cite this

@inproceedings{d668ec40f2164fff82064aa8884b8118,

title = "A genetic algorithm for product disassembly sequence planning",

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 = "Disassembly sequence planning, Genetic algorithm",

author = "Hui Wang and Dong Xiang and Guanghong Duan",

year = "2006",

language = "英语",

isbn = "1424404568",

series = "IEEE International Conference on Engineering of Intelligent Systems, ICEIS 2006",

booktitle = "IEEE International Conference on Engineering of Intelligent Systems, ICEIS 2006",

note = "IEEE International Conference on Engineering of Intelligent Systems, ICEIS 2006 ; Conference date: 22-04-2006 Through 23-04-2006",

}

Wang, H, Xiang, D & Duan, G 2006, A genetic algorithm for product disassembly sequence planning. in IEEE International Conference on Engineering of Intelligent Systems, ICEIS 2006., 1703209, IEEE International Conference on Engineering of Intelligent Systems, ICEIS 2006, IEEE International Conference on Engineering of Intelligent Systems, ICEIS 2006, Islamabad, Pakistan, 22/04/06.

A genetic algorithm for product disassembly sequence planning. / Wang, Hui; Xiang, Dong; Duan, Guanghong.
IEEE International Conference on Engineering of Intelligent Systems, ICEIS 2006. 2006. 1703209 (IEEE International Conference on Engineering of Intelligent Systems, ICEIS 2006).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - A genetic algorithm for product disassembly sequence planning

AU - Wang, Hui

AU - Xiang, Dong

AU - Duan, Guanghong

PY - 2006

Y1 - 2006

N2 - 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.

AB - 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.

KW - Disassembly sequence planning

KW - Genetic algorithm

UR - https://www.scopus.com/pages/publications/40849141044

M3 - 会议稿件

AN - SCOPUS:40849141044

SN - 1424404568

SN - 9781424404568

T3 - IEEE International Conference on Engineering of Intelligent Systems, ICEIS 2006

BT - IEEE International Conference on Engineering of Intelligent Systems, ICEIS 2006

T2 - IEEE International Conference on Engineering of Intelligent Systems, ICEIS 2006

Y2 - 22 April 2006 through 23 April 2006

ER -

A genetic algorithm for product disassembly sequence planning

Abstract

Publication series

Conference

Keywords

Other files and links

Fingerprint

Cite this