摘要
分析了产品拆卸序列规划中的不确定性,在基于混合图的产品拆卸模型的基础上,将产品拆卸序列规划转化为一类不确定规划问题。以机会约束规划模型为基础,使用模拟退火算法,给出了基于不确定规划的产品拆卸序列规划求解流程和算法。最后,通过一个简化的计算机主机箱实例说明了方法的有效性及优越性。
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.
出处
《中国机械工程》
EI
CAS
CSCD
北大核心
2012年第18期2143-2148,共6页
China Mechanical Engineering
基金
国家科技重大专项(2008BAC46B01)
国家科技支撑计划资助项目(2011BAF11B04)
关键词
拆卸序列规划
模拟退火算法
不确定规划
机会约束规划
disassembly sequence planning
simulated annealing algorithm
uncertain programming
chance-constrained programming（CCP）
