A precedence-constrained asymmetric traveling salesman model for disassembly optimization |
| |
Authors: | Subhash C Sarin Hanif D Sherali Ajay Bhootra |
| |
Affiliation: |
a Grado Department of Industrial and Systems Engineering, Virginia Polytechnic Institute and State University, 250 Durham Hall, Blacksburg, VA, USA |
| |
Abstract: | In this paper, we address a product-disassembly optimization problem, which aims at minimizing the costs associated with the disassembly process (namely, the cost of breaking the joints and the sequence-dependent set-up cost associated with the disassembly operations), while maximizing the benefits resulting from the recovery of components and subassemblies that constitute the product. A method able to capture the mating relationships among the parts and joints of the product through a network representation scheme is developed. The disassembly optimization problem is formulated as a precedence-constrained asymmetric traveling salesman problem. A three-stage iterative procedure is designed to obtain optimal or near-optimal solutions to the problem. The results demonstrate that our procedure generates solutions that are within 2% of optimality for all test cases, while only requiring a reasonable computational effort. |
| |
Keywords: | |
本文献已被 InformaWorld 等数据库收录! |
|