基于Floyd算法的目标拆卸序列优化  

The optimization of the dismantled order on a target based on the Floyd algorithmic method

作　　者：薛俊芳[1] 张新建[1] 张英利[1] 

机构地区：[1]内蒙古工业大学机械学院,呼和浩特010051

出　　处：《现代制造工程》2014年第2期83-87,共5页Modern Manufacturing Engineering

摘　　要：针对拆卸序列优化问题,为了得到满足实际需要的产品拆卸序列方案,减少产品的拆卸时间和拆卸复杂度,将产品信息和零件约束关系转换成图模型;同时利用Floyd算法对图模型进行路径寻优,得出最优拆卸序列。首先,分析产品零/部件之间的连接关系;然后找到最有可能的拆卸零/部件的切入点,生成拆卸有向图,用时间和拆卸复杂度的乘积来作为拆卸有向图的权重;最后,用Floyd算法在MATLAB软件中仿真,实现寻找拆卸目标零/部件的最优路径,通过图论和Floyd算法的有效结合,能更有效地拆卸零/部件,具有很大的实际意义。Direct at the optimization of the dismantled order, to transform production＇ s information and the bound relationship of the component into graph model;to use Floyd algorithmic method to search a better method of the graph model in order to get an optimal dismantled order at the same time. First, analysis the connective relationship of the production＇ s component, then to seek out the most possible point of penetration to dismantle the component, to generate a directed graph, and to multiply the value of time by the value of complexity. Their product can be the weight function of the directed graph;at last, to use the Floyd algorith- mic method to simulate by MATLAB to seek out the optimal method to dismantle the target＇ s component. The incorporation of the Floyd algorithmic method and the graph theory can dismantle component effectively, and it shows a profound significance.

关 键 词：可拆卸性设计 有向图 FLOYD算法 

分 类 号：TH16[机械工程—机械制造及自动化]