Lexicographic Multiobjective Scatter Search for the Optimization of Sequence-Dependent Selective Disassembly Subject to Multiresource Constraints
Lexicographic Multiobjective Scatter Search for the Optimization of Sequence-Dependent Selective Disassembly Subject to Multiresource Constraints
复制标题
DOI：
10.1109/tcyb.2019.2901834
复制
发表时间：
2020-07
影响因子：
11.8
通讯作者：
Xiwang Guo;Mengchu Zhou;Shixin Liu;Liang Qi
中科院分区：
文献类型：
--
作者：
Xiwang Guo;Mengchu Zhou;Shixin Liu;Liang Qi
工业产品的再利用、回收和循环利用具有重要的环境效益和经济效益。有效的产品拆卸规划方法可以提高其回收效率，减少其对环境的不良影响。然而，现有的方法很少关注资源受限的顺序相关拆卸问题，如有限的拆卸操作员和工具，这使得现有的规划方法在实际应用中效率低下。研究了具有拆卸优先约束的多目标资源受限顺序相关拆卸优化问题。采用能耗指标对拆卸效率进行评价。将其与传统的优化准则相结合，建立了一种新的多目标优化模型，使拆卸过程中的能耗和拆卸时间最小，拆卸利润最大。由于问题的复杂性随着产品中零部件数量的增加而增加，提出了一种词典序多目标分散搜索方法来求解所提出的多目标优化问题。通过比较线性加权支持向量机和遗传算法的结果，验证了该算法的有效性。结果表明，该算法能够在较短的执行时间内提供较好的解决方案，并满足产品结构和资源约束的优先要求。
Industrial products’ reuse, recovery, and recycling are very important because of their environmental and economic benefits. Effective product disassembly planning methods can improve their recovery efficiency and reduce their bad environmental impact. However, the existing approaches pay little attention to sequence-dependent disassembly with resource constraints, such as limited disassembly operators and tools, which makes the current planning methods ineffective in practice. This paper considers a multiobjective resource-constrained and sequence-dependent disassembly optimization problem with disassembly precedence constraints. Energy consumption is adopted to evaluate the disassembly efficiency. Its use with traditional optimization criterion leads to a novel multiobjective optimization model such that the energy consumption and disassembly time are minimized while disassembly profit is maximized. Since the problem complexity increases with the number of components in a product, a lexicographic multiobjective scatter search (SS) method is proposed to solve the proposed multiobjective optimization problem. Its effectiveness is verified by comparing the results of linear weight SS and genetic algorithms. The results show that it is able to provide a better solution in a short execution time and fulfills the precedence requirement in a product structure and resource constraints.