基于不确定规划的产品拆卸序列规划

中国机械工程 ›› 2012, Vol. 23 ›› Issue (18): 2143-2148.

基于不确定规划的产品拆卸序列规划

王淑旺;刘志峰;胡迪;高洋;蒋浩

合肥工业大学,合肥,230009

出版日期:2012-09-25 发布日期:2012-09-29
基金资助:
国家科技重大专项(2008BAC46B01);国家科技支撑计划资助项目（2011BAF11B04）
National Science and Technology Major Project ( No. 2008BAC46B01);
The National Key Technology R&D Program（No. 2011BAF11B04）

Product Disassembly Sequence Planning Based on Uncertain Programming

Wang Shuwang;Liu Zhifeng;Hu Di;Gao Yang;Jiang Hao

Hefei University of Technology,Hefei,230009

Online:2012-09-25 Published:2012-09-29
Supported by:

National Science and Technology Major Project ( No. 2008BAC46B01);
The National Key Technology R&D Program（No. 2011BAF11B04）

摘要/Abstract

摘要：

分析了产品拆卸序列规划中的不确定性,在基于混合图的产品拆卸模型的基础上,将产品拆卸序列规划转化为一类不确定规划问题。以机会约束规划模型为基础，使用模拟退火算法，给出了基于不确定规划的产品拆卸序列规划求解流程和算法。最后,通过一个简化的计算机主机箱实例说明了方法的有效性及优越性。

关键词: 拆卸序列规划, 模拟退火算法, 不确定规划, 机会约束规划

Abstract:

By analyzing the uncertainty of a product disassembly sequence planning,the product disassembly sequence planning was transformed into an issue of uncertain programming problem based on product disassembly model of the composite drawing.By using the chance-constrained programming model,
the product disassembly sequence planning solving process and algorithm based on
simulated annealing algorithm were given.Finally,a simplified computer mainframe
box was given as an example to show the effectiveness and superiority of the proposed method.

Key words: disassembly sequence planning, simulated annealing algorithm, uncertain programming, chance-constrained programming(CCP)

中图分类号:

TH122

王淑旺, 刘志峰, 胡迪, 高洋, 蒋浩. 基于不确定规划的产品拆卸序列规划[J]. 中国机械工程, 2012, 23(18): 2143-2148.

WANG Chu-Wang, LIU Zhi-Feng, HU Di, GAO Xiang, JIANG Gao. Product Disassembly Sequence Planning Based on Uncertain Programming[J]. China Mechanical Engineering, 2012, 23(18): 2143-2148.

导出引用管理器 EndNote|Ris|BibTeX

链接本文: http://www.cmemo.org.cn/CN/

http://www.cmemo.org.cn/CN/Y2012/V23/I18/2143

参考文献

[1]Gupta S M, Mclean C R. Disassembly of Products. NIST Systems Integration for Manufacturing Appli- cation Program Grant No. 60NANB5D0112F Final Report[R]. Boston:Northeastern University, 1996.
[2]Gao Meimei, Zhou Mengehu, Tang Ying. Intelligent Decision Making in Disassembly Process Based on Fuzzy Reasoning Petri Nets[J]. IEEE Transactions on Systems, Man and Cybernetics -- Part B: Cyber- netics, 2004,34 (5) : 2029-2034.
[3]Moore K E,Gungor A,Gupta S M. A Petri Net Ap- proach to Disassembly Process Planning[J]. Com- puters and Industrial Engineering, 1998, 35 (1/2) : 165-168.
[4]高建刚[1],牟鹏[1],向东[1],段广洪[1],汪劲松[1].拆卸与或图模型中的可拆卸性筛子[J].机械设计与研究,2004,20(4):53-56.
[5]高建刚[1],向东[1],陈海峰[1],段广洪[1],汪劲松[1].拆卸与或图拆卸模型连通性筛子的新构造法[J].机械科学与技术,2004,23(2):143-146.
[6]李方义[1],李剑峰[1],李建志[2],段广洪[3].面向目标拆卸的产品复合有向图建模[J].中国机械工程,2009,10(5):553-558.
[7]李剑峰[1],陈建[1],李方义[1],王玉玲[1].机电产品拆卸回收模型及其拆卸序列生成[J].山东大学学报：工学版,2004,34(5):9-13.
[8]章小红[1],李世其[1],王峻峰[1].基于蚁群算法的产品拆卸序列规划方法[J].计算机辅助设计与图形学学报,2007,19(3):387-391.
[9]薛俊芳[1,2],邱长华[1],向东[3].基于蚁群优化算法的目标拆卸序列规划[J].计算机辅助设计与图形学学报,2007,19(6):742-747.
[10]Wang Hui, Xiang Dong, Duan Guanghong. A Ge- netic Algorithm for Product Disassembly Sequence Planning[J]. Neurocomputing, 2008, 71 ( 13/15 ) : 2720-2726.
[11]吴昊[1],左洪福[1].基于改进遗传算法的产品拆卸序列规划[J].中国机械工程,2009,10(6):699-703.
[12]张秀芬[1,2],张树有[1].基于粒子群算法的产品拆卸序列规划方法[J].计算机集成制造系统,2009,15(3):508-514.
[13]Li Jing-- Rong, Li Pheng-- Khoo, Shu Beng-- Tor. Generation of Possible Multiple Components Dis- assembly Sequence for Maintenance Using a Disas- sembly Constraint Graph[J]. International Journal of Production Economics, 2006,102 ( 1 ) : 51-65.
[14]刘宝碇等著.不确定规划及应用[M],2003:301.
[15]鲁刚[1],文福拴[2],赵学顺[3],钟志勇[4],黄杰波[4].目标与机会平衡规划法[J].控制与决策,2009,24(11):1641-1646.
[16]Kirkpatrick S, Gelatt C D, Vecchi M P. Optimiza- tion by Simulated Annealing[J]. Science, 1983,220 (4598) : 671-680.
[17]Cerny V. Thermodynamical Approach to the Trav- eling Salesman Problem: An Efficient Simulation Algorithm[J]. Journal of Optimization Theory and Applications,1985,4(1):41-51.