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

^*此作品的通讯作者

Tsinghua University

科研成果: 期刊稿件 › 文章 › 同行评审

116 引用（Scopus）

摘要

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.

源语言	英语
页（从-至）	2720-2726
页数	7
期刊	Neurocomputing
卷	71
期	13-15
DOI	https://doi.org/10.1016/j.neucom.2007.11.042
出版状态	已出版 - 8月 2008
已对外发布	是

访问文件

10.1016/j.neucom.2007.11.042

其它文件与链接

链接到 Scopus 的出版物

引用此

@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

摘要

访问文件

其它文件与链接

指纹

引用此