Share Email Print

Proceedings Paper

Genetic algorithm for disassembly process planning
Format Member Price Non-Member Price
PDF $17.00 $21.00
cover GOOD NEWS! Your organization subscribes to the SPIE Digital Library. You may be able to download this paper for free. Check Access

Paper Abstract

When a product reaches its end of life, there are several options available for processing it including reuse, remanufacturing, recycling, and disposing (the least desirable option). In almost all cases, a certain level of disassembly may be necessary. Thus, finding an optimal (or near optimal) disassembly sequence is crucial to increasing the efficiency of the process. Disassembly operations are labor intensive, can be costly, have unique characteristics and cannot be considered as reverse of assembly operations. Since the complexity of determining the best disassembly sequence increases with the increase in the number of parts of the product, it is extremely crucial that an efficient methodology for disassembly process planning be developed. In this paper, we present a genetic algorithm for disassembly process planning. A case example is considered to demonstrate the functionality of the algorithm.

Paper Details

Date Published: 11 February 2002
PDF: 9 pages
Proc. SPIE 4569, Environmentally Conscious Manufacturing II, (11 February 2002); doi: 10.1117/12.455264
Show Author Affiliations
Elif Kongar, Northeastern Univ. (United States)
Surendra M. Gupta, Northeastern Univ. (United States)

Published in SPIE Proceedings Vol. 4569:
Environmentally Conscious Manufacturing II
Surendra M. Gupta, Editor(s)

© SPIE. Terms of Use
Back to Top