A Genetic Algorithm for Disassembly Process Planning
Loading...
Authors
Kongar, Elif
Gupta, Surendra M.
Issue Date
2001-10-28
Type
Article
Language
en_US
Keywords
Disassembly scheduling , Disassembly process planning , Genetic algorithms
Alternative Title
Abstract
When a product reaches it’s 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.
Description
Copyright 2001 Society of Photo-Optical Instrumentation Engineers. One print or electronic copy may be made for personal use only. Systematic reproduction and distribution, duplication of any material in this paper for a fee or for commercial purposes, or modification of the content of the paper are prohibited.
Citation
Kongar, E. and Gupta, S.M., “Genetic Algorithm for Disassembly Process Planning”, Proceedings of the SPIE International Conference on Environmentally Conscious Manufacturing II, Newton, MA, October 28-29, pp.54-62, 2001
Publisher
SPIE