中国机械工程2011，Vol.22Issue(18)：2162-2166,5.
基于贪婪算法的产品拆卸序列规划
Product Disassembly Sequence Planning Based on Greedy Algorithm
摘要
Abstract
By analyzing the uncertainty of product disassemble process,a product disassembly sequence planning was mapped into a problem which can be solved by greedy algorithm. Using minimum tool change frequency as evaluating indicator, the greedy criterion for the product disassembly sequence planning adjustment using greedy algorithm was given and the product disassembly sequence planning adjustment process was finally shown. A simplified computer mainframe box disassemble example was given to show the feasibility and effectiveness of the proposed method.关键词
拆卸约束图/拆卸序列规划/贪婪算法/贪婪准则Key words
disassembly constraint graph/disassembly sequence planning/greedy algorithm/greedycriterion分类
机械制造引用本文复制引用
刘志峰,胡迪,高洋,张敬东..基于贪婪算法的产品拆卸序列规划[J].中国机械工程,2011,22(18):2162-2166,5.基金项目
基金项目：国家自然科学基金资助项目（50735006) （）
国家科技重大项目（2008BAC46801) （）
