發(fā)布時(shí)間：2018-07-14 14:08

【摘要】：裝配序列規(guī)劃(Assembly Sequence Planning,ASP)問(wèn)題一直是裝配工藝中需要考慮的主要問(wèn)題之一。優(yōu)秀的裝配序列規(guī)劃方案能夠有效減少產(chǎn)品生產(chǎn)裝配過(guò)程中的沖突,提高生產(chǎn)效率,增強(qiáng)企業(yè)的市場(chǎng)應(yīng)變能力,幫助企業(yè)更好地適應(yīng)日益多樣化的市場(chǎng)需求。本文研究了利用離散類電磁機(jī)制(Discrete Electromagnetism-like Mechanism,DEM)算法解決ASP問(wèn)題。 首先,概述了裝配序列規(guī)劃問(wèn)題和類電磁機(jī)制算法及其研究現(xiàn)狀。 其次,介紹了基于連接體的裝配序列規(guī)劃。ASP問(wèn)題屬于組合優(yōu)化問(wèn)題,其復(fù)雜程度隨著所研究對(duì)象的信息數(shù)量水平的提高而大幅度提高。這就使得求解具有一定復(fù)雜度的ASP問(wèn)題時(shí),需要花費(fèi)較多時(shí)間來(lái)尋找合適的最優(yōu)解。為了在考慮更多約束信息的情況下,降低ASP問(wèn)題的復(fù)雜程度,本文在ASP問(wèn)題的建模過(guò)程中引入了連接體概念,有效地降低了ASP問(wèn)題的復(fù)雜程度。 接著,介紹了EM算法的原理,并提出離散EM算法。EM算法是一種基于種群的隨機(jī)全局優(yōu)化方法。該算法通過(guò)模擬電磁場(chǎng)中帶電粒子之間“吸引—排斥”機(jī)制,引導(dǎo)帶電粒子向最優(yōu)點(diǎn)處移動(dòng),因此稱為類電磁機(jī)制算法。ASP問(wèn)題屬于離散問(wèn)題,不適合用傳統(tǒng)EM算法直接求解。本文主要研究了該算法,通過(guò)重新定義解的距離和移動(dòng)、引入記憶機(jī)制、改進(jìn)電量和合力的計(jì)算公式等途徑,將針對(duì)連續(xù)優(yōu)化問(wèn)題的類電磁機(jī)制算法進(jìn)行離散化,后使用該算法解決基于連接體的裝配序列規(guī)劃問(wèn)題。實(shí)驗(yàn)表明,離散類電磁機(jī)制算法與引導(dǎo)式遺傳算法、基因算法和人工免疫算法相比,在求解精度和求解時(shí)間上都有一定優(yōu)勢(shì)。 然后,使用離散EM算法計(jì)算了三個(gè)實(shí)例,通過(guò)與其它優(yōu)化算法的對(duì)比分析,驗(yàn)證了離散EM算法求解ASP問(wèn)題的有效性。 最后,總結(jié)全文。
[Abstract]:Assembly sequence planning is one of the main problems in assembly process. The excellent assembly sequence planning scheme can effectively reduce the conflicts in the process of product production and assembly, improve the production efficiency, enhance the market adaptability of enterprises, and help enterprises better adapt to the increasingly diverse market demand. In this paper, the application of discrete electromagnetic mechanism (discrete electromagnetic mechanism) to solve ASP problem is studied. First, the assembly sequence planning problem, electromagnetic mechanism algorithm and its research status are summarized. Secondly, it is introduced that the assembly sequence planning based on connectors. ASP is a combinatorial optimization problem, and its complexity increases greatly with the increase of the information quantity level of the objects studied. In order to solve the ASP problem with certain complexity, it takes more time to find the appropriate optimal solution. In order to reduce the complexity of ASP problems, the concept of connectors is introduced into the modeling process of ASP problems, which effectively reduces the complexity of ASP problems. Then, the principle of EM algorithm is introduced, and the discrete EM algorithm. EM algorithm is a stochastic global optimization method based on population. By simulating the mechanism of "attraction and repulsion" between charged particles in electromagnetic field, this algorithm can lead charged particles to move to the best point. Therefore, the problem called electromagnetic mechanism algorithm. ASP is a discrete problem, which is not suitable to be solved directly by traditional EM algorithm. This paper mainly studies this algorithm. By redefining the distance and movement of the solution, introducing the memory mechanism, improving the calculation formula of electric quantity and resultant force, the algorithm of electromagnetic mechanism for continuous optimization problem is discretized. Then the algorithm is used to solve the assembly sequence planning problem based on connectors. The experimental results show that the discrete electromagnetic mechanism algorithm has some advantages in solving precision and time compared with the leading genetic algorithm, genetic algorithm and artificial immune algorithm. Then, three examples are calculated by using the discrete EM algorithm, and the effectiveness of the discrete EM algorithm in solving ASP problem is verified by comparing with other optimization algorithms. Finally, the full text is summarized.
【學(xué)位授予單位】：華中科技大學(xué)
【學(xué)位級(jí)別】：碩士
【學(xué)位授予年份】：2011
【分類號(hào)】：TH182

【參考文獻(xiàn)】

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

1 于宏;王成恩;于嘉鵬;袁輝;;基于粒子群算法的復(fù)雜產(chǎn)品裝配序列規(guī)劃[J];東北大學(xué)學(xué)報(bào)(自然科學(xué)版);2010年02期

2 王敏;葉碧蓮;;基于粒子群算法的裝配規(guī)劃研究[J];軍民兩用技術(shù)與產(chǎn)品;2008年01期

3 石淼，唐朔飛，李明樹;裝配序列規(guī)劃研究綜述[J];計(jì)算機(jī)研究與發(fā)展;1994年06期

4 馮禹,馬玉林,蔡鶴皋;基于人工神經(jīng)網(wǎng)絡(luò)技術(shù)的產(chǎn)品可裝配性評(píng)價(jià)[J];計(jì)算機(jī)集成制造系統(tǒng)-CIMS;2000年04期

5 史士財(cái);李榮;付宜利;馬玉林;;基于改進(jìn)蟻群算法的裝配序列規(guī)劃[J];計(jì)算機(jī)集成制造系統(tǒng);2010年06期

6 張剛;殷國(guó)富;鄧克文;成爾京;;基于知識(shí)的裝配序列規(guī)劃方法研究[J];機(jī)械科學(xué)與技術(shù);2006年03期

7 周開俊;李東波;潘洋宇;;基于遺傳退火算法的復(fù)雜產(chǎn)品裝配序列規(guī)劃方法[J];機(jī)械科學(xué)與技術(shù);2006年03期

8 王東云,胡寧,楊文源,朱劍英;機(jī)器人自動(dòng)裝配的神經(jīng)網(wǎng)絡(luò)規(guī)劃方法[J];機(jī)械科學(xué)與技術(shù);1997年05期

9 周開俊;李東波;黃希;;基于遺傳算法的裝配序列規(guī)劃研究[J];機(jī)械設(shè)計(jì);2006年02期

10 陳天凡;湯文成;;基于干涉矩陣的裝配序列規(guī)劃[J];機(jī)械制造與自動(dòng)化;2007年01期

相關(guān)博士學(xué)位論文 前1條

1 王峻峰;分布環(huán)境下的協(xié)同裝配序列規(guī)劃[D];華中科技大學(xué);2004年

相關(guān)碩士學(xué)位論文 前2條

1 曹玉君;基于遺傳算法的裝配序列規(guī)劃研究[D];國(guó)防科學(xué)技術(shù)大學(xué);2004年

2 王曉娟;類電磁機(jī)制算法及其若干應(yīng)用研究[D];華中科技大學(xué);2006年

，

本文編號(hào)：2121890