Optimizing disassembly processes subjected to sequence-dependent cost
Optimizing disassembly processes subjected to sequence-dependent cost
复制标题
DOI：
10.1016/j.cor.2005.03.012
复制
发表时间：
2007-02-01
影响因子：
4.6
通讯作者：
Lambert, A. J. D.
中科院分区：
文献类型：
--
作者：
Lambert, A. J. D.
对于给定的产品，最优拆卸序列的检测可以通过数学规划进行，这是基于其拆卸过程的与或图表示。这被称为精确方法，因为它揭示了全局最优值。本文介绍了一种扩展的情况下，顺序相关的成本被认为是确切的方法。以前提出的方法局限于顺序拆卸，或基于化学。唯一确切的方法为完整的问题，迄今为止已知的，需要一个精心改造的AND/OR图，是基于整数线性规划。本文讨论了一种替代方法，使用二进制整数线性规划方法，不需要转换的AND/OR图。所提出的方法被应用到任意的情况下，一些产品结构，已从文献中。除此之外，该方法被应用到一个可扩展的AND/OR图，使产品的复杂性逐渐增加。结果表明，迭代过程的收敛性是令人满意的，所需的CPU时间出现相对较小，只有适度增加的约束的数量。看来，该方法适用于产品的复杂性，不能管理的整数线性规划模型。迭代方法是有前途的处理模块化产品和启发式算法，如果产品表现出更高的复杂性，这是一个基准。(c)2005爱思唯尔有限公司保留所有权利。
Detection of the optimum disassembly sequence for a given product can proceed via mathematical programming, which is based on the AND/OR graph representation of its disassembly process. This is called the exact method for it reveals the global optimum. This paper describes an extension of the exact method in case sequence-dependent costs are considered. Previously presented methods confined themselves either to sequential disassembly, or were based on heuristics. The only exact method for the full problem known so far, needs an elaborate transformation of the AND/OR graph, and is based on integer linear programming. This paper discusses an alternate approach that uses a binary integer linear programming approach and that lacks the need of transforming the AND/OR graph. The proposed method is applied to arbitrary instances of some product structures that have been taken from the literature. Apart from this, the method is applied to an expandable AND/OR graph, that enables gradual increase of product complexity. It is demonstrated that the convergence of the iteration process is satisfactory, and the required CPU time appears comparatively small and only moderately increases with the number of constraints. It appears that the method applies to products with a complexity that cannot be managed with the integer linear programming model. The iterative method is promising for dealing with modularized products and as a benchmark for heuristic algorithms, which are used if products exhibit still higher complexity. (c) 2005 Elsevier Ltd. All rights reserved.