基于复合嵌套分割算法的装配序列规划方法研究

发布时间：2018-06-28 21:40

本文选题：装配序列规划 + 装配信息混合有向图　；参考：《华中科技大学》2015年硕士论文

【摘要】：装配在产品的设计与制造中占据了非常重要的位置。产品的装配是一个复杂的过程,涉及到装配方向的选择,工具的使用等很多因素,因此利用计算机实现装配序列的自动规划,可以大大减少装配过程中时间和资源的浪费,提高装配的效率。本文提出基于复合嵌套分割算法的装配序列规划,在装配建模的基础上,生成和评价序列,并利用复合嵌套分割算法对序列进行优化,最后输出装配序列。针对装配序列规划的需求,结合现阶段国内外装配建模研究状况,本文运用装配信息混合有向图来建立产品装配模型。为了求解零件之间的装配优先关系,采用了干涉矩阵的方法来反映零件的干涉关系。为了生成装配序列,利用集成干涉矩阵来求解零件的可行装配方向,并由此推导出可装配的零件,从而确立了零件间的先后装配关系。分析了装配序列评价中几何可行性、装配方向改变次数和装配工具改变次数这几个评价指标,建立了多指标的评价函数。本文利用面向装配序列规划的嵌套分割算法,并融入禁忌搜索算法的思想,提高了嵌套分割算法的局部搜索能力,形成复合嵌套分割算法,并利用该复合算法来求解装配序列规划问题。利用Visual C++6.0工具开发了装配序列规划原型系统,系统实现了复合嵌套分割算法求解装配序列,并结合具体的实例验证了系统的应用效果,分析了复合嵌套分割算法求解的可行性。
[Abstract]:Assembly occupies a very important position in the design and manufacture of products. Product assembly is a complex process, which involves many factors, such as the choice of assembly direction, the use of tools, etc. Therefore, the use of computer to realize the automatic planning of assembly sequence can greatly reduce the waste of time and resources in the assembly process. Improve the efficiency of assembly. In this paper, assembly sequence planning based on compound nested segmentation algorithm is proposed. On the basis of assembly modeling, sequences are generated and evaluated. The sequence is optimized by using compound nested segmentation algorithm, and the assembly sequence is output at last. According to the requirements of assembly sequence planning and the current research situation of assembly modeling at home and abroad, this paper uses the assembly information hybrid directed graph to establish the product assembly model. In order to solve the assembly priority relationship between parts, the interference matrix method is used to reflect the interference relation of the parts. In order to generate the assembly sequence, the feasible assembly direction of the parts is solved by using the integrated interference matrix, and the assembly relationship between the parts is established. The geometric feasibility, the number of changes in assembly direction and the number of changes in assembly tools in assembly sequence evaluation are analyzed, and the evaluation function of multiple indexes is established. In this paper, we use the nested segmentation algorithm for assembly sequence planning, and incorporate the idea of Tabu search algorithm to improve the local search ability of the nested segmentation algorithm and form a compound nested segmentation algorithm. The composite algorithm is used to solve the assembly sequence planning problem. The prototype system of assembly sequence planning is developed by using Visual C 6.0. The system realizes the composite nested segmentation algorithm to solve the assembly sequence, and the application effect of the system is verified by a concrete example. The feasibility of composite nested segmentation algorithm is analyzed.
【学位授予单位】：华中科技大学
【学位级别】：硕士
【学位授予年份】：2015
【分类号】：TG95

【相似文献】