Research on selective disassembly sequence planning for Repair

DOI

10.2991/icsma-16.2016.120How to use a DOI?

Keywords

Selective disassembly; Disassembly Sequence Planning for repair; hybrid precedence graph; stability; ant colony algorithm

Abstract

In order to improve the efficiency of selective disassembly sequence planning for repair, a selective disassembly sequence planning approach based on ant colony algorithm is proposed. Hybrid Precedence Graph(HPG) is constructed to describe the geometric constraints among constituting components and components' stability during disassembly. Then in order to find the target component accurately and quickly, disassembly set for the target is obtained based on HPG. Dynamical candidates set strategy based on precedence relations is adopted to constrain the searching space, and a selective Disassembly Sequence Planning(DSP) approach based on HPG is proposed. Finally, the validity and feasibility of the proposed approach is verified by a study case. Taking geometric constraint and components' stability into count, this approach could be more practical.

Copyright

© 2016, the Authors. Published by Atlantis Press.

Open Access

This is an open access article distributed under the CC BY-NC license (http://creativecommons.org/licenses/by-nc/4.0/).

Download article (PDF)

TY  - CONF
AU  - Mingxing Deng
AU  - Jumei Wang
AU  - Qiuhua Tang
AU  - Liping Zhang
PY  - 2016/12
DA  - 2016/12
TI  - Research on selective disassembly sequence planning for Repair
BT  - Proceedings of the 2016 4th International Conference on Sensors, Mechatronics and Automation (ICSMA 2016)
PB  - Atlantis Press
SP  - 685
EP  - 691
SN  - 1951-6851
UR  - https://doi.org/10.2991/icsma-16.2016.120
DO  - 10.2991/icsma-16.2016.120
ID  - Deng2016/12
ER  -