摘要
分析了产品实际拆卸过程中的不确定性,将实际产品拆卸序列规划转化为一类贪婪算法求解问题。以最少工具更换次数为指标,构建了基于贪婪算法的产品拆卸序列规划调整的贪婪准则,进而给出了产品拆卸序列规划调整流程。最后,通过一个简化的计算机主机箱的拆卸说明该方法的可行性和有效性。
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.
出处
《中国机械工程》
EI
CAS
CSCD
北大核心
2011年第18期2162-2166,共5页
China Mechanical Engineering
基金
国家自然科学基金资助项目(50735006)
国家科技重大项目(2008BAC46B01)
关键词
拆卸约束图
拆卸序列规划
贪婪算法
贪婪准则
disassembly constraint graph
disassembly sequence planning
greedy algorithm
greedycriterion
