A genetic algorithm for product disassembly sequence planning

Wang Hui; Xiang Dong; Duan Guanghong

doi:10.1016/j.neucom.2007.11.042

A genetic algorithm for product disassembly sequence planning

Wang Hui^*
, Xiang Dong
, Duan Guanghong

^*Corresponding author for this work

Tsinghua University

Research output: Contribution to journal › Article › peer-review

116 Scopus citations

Abstract

This paper presents a method to solve disassembly sequence planning problem. Firstly, disassembly feasibility information graph (DFIG) is presented to describe the product disassembly sequence and operation information. Then, disassembly sequence planning problem is mapped onto the DFIG as an optimal path-searching problem. Based on this idea, a genetic algorithm is provided to find out feasible and optimal disassembly solutions efficiently. Finally, a case study, which is used to illustrate the performance of proposed method, is presented.

Original language	English
Pages (from-to)	2720-2726
Number of pages	7
Journal	Neurocomputing
Volume	71
Issue number	13-15
DOIs	https://doi.org/10.1016/j.neucom.2007.11.042
State	Published - Aug 2008
Externally published	Yes

Keywords

Disassembly sequence planning
Genetic algorithm

Access to Document

10.1016/j.neucom.2007.11.042

Cite this

@article{cb7620ff1c6f4876ad7551f977119327,

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

abstract = "This paper presents a method to solve disassembly sequence planning problem. Firstly, disassembly feasibility information graph (DFIG) is presented to describe the product disassembly sequence and operation information. Then, disassembly sequence planning problem is mapped onto the DFIG as an optimal path-searching problem. Based on this idea, a genetic algorithm is provided to find out feasible and optimal disassembly solutions efficiently. Finally, a case study, which is used to illustrate the performance of proposed method, is presented.",

keywords = "Disassembly sequence planning, Genetic algorithm",

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

year = "2008",

month = aug,

doi = "10.1016/j.neucom.2007.11.042",

language = "英语",

volume = "71",

pages = "2720--2726",

journal = "Neurocomputing",

issn = "0925-2312",

publisher = "Elsevier B.V.",

number = "13-15",

}

TY - JOUR

T1 - A genetic algorithm for product disassembly sequence planning

AU - Hui, Wang

AU - Dong, Xiang

AU - Guanghong, Duan

PY - 2008/8

Y1 - 2008/8

N2 - This paper presents a method to solve disassembly sequence planning problem. Firstly, disassembly feasibility information graph (DFIG) is presented to describe the product disassembly sequence and operation information. Then, disassembly sequence planning problem is mapped onto the DFIG as an optimal path-searching problem. Based on this idea, a genetic algorithm is provided to find out feasible and optimal disassembly solutions efficiently. Finally, a case study, which is used to illustrate the performance of proposed method, is presented.

AB - This paper presents a method to solve disassembly sequence planning problem. Firstly, disassembly feasibility information graph (DFIG) is presented to describe the product disassembly sequence and operation information. Then, disassembly sequence planning problem is mapped onto the DFIG as an optimal path-searching problem. Based on this idea, a genetic algorithm is provided to find out feasible and optimal disassembly solutions efficiently. Finally, a case study, which is used to illustrate the performance of proposed method, is presented.

KW - Disassembly sequence planning

KW - Genetic algorithm

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

U2 - 10.1016/j.neucom.2007.11.042

DO - 10.1016/j.neucom.2007.11.042

M3 - 文章

AN - SCOPUS:56449111330

SN - 0925-2312

VL - 71

SP - 2720

EP - 2726

JO - Neurocomputing

JF - Neurocomputing

IS - 13-15

ER -

A genetic algorithm for product disassembly sequence planning

Abstract

Keywords

Access to Document

Other files and links

Fingerprint

Cite this