Disassembly Sequence Optimization for Large-Scale Products With Multiresource Constraints Using Scatter Search and Petri Nets
针对现有拆卸规划忽视资源约束的问题，提出一种考虑多资源约束的拆卸序列优化模型，并设计两种分散搜索算法求解，实验表明该方法能有效提高拆卸利润。
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.