Abstract
End-of-life (EOL) processing options include reuse, remanufacturing, recycling and proper disposal. In almost all cases, a certain level of disassembly may be required due to possible changes in the original product structure. 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 as the number of parts of the product grow, an efficient methodology is reuired for disassembly sequencing. In this paper, we present a Genetic Algorithm for disassembly sequencing of EOL products. A numerical example is provided to demonstrate the functionality of the algorithm.
Keywords
Disassembly Sequencing, Genetic Algorithm, Product Recovery, Robotics
Disciplines
Industrial Engineering | Mechanical Engineering
Publisher
Northeast Decision Sciences Institute
Publication Date
2010
Rights Information
Copyright 2010, Surendra M. Gupta
Rights Holder
Surendra M. Gupta
Permanent URL
Recommended Citation
ElSayed, Ahmed; Kongar, Elif; and Gupta, Surendra M., "A genetic algorithm approach to end-of-life disassembly sequencing for robotic disassembly" (2010). Mechanical and Industrial Engineering Faculty Publications. Paper 10. http://hdl.handle.net/2047/d20000258
Click button above to open, or right-click to save.
COinS
Notes
Originally published in the Proceedings of the 2010 Northeast Decision Sciences Institute Conference, Alexandria, Virginia, March 26-28, 2010 (CD-ROM)