Uninformed and probabilistic distributed agent combinatorial searches for the unary NP-complete disassembly line balancing problem

Title:
Uninformed and probabilistic distributed agent combinatorial searches for the unary NP-complete disassembly line balancing problem
Creator:
Gupta, Surendra M. (Author)
McGovern, Seamus M. (Author)
Language:
English
Publisher:
SPIE
Copyright date:
2005
Type of resource:
Text
Genre:
Articles
Format:
electronic
Digital origin:
born digital
Abstract/Description:

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 end-of-life specific concerns. Finding the optimal balance is computationally intensive due to exponential growth. Combinatorial optimization methods hold promise for providing solutions to the disassembly line balancing problem, which is proven here to belong to the class of unary NP-complete problems. Probabilistic (ant colony optimization) and uninformed (H-K) search methods are presented and compared. Numerical results are obtained using a recent case study to illustrate the search implementations and compare their performance. Conclusions drawn include the consistent generation of near-optimal solutions, the ability to preserve precedence, the speed of the techniques, and their practicality due to ease of implementation.

Comments:

Originally published in the Proceedings of the SPIE International Conference on Environmentally Conscious Manufacturing V, Boston, Massachusetts, pp. 81-92, October 23-24, 2005

Subjects and keywords:
Production engineering
Disassembly
product recovery
complexity theory
ant colony optimization
Hunter-Killer (H-K) general-purpose heuristic
combinatorial optimization
disassembly line balancing
Engineering

Downloads