Disassembly takes place in remanufacturing, recycling, and disposal with a line being the best choice for automation. The disassembly line balancing problem seeks a sequence which: is feasible, minimizes workstations, and ensures similar idle times, as well as other, disassembly-specific concerns. Finding the optimal balance is computationally intensive due to factorial growth. Ant colony optimization and genetic algorithm metaheuristics are presented and compared along with an exa mple to illustrate the implementation. Conclusions drawn include the consistent generation of optimal or near-optimal solutions, the ability to preserve precedence, the speed of the metaheuristics, and their practicality due to ease of implementation.
Disassembly, Disassembly line balancing, Colony optimization, genetic algorithm, End of life products
Copyright 2004, Surendra M. Gupta
Gupta M. Surendra
Gupta, Surendra M. and McGovern, Seamus M., "Multi-criteria ant system and genetic algorithm for end-of-life decision making" (2004). . Paper 74. http://hdl.handle.net/2047/d10013672
Click button above to open, or right-click to save.