Disassembly Sequence Generation: A Petri Net based Heuristic Approach

Abstract

The generation of a set of optimal or near-optimal disassembly sequences is an important task associated with the study of disassembly planning. This task encapsulates actions at the required disassembly depth to reach maximum net revenue while satisfying economic constraints. The Petri net modelling, combined with heuristic search procedures developed in this study, offers an efficient procedure for disassembly sequence generation. The heuristic generates and searches a partial reachability graph to arrive at an optimal or near-optimal disassembly sequence based on the firing sequence of transitions of the Petri net model. The proposed methodology reduces the search space in two areas: (1) pruning the disassembly tree (DT) and, (2) selective tracking of the reachability graph. The efficacy of the proposed methodology is demonstrated by using two examples from the literature.

Department(s)

Engineering Management and Systems Engineering

International Standard Serial Number (ISSN)

0020-7543

Document Type

Article - Journal

Document Version

Citation

File Type

text

Language(s)

English

Rights

© 2024 Taylor and Francis Group; Taylor and Francis, All rights reserved.

Publication Date

10 Sep 2002

Link to Full Text

Share

 
COinS