Journal
IEEE TRANSACTIONS ON CYBERNETICS
Volume 46, Issue 11, Pages 2435-2446Publisher
IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
DOI: 10.1109/TCYB.2015.2478486
Keywords
Disassembly; modeling and simulation; optimization; scatter search (SS) algorithm
Categories
Funding
- National Natural Science Foundation of China (NSFC) [71171038, 71021061, 51405075]
- Postdoctoral Science Foundation Project of Heilongjiang Province of China [LBH-TZ0501, LBH-Z13005]
- Funds for International Cooperation and Exchange of the NSFC [51561125002]
Ask authors/readers for more resources
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.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available