Translator Disclaimer
Paper
11 February 2002 Genetic algorithm for disassembly process planning
Author Affiliations +
Proceedings Volume 4569, Environmentally Conscious Manufacturing II; (2002) https://doi.org/10.1117/12.455264
Event: Intelligent Systems and Advanced Manufacturing, 2001, Boston, MA, United States
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.
© (2002) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Elif Kongar and Surendra M. Gupta "Genetic algorithm for disassembly process planning", Proc. SPIE 4569, Environmentally Conscious Manufacturing II, (11 February 2002); https://doi.org/10.1117/12.455264
PROCEEDINGS
9 PAGES


SHARE
Advertisement
Advertisement
Back to Top