TY - JOUR
T1 - Disassembly sequence optimization for large-scale products with multiresource constraints using scatter search and petri nets
AU - Guo, Xiwang
AU - Liu, Shixin
AU - Zhou, Mengchu
AU - Tian, Guangdong
N1 - Funding Information:
Manuscript received January 4, 2015; revised May 15, 2015 and July 18, 2015; accepted September 9, 2015. This work was supported in part by the National Natural Science Foundation of China (NSFC) under Grant 71171038, Grant 71021061, and Grant 51405075, in part by the Postdoctoral Science Foundation Project of Heilongjiang Province of China under Grant LBH-TZ0501 and Grant LBH-Z13005, and in part by the Funds for International Cooperation and Exchange of the NSFC under Grant 51561125002. This paper was recommended by Associate Editor Y. Xiang. (Xiwang Guo and Shixin Liu contributed equally to this work.) (Corresponding author: MengChu Zhou.) X. Guo is with the College of Computer and Communication Engineering, Liaoning Shihua University, Fushun 113001, China, and also with the College of Information Science and Engineering, Northeastern University, Shenyang 110819, China (e-mail: x.w.guo@163.com).
Publisher Copyright:
© 2015 IEEE.
PY - 2015/10/13
Y1 - 2015/10/13
N2 - Disassembly modeling and planning are meaningful and important to the reuse, recovery, and recycling of obsolete and discarded products. However, the existing methods pay little or no attention to resources constraints, e.g., disassembly operators and tools. Thus a resulting plan when being executed may be ineffective in actual product disassembly. This paper proposes to model and optimize selective disassembly sequences subject to multiresource constraints to maximize disassembly profit. Moreover, two scatter search algorithms with different combination operators, namely one with precedence preserved crossover combination operator and another with path-relink combination operator, are designed to solve the proposed model. Their validity is shown by comparing them with the optimization results from well-known optimization software CPLEX for different cases. The experimental results illustrate the effectiveness of the proposed method.
AB - Disassembly modeling and planning are meaningful and important to the reuse, recovery, and recycling of obsolete and discarded products. However, the existing methods pay little or no attention to resources constraints, e.g., disassembly operators and tools. Thus a resulting plan when being executed may be ineffective in actual product disassembly. This paper proposes to model and optimize selective disassembly sequences subject to multiresource constraints to maximize disassembly profit. Moreover, two scatter search algorithms with different combination operators, namely one with precedence preserved crossover combination operator and another with path-relink combination operator, are designed to solve the proposed model. Their validity is shown by comparing them with the optimization results from well-known optimization software CPLEX for different cases. The experimental results illustrate the effectiveness of the proposed method.
KW - Disassembly
KW - Modeling and simulation
KW - Optimization
KW - Scatter search (SS) algorithm
UR - http://www.scopus.com/inward/record.url?scp=84944088831&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84944088831&partnerID=8YFLogxK
U2 - 10.1109/TCYB.2015.2478486
DO - 10.1109/TCYB.2015.2478486
M3 - Article
AN - SCOPUS:84944088831
SN - 2168-2267
VL - 46
SP - 2435
EP - 2446
JO - IEEE Transactions on Cybernetics
JF - IEEE Transactions on Cybernetics
IS - 10
M1 - 7297813
ER -