e-journal
A Chance Constrained Programming Approach to Determine the Optimal Disassembly Sequence
Disassembly planning is aimed to perform the optimal disassembly sequence given a used or obsolete product in terms of cost and environmental impact. However, the actual disassembly process of products can experience great uncertainty due to a variety of unpredictable factors. To deal with such uncertainty, this work presents some chance constrained programming models for disassembly cost from the perspective of stochastic planning.Moreover, two hybrid intelligent algorithms, namely, one integrating stochastic simulation and neural network (NN), and another integrating stochastic simulation, genetic algorithm (GA) and neural network (NN), are proposed to solve the proposed models, respectively. Some numerical examples are given to illustrate the proposed models and the effectiveness of proposed algorithms. Note to Practitioners—This paper deals with the uncertainty management problem of product disassembly. Based on such uncertainty, this work establishes some chance constrained programming
models for disassembly cost and proposes stochastic simulation algorithms based on NN and GA-NN to solve them, respectively. Previously, such a problem is handled through a methodology based on probabilistic planning and expected value analysis, which is ineffective without considering the chance problem of completing a disassembly task. The goal of this work is to analyze the disassembly uncertainty feature from the perspective of chance constrained programming. Both theoretical and simulation results demonstrate that the proposed approach can perform effectively the quantitative analysis of a disassembly
process. Such results can help decision makers perform better judgments when a disassembly process of a used, returned, problematic and or obsolete product is executed.
Index Terms—Algorithm, disassembly, disassembly planning,modeling and simulation.
Tidak ada salinan data
Tidak tersedia versi lain