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.
Disassembly Scheduling, Disassembly Process Planning and Genetic Algorithm
Gupta, Surendra M., "Genetic algorithm for disassembly process planning" (2001). . Paper 59. http://hdl.handle.net/2047/d10003162
Click button above to open, or right-click to save.