This paper describes a hybrid approach to handle disassembly sequence planning for maintenance. The product under maintenance is first modeled using a novel hybrid graph known as Disassembly Constraint Graph (DCG) which embodies complete disassembly information and can be used to prune the search space of disassembly sequences. Subsequently, a novel Tabu-enhanced GA engine is invoked to generate the near optimal disassembly sequences. A case study was used to illustrate the effectiveness of the proposed approach. The details of the DCG, the TS-enhanced GA engine and the fitness function used are presented in this paper.
A Hybrid Disassembly Sequence Planning Approach for Maintenance
Contributed by the Computer Aided Product Development (CAPD) Committee for publication in the JOURNAL OF COMPUTING AND INFORMATION SCIENCE IN ENGINEERING. Manucript received Apr. 2001; Revised Mar. 2002. Associate Editor: D. Dutta.
- Views Icon Views
- Share Icon Share
- Cite Icon Cite
- Search Site
Li , , J. R., Tor , and , S. B., and Khoo, L. P. (June 5, 2002). "A Hybrid Disassembly Sequence Planning Approach for Maintenance ." ASME. J. Comput. Inf. Sci. Eng. March 2002; 2(1): 28–37. https://doi.org/10.1115/1.1481370
Download citation file:
- Ris (Zotero)
- Reference Manager