Disassembly sequence optimization for large-scale products with multiresource constraints using scatter search and petri nets

Document Type

Article

Publication Date

10-13-2015

Abstract

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.

Identifier

84944088831 (Scopus)

Publication Title

IEEE Transactions on Cybernetics

External Full Text Location

https://doi.org/10.1109/TCYB.2015.2478486

e-ISSN

21682275

ISSN

21682267

First Page

2435

Last Page

2446

Issue

10

Volume

46

Grant

51561125002

Fund Ref

National Natural Science Foundation of China

This document is currently not available here.

Share

COinS