本文選題：裝配序列規(guī)劃 + 裝配信息混合有向圖　； 參考：《華中科技大學(xué)》2015年碩士論文

【摘要】：裝配在產(chǎn)品的設(shè)計與制造中占據(jù)了非常重要的位置。產(chǎn)品的裝配是一個復(fù)雜的過程,涉及到裝配方向的選擇,工具的使用等很多因素,因此利用計算機實現(xiàn)裝配序列的自動規(guī)劃,可以大大減少裝配過程中時間和資源的浪費,提高裝配的效率。本文提出基于復(fù)合嵌套分割算法的裝配序列規(guī)劃,在裝配建模的基礎(chǔ)上,生成和評價序列,并利用復(fù)合嵌套分割算法對序列進行優(yōu)化,最后輸出裝配序列。針對裝配序列規(guī)劃的需求,結(jié)合現(xiàn)階段國內(nèi)外裝配建模研究狀況,本文運用裝配信息混合有向圖來建立產(chǎn)品裝配模型。為了求解零件之間的裝配優(yōu)先關(guān)系,采用了干涉矩陣的方法來反映零件的干涉關(guān)系。為了生成裝配序列,利用集成干涉矩陣來求解零件的可行裝配方向,并由此推導(dǎo)出可裝配的零件,從而確立了零件間的先后裝配關(guān)系。分析了裝配序列評價中幾何可行性、裝配方向改變次數(shù)和裝配工具改變次數(shù)這幾個評價指標(biāo),建立了多指標(biāo)的評價函數(shù)。本文利用面向裝配序列規(guī)劃的嵌套分割算法,并融入禁忌搜索算法的思想,提高了嵌套分割算法的局部搜索能力,形成復(fù)合嵌套分割算法,并利用該復(fù)合算法來求解裝配序列規(guī)劃問題。利用Visual C++6.0工具開發(fā)了裝配序列規(guī)劃原型系統(tǒng),系統(tǒng)實現(xiàn)了復(fù)合嵌套分割算法求解裝配序列,并結(jié)合具體的實例驗證了系統(tǒng)的應(yīng)用效果,分析了復(fù)合嵌套分割算法求解的可行性。
[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.
【學(xué)位授予單位】：華中科技大學(xué)
【學(xué)位級別】：碩士
【學(xué)位授予年份】：2015
【分類號】：TG95

【相似文獻】

相關(guān)期刊論文 前10條

1 丁慧敏,李蓓智,周亞琴;基于遺傳算法的裝配序列規(guī)劃[J];東華大學(xué)學(xué)報(自然科學(xué)版);2001年06期

2 鄧明星;唐秋華;雷U，

本文編號：2079453