Optimization of the Disassembly Sequencing Problem on the Basis of Self-Adaptive Simplified Swarm Optimization

Publication Type:
Journal Article
IEEE Transactions On Systems Man And Cybernetics Part A-Systems And Humans, 2012, 42 (1), pp. 250 - 261
Issue Date:
Full metadata record
Files in This Item:
Filename Description Size
Thumbnail2011001623OK.pdf2.76 MB
Adobe PDF
The end-of-life (EOL) disassembly sequencing problem (DSP) has become increasingly important in the process of handling EOL products. This paper proposes a solution procedure for the âEOL DSPâ ; the procedure is based on a novel soft-computing algorithm that utilizes modified âsimplified swarm optimization,â and the procedure combines the precedence preservative operator, feasible solution generator, self-adaptive parameter control, and repetitive pairwise exchange procedures. By taking into consideration the non-deterministic polynomial time (NP)-complete nature of the problem, the proposed algorithm efficiently seeks the optimal disassembly sequence with a novel approach; this approach involves reducing the initial solution space and using a combination of soft-computing algorithms for achieving higher computational efficiency and solution quality. The results presented in this paper show that the proposed algorithm outperforms the existing algorithms in terms of solution quality achieved in a limited computation time.
Please use this identifier to cite or link to this item: