本文選題：貼裝路徑優(yōu)化 + 蟻群算法��； 參考：《江蘇大學(xué)》2017年碩士論文

【摘要】：表面貼裝技術(shù)(SMT)是一種先進(jìn)的電子元器件貼裝技術(shù)和工藝,實(shí)現(xiàn)了貼裝產(chǎn)線的自動(dòng)化和智能化,而貼片機(jī)又是該產(chǎn)線中最為關(guān)鍵的自動(dòng)化設(shè)備,直接決定了產(chǎn)線的生產(chǎn)效率和精度。隨著電子產(chǎn)品的輕薄化,對(duì)貼片機(jī)的貼裝效率與精度提出了更高的要求,而貼片機(jī)貼裝路徑又是影響貼裝效率的重要因素之一,故貼片機(jī)的貼裝路徑優(yōu)化具有極其重要的研究意義和應(yīng)用價(jià)值。本文綜合分析了高速貼片機(jī)及其貼裝路徑優(yōu)化的國內(nèi)外研究現(xiàn)狀,并結(jié)合實(shí)際貼裝流程完成了貼裝路徑優(yōu)化的數(shù)學(xué)建模,提出了適合求解貼裝路徑優(yōu)化問題的精英蟻群算法。本文的主要研究?jī)?nèi)容如下:首先,闡述了各類貼片機(jī)的工作原理,分析了垂直旋轉(zhuǎn)式貼片機(jī)的貼裝過程以及貼片頭的旋轉(zhuǎn)流程,總結(jié)了貼裝效率的影響因素,制定了貼裝效率的優(yōu)化目標(biāo),并建立了貼裝路徑優(yōu)化的數(shù)學(xué)模型。其次,分析研究蟻群算法、遺傳算法、模擬退火算法的內(nèi)容及機(jī)理,通過實(shí)驗(yàn)數(shù)據(jù)的對(duì)比分析發(fā)現(xiàn),蟻群算法在求解TSP問題時(shí)優(yōu)勢(shì)突出,為下文貼裝路徑的優(yōu)化,提供了算法支持。然后,結(jié)合貼裝效率的影響因素以及貼裝路徑優(yōu)化的數(shù)學(xué)模型,進(jìn)行了TSP模型的改進(jìn),并在基本蟻群算法的基礎(chǔ)上提出了適合求解貼裝路徑優(yōu)化問題的精英蟻群算法。相對(duì)于基本蟻群算法,精英蟻群算法進(jìn)行如下四點(diǎn)改進(jìn):第一,將復(fù)雜的貼裝路徑問題分解成兩個(gè)相關(guān)聯(lián)的子問題;第二,進(jìn)行貼裝分組,減小了螞蟻的搜索子集范圍;第三,引入精英螞蟻的策略;第四,信息素的更新采用全局與局部相結(jié)合的方式。最后,完成貼裝路徑優(yōu)化算法的編程,分別運(yùn)用精英蟻群算法和基本蟻群算法求解PCB板的貼裝路徑,并采用固高控制卡結(jié)合三維交流閉環(huán)平臺(tái)對(duì)兩種算法所求的最優(yōu)解進(jìn)行模擬貼裝實(shí)驗(yàn)。由實(shí)驗(yàn)數(shù)據(jù)的分析對(duì)比可知,精英蟻群算法可高效地完成垂直旋轉(zhuǎn)式高速貼片機(jī)的貼裝路徑優(yōu)化。
[Abstract]:Surface mount technology (SMT) is an advanced technology and process for mounting electronic components, which realizes the automation and intelligence of the assembly line, and the placement machine is the most important automatic equipment in the production line.It directly determines the production efficiency and precision of the production line.With the thinning of electronic products, higher requirements are put forward for the mounting efficiency and precision of the mounting machine, and the mounting path of the mounting machine is one of the important factors that affect the mounting efficiency.Therefore, the placement path optimization of the placement machine has extremely important research significance and application value.In this paper, the domestic and international research status of high speed mounting machine and its mount path optimization is analyzed synthetically, and the mathematical modeling of mount path optimization is completed in combination with the actual mounting process, and an elite ant colony algorithm suitable for solving the mount path optimization problem is put forward.The main contents of this paper are as follows: firstly, the working principle of all kinds of mounting machine is expounded, the process of mounting and the rotating flow of the chip head are analyzed, and the influencing factors of the mounting efficiency are summarized.The optimization goal of mounting efficiency is established, and the mathematical model of mount path optimization is established.Secondly, the content and mechanism of ant colony algorithm, genetic algorithm and simulated annealing algorithm are analyzed. Through the comparison and analysis of experimental data, it is found that ant colony algorithm has a prominent advantage in solving TSP problem, which is the optimization of the following mount path.Algorithm support is provided.Then, the TSP model is improved based on the factors affecting the mount efficiency and the mathematical model of the mount path optimization. Based on the basic ant colony algorithm, an elite ant colony algorithm is proposed to solve the mount path optimization problem.Compared with the basic ant colony algorithm, the elite ant colony algorithm has four improvements as follows: first, the complex mount path problem is decomposed into two associated sub-problems; second, the colony placement group reduces the searching subset range of ants; third,The strategy of introducing elite ants; fourthly, the pheromone updating adopts the combination of global and local.Finally, the programming of the mount path optimization algorithm is completed, and the Elite Ant Colony algorithm and the basic Ant Colony algorithm are used to solve the mount path of the PCB board, respectively.The fixed height control card combined with three dimensional AC closed loop platform is used to simulate and mount the optimal solution of the two algorithms.From the analysis and comparison of experimental data, it can be seen that Elite Ant Colony algorithm can efficiently optimize the mount path of vertical rotary high speed mounting machine.
【學(xué)位授予單位】：江蘇大學(xué)
【學(xué)位級(jí)別】：碩士
【學(xué)位授予年份】：2017
【分類號(hào)】：TP18;TN405

【參考文獻(xiàn)】

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

1 李洋;劉艷娜;;蟻群算法信息素更新方式的評(píng)價(jià)研究[J];科技創(chuàng)新與生產(chǎn)力;2016年03期

2 董健騰;龍緒明;曹宏耀;呂文強(qiáng);胡少華;朱舜文;曾馳鶴;;貼片機(jī)貼裝路徑優(yōu)化的改進(jìn)遺傳算法[J];電子工業(yè)專用設(shè)備;2015年12期

3 常忠東;;對(duì)模擬退火算法的衰減函數(shù)T和MetrOPolis準(zhǔn)則的改進(jìn)[J];內(nèi)蒙古民族大學(xué)學(xué)報(bào)(自然科學(xué)版);2011年04期

4 梁萬雷;趙鵬;;SMT生產(chǎn)線中貼片機(jī)平衡優(yōu)化方法研究[J];電子工藝技術(shù);2010年03期

5 姜蘭蘭;王峰;;基于Metropolis模擬退火算法的實(shí)現(xiàn)[J];中國科技信息;2007年13期

6 馬立肖;才秀鳳;趙占芳;王楠;;蟻群系統(tǒng)模型的比較及參數(shù)優(yōu)化[J];電腦知識(shí)與技術(shù)(學(xué)術(shù)交流);2007年05期

7 張建航;李國;;模擬退火算法及其在求解TSP中的應(yīng)用[J];現(xiàn)代電子技術(shù);2006年22期

8 劉婭,潘漢軍;激光對(duì)中儀的測(cè)量原理與算法分析[J];光學(xué)儀器;2004年04期

9 曾又姣,金燁;基于遺傳算法的貼片機(jī)貼裝順序優(yōu)化[J];計(jì)算機(jī)集成制造系統(tǒng)-CIMS;2004年02期

10 戴曉暉,李敏強(qiáng),寇紀(jì)淞;遺傳算法理論研究綜述[J];控制與決策;2000年03期

相關(guān)會(huì)議論文 前1條

1 羅愛玲;龍緒明;劉明曉;賀海浪;曹宏耀;董健騰;;基于改進(jìn)交叉算子的貼片機(jī)貼裝順序優(yōu)化[A];2014中國高端SMT學(xué)術(shù)會(huì)議論文集[C];2014年

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

1 杜鑫;貼片機(jī)貼裝優(yōu)化算法研究[D];西安電子科技大學(xué);2013年

2 余大偉;視覺系統(tǒng)在貼片機(jī)貼片頭定位與片狀元件檢測(cè)糾偏中的應(yīng)用研究[D];蘇州大學(xué);2010年

3 曹曼;基于遺傳模擬退火算法的暫態(tài)穩(wěn)定評(píng)估特征選擇[D];華北電力大學(xué)（河北）;2007年

，

本文編號(hào)：1746329