基于二分图最大匹配的RV减速器选配方法

详细信息    查看全文 | 推荐本文 |

英文篇名：Study on Selected Assembly Method of RV Reduce Based on Bipartite Graph Maximum Matching Theory 作者：贡林欢 ; 左健民 英文作者：GONG Linhuan;ZUO Jianmin;College of Mechanical Engineering, Jiangsu University;Research Department of Intelligent Manufacturing Equipment, Nanjing Institute of Technology; 关键词：二分图 ; 匹配 ; RV减速器 ; 分组选配法 ; 选配 英文关键词：bipartite graph;;matching;;RV reducer;;grouping matching model;;selective assembly 中文刊名：JSYY 英文刊名：Machine Design & Research 机构：江苏大学机械工程学院;南京工程学院智能装备研究院; 出版日期：2019-04-20 出版单位：机械设计与研究 年：2019 期：v.35;No.180 基金：江苏省产学研前瞻性联合研究项目(BY2016008-04)资助 语种：中文; 页：JSYY201902022 页数：4 CN：02 ISSN：31-1382/TH 分类号：87-90

摘要

RV减速器装配精度要求很高,采用完全互换装配法不经济,寻找合适的选配方法值得研究。分组选配法滞装严重,且依赖待装零件的尺寸分布,而基于二分图匹配的选配方法具有匹配率高、算法易于实现等优点。首先对二分图匹配的基本定义和基本理论进行说明,介绍了二分图最大匹配的匈牙利算法,然后应用该方法完成RV20E型减速器的零部件选配。最后,利用数值模拟方法做了对比试验,结果表明二分图匹配比分组选配法的匹配率高6%至25%。为RV减速器的选配提供了新方法,该方法也可应用在其他精密零件装配领域。
        RV reducer has the characteristic of high assembly precision,interchangeable assembly method is uneconomical. Group matching model depends on the size distribution of parts and causes a large number of surplus parts, on the contrary, the selected assembly method based on bipartite graph maximum matching has the characteristics of high rate of matching and easy to realized on compute. In this paper,the basic definitions and theory on bipartite graph matching are introduced,the bipartite graph maximum matching algorithm,the Hungarian algorithm,is described and applied to a example.A test between group matching model and bipartite graph matching method is done, the result shows that the matching rate of bipartite graph matching method is 6% to 25% higher then that of the group matching model. The selected assembly method based on bipartite graph matching provides a new method on assembling RV reduce,which can also used on other fields.

引文

[1]王嘉宁,顾京君,言勇华.摆线轮基本齿形参数与RV减速器啮合刚度的关系[J].机械设计与研究,2017,33(4):63-67.
    [2]魏波,周广武,杨荣松,等.RV减速器摆线轮齿廓修形方法对比研究[J].机械设计与研究,2016,32(1):41-44.
    [3]聂松辉,颜彧.RV减速器输出机构扭转刚度分析计算[J].机械设计与研究,2014,30(4):24-26.
    [4]宿彪,黄向明,任莹晖,等.基于蚁群算法的工程机械再制造优化选配方法研究[J].机械工程学报,2017,53(5):60-68.
    [5]MIAO D,CAI Z,TONG W,et al.Approximation for vertex cover inβ-conflict graphs[J].Journal of Combinatorial Optimization,2017,34(4):1052-1059.
    [6]邓应兰,姚凯学.基于网络流规划的滑阀组件选配方法的研究与实现[J].自动化与仪器仪表,2016(3):7-10.
    [7]吴威让,陈金阳,殷威.静态二元偏好婚姻匹配问题[J].湖北师范大学学报:自然科学版,2014(4):74-78.
    [8]冯振笑,柯越华.整数规划的交集及交集余集解法[J].中国石油大学学报:自然科学版,2001,25(2):122-124.
    [9]刘明周,郭嘉,李旗号.机械产品精密配合中的选配方法研究[J].机械工程学报,2004,40(6):165-168.
    [10]HALL P.On representatives of subsets[J].Journal of the London Mathematical Society,1935,1(1):58-62.
    [11]EDMONDS J.Paths,trees,and flowers[J].Canadian Journal of Mathematics,1965,17(3):361-379.
    [12]NAPARSTEK O,LESHEM A.Expected time complexity of the auction algorithm and the push relabel algorithm for maximum bipartite matching on random graphs[J].Random Structures&Algorithms,2016,48(2):384-395.
    [13]HOPCROFT J,KARP R.An n^5/2 algorithm for maximum matchings in bipartite graphs[J].SIAM Journal on computing,1973,2(4):225-231.
    [14]BERGE C.Two theorems in graph theory[J].Proceedings of the National Academy of Sciences of the United States of America,1957,43(9):842-844.
    [15]金博.图论及应用[M].哈尔滨:哈尔滨工业大学出版社,2011.