本文選題：貼片機(jī)路徑優(yōu)化 + 啟發(fā)式算法�。� 參考：《北京交通大學(xué)》2017年碩士論文

【摘要】：隨著智能化時(shí)代的到來,電子產(chǎn)品對貼裝生產(chǎn)的要求越來越高,傳統(tǒng)的貼片機(jī)優(yōu)化策略已滿足不了生產(chǎn)優(yōu)化的需要,故有必要提出新的優(yōu)化算法滿足當(dāng)前生產(chǎn)的需求。本文以某企業(yè)的SMT生產(chǎn)線優(yōu)化為研究對象,針對目前拱架式結(jié)構(gòu)貼片機(jī)雙機(jī)系統(tǒng)的生產(chǎn)負(fù)荷分配不均、單機(jī)貼裝行走路徑較長與上料器排布欠優(yōu)的問題,提出了針對生產(chǎn)線的雙機(jī)分配整數(shù)規(guī)劃模型,并構(gòu)建了針對單機(jī)的直接啟發(fā)式算法,采用模塊集成方式結(jié)合上述算法實(shí)現(xiàn)對整條生產(chǎn)線的優(yōu)化。首先,本文深入研究了拱架式結(jié)構(gòu)的貼片機(jī)的結(jié)構(gòu)特點(diǎn)和貼裝過程,針對貼片機(jī)的單機(jī)優(yōu)化問題展開了研究,分別采用遺傳模擬退火算法、分區(qū)精確求解算法和直接啟發(fā)式算法對貼片機(jī)單機(jī)優(yōu)化求解。經(jīng)過求解對比實(shí)驗(yàn)發(fā)現(xiàn),分區(qū)精確求解結(jié)果要比遺傳模擬退火算法的優(yōu)化程度提高約19%,但分區(qū)精確求解有集成性差、求解時(shí)間長、對分區(qū)啟發(fā)依賴性強(qiáng)的缺點(diǎn);直接啟發(fā)式較分區(qū)精確求解的優(yōu)化程度相差約為5%,但直接啟發(fā)式有求解時(shí)間短、算法集成性好的優(yōu)點(diǎn);同樣,在不同規(guī)模下直接啟發(fā)式比遺傳模擬退火算法有求解結(jié)果更優(yōu)、求解效率高、實(shí)用性更強(qiáng)的特點(diǎn)。通過算法間的比較,在貼片機(jī)單機(jī)優(yōu)化方面選取直接啟發(fā)式算法。其次,在對SMT生產(chǎn)線的雙機(jī)任務(wù)分配的研究中,建立了針對雙機(jī)的任務(wù)分配模型;由于數(shù)學(xué)模型含非線性因素,在原模型的基礎(chǔ)上實(shí)現(xiàn)了模型線性化,且給出了線性化無損證明;給出了雙機(jī)分配的求解測試與分析,表明了該方法的實(shí)用性。最終,本文實(shí)現(xiàn)了對優(yōu)化結(jié)果的可視化,并對可視化模塊與算法模塊進(jìn)行封裝打包,且開發(fā)了軟件的人機(jī)交互界面。其中,軟件集成實(shí)現(xiàn)了輸入文件的標(biāo)準(zhǔn)化,調(diào)用了 Cplex求解雙機(jī)任務(wù)分配的整數(shù)規(guī)劃模型,采用了直接啟發(fā)式算法對已分配的單機(jī)優(yōu)化問題求解,并實(shí)現(xiàn)了各機(jī)求解結(jié)果的可視化。軟件試運(yùn)行采取不同規(guī)模的PCB數(shù)據(jù)測試,經(jīng)過對軟件運(yùn)行結(jié)果的分析,表明本文方法能在雙機(jī)系統(tǒng)中實(shí)現(xiàn)較為均衡的任務(wù)分配,并且對任務(wù)分配后的單機(jī)貼裝路徑能實(shí)現(xiàn)很好的優(yōu)化。
[Abstract]:With the advent of the age of intelligence, the demand for the production of electronic products is becoming more and more high. The traditional patch machine optimization strategy can not meet the needs of production optimization. Therefore, it is necessary to put forward a new optimization algorithm to meet the needs of the current production. This paper takes the SMT production line of an enterprise as the research object, aiming at the present arch type structure patch. The production load distribution of the machine and double machine system is not equal, the single machine mounting path is long and the feeder is not excellent. A two machine allocation integer programming model for the production line is put forward, and a direct heuristic algorithm for single machine is constructed, and the optimization of the whole production line is realized by combining the module integration method with the above algorithm. First, the optimization of the whole production line is realized. In this paper, the structure characteristics and the mounting process of the patch machine of the arch type structure are deeply studied. In view of the single machine optimization problem of the patch machine, the genetic simulated annealing algorithm is used, the partition precision solving algorithm and the direct heuristic algorithm are used to solve the single machine in the single machine. The optimization degree of the genetic simulated annealing algorithm is about 19% higher than that of the genetic simulated annealing algorithm, but the exact solution has the disadvantage of poor integration, long time and strong dependence on the partition heuristic. The difference between the direct heuristic and the optimal solution is about 5%, but the direct heuristic has the advantages of short time and good integration of the algorithm. The direct heuristic is better than the genetic simulated annealing algorithm, which is more efficient and more practical. Through the comparison of the algorithms, the direct heuristic algorithm is selected for the single machine optimization of the patch machine. Secondly, in the study of the dual task allocation of the SMT production line, a task allocation model for the double machine is established. Because of the nonlinear factors in the mathematical model, the model linearization is realized on the basis of the original model, and the linearized nondestructive proof is given. The solution test and analysis of the double machine allocation is given, which shows the practicability of the method. Finally, this paper realizes the visualization of the optimization results and encapsulates the visual module and the algorithm module. The software integration has developed the human-computer interaction interface of the software. Among them, the software integration realizes the standardization of the input files, calls the integer programming model of Cplex to solve the dual task assignment, and uses the direct heuristic algorithm to solve the distributed single machine optimization problem and realizes the visualization of the results of each machine. The scale of PCB data test, after the analysis of the results of the software operation, shows that this method can achieve a more balanced task allocation in the dual machine system, and the single machine placement path after the task allocation can be well optimized.
【學(xué)位授予單位】：北京交通大學(xué)
【學(xué)位級別】：碩士
【學(xué)位授予年份】：2017
【分類號(hào)】：TN405

【參考文獻(xiàn)】

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

1 郭姝娟;張曉慶;靳志宏;;考慮吸嘴切換的多品種印刷電路板組裝優(yōu)化[J];大連海事大學(xué)學(xué)報(bào);2016年04期

2 王文舉;;蟻群算法求解旅行商問題及實(shí)現(xiàn)[J];電腦編程技巧與維護(hù);2014年05期

3 臧明相;杜鑫;李斌;;基于分層混合蛙跳的多頭貼片機(jī)貼裝調(diào)度算法[J];計(jì)算機(jī)集成制造系統(tǒng);2013年11期

4 張則強(qiáng);胡俊逸;程文明;;求解帶區(qū)域約束的雙邊裝配線平衡問題的一種改進(jìn)蟻群算法[J];現(xiàn)代制造工程;2013年04期

5 張潔;張朋;劉國寶;;基于兩階段蟻群算法的帶非等效并行機(jī)的作業(yè)車間調(diào)度[J];機(jī)械工程學(xué)報(bào);2013年06期

6 陳鐵梅;羅家祥;杜娟;胡躍明;;帶擾動(dòng)和變異因子的改進(jìn)禁忌搜索算法求解貼片機(jī)貼裝過程優(yōu)化[J];控制與決策;2013年03期

7 劉鵬;姜偉;劉新妹;殷俊齡;;基于螞蟻算法的PCB板路徑優(yōu)化研究[J];電子世界;2012年03期

8 陳鐵梅;羅家祥;胡躍明;;基于蟻群-遺傳算法的貼片機(jī)喂料器分配優(yōu)化研究[J];控制與決策;2011年06期

9 許文丹;張坤;姜建國;臧明相;何慧森;;基于蟻群算法的貼片機(jī)貼裝路徑優(yōu)化[J];價(jià)值工程;2010年25期

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

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

1 羅家祥;李小龍;劉海明;胡躍明;;電子表面貼裝生產(chǎn)線優(yōu)化數(shù)學(xué)模型研究[A];第二十九屆中國控制會(huì)議論文集[C];2010年

，

本文編號(hào)：2113215