By Topic

A Chance Constrained Programming Approach to Determine the Optimal Disassembly Sequence

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Guangdong Tian ; Transportation College, Northeast Forestry University, Harbin, P. R. China ; MengChu Zhou ; Jiangwei Chu

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.

Published in:

IEEE Transactions on Automation Science and Engineering  (Volume:10 ,  Issue: 4 )