【摘要】：在電子產(chǎn)品制造過(guò)程中,利用先進(jìn)的優(yōu)化技術(shù)對(duì)生產(chǎn)線及其設(shè)備進(jìn)行合理調(diào)度和優(yōu)化控制,是提高生產(chǎn)效率和資源利用率的重要方法。因此,探索和研究表面組裝生產(chǎn)線及其關(guān)鍵設(shè)備——貼片機(jī)優(yōu)化運(yùn)行的相關(guān)理論問(wèn)題及優(yōu)化方法,具有重要的理論意義和應(yīng)用價(jià)值。本論文研究了表面組裝生產(chǎn)過(guò)程中以最小化PCB板組裝生產(chǎn)時(shí)間為目標(biāo)的貼片機(jī)優(yōu)化問(wèn)題。該優(yōu)化問(wèn)題涉及多個(gè)優(yōu)化子問(wèn)題,這些問(wèn)題之間高度關(guān)聯(lián),使得整個(gè)優(yōu)化問(wèn)題非常復(fù)雜和難以求解。因此,在建立問(wèn)題數(shù)學(xué)模型的基礎(chǔ)上,如何設(shè)計(jì)有效的求解算法,縮短貼片機(jī)的貼裝時(shí)間,提高貼片機(jī)和SMT生產(chǎn)線的生產(chǎn)效率,是本文研究的主要內(nèi)容。論文對(duì)目前有關(guān)表面組裝生產(chǎn)優(yōu)化問(wèn)題的研究思路和方法進(jìn)行了系統(tǒng)的分析、分類(lèi)、比較和總結(jié),對(duì)以最小化PCB板組裝時(shí)間的單個(gè)貼片機(jī)優(yōu)化問(wèn)題進(jìn)行了分析,提出了基于協(xié)同進(jìn)化的單機(jī)PCB板組裝時(shí)間問(wèn)題的求解方法。我們將單機(jī)優(yōu)化問(wèn)題分解為多個(gè),并由此建立了二階段的數(shù)學(xué)模型:第一階段建立吸嘴分配的整數(shù)規(guī)劃模型,并運(yùn)用啟發(fā)式的方法進(jìn)行求解。第二階段建立喂料器分配問(wèn)題和元器件拾貼順序問(wèn)題的混合整數(shù)規(guī)劃模型,運(yùn)用協(xié)同進(jìn)化的思想,結(jié)合多智能體進(jìn)化算法的核心思想和局部搜索算法的優(yōu)勢(shì)對(duì)其進(jìn)行求解,最終得出問(wèn)題的最優(yōu)解。
[Abstract]:In the manufacturing process of electronic products, it is an important method to improve the production efficiency and resource utilization rate by using the advanced optimization technology to reasonably schedule and control the production line and its equipment. Therefore, it is of great theoretical significance and application value to explore and study the theoretical problems and optimization methods of the optimal operation of the surface assembly line and its key equipment-the placement machine. In this paper, the optimization problem of the placement machine with the goal of minimizing the production time of PCB board assembly is studied in the process of surface assembly. The optimization problem involves a number of optimization sub-problems, which are highly related to each other, which makes the whole optimization problem very complex and difficult to solve. Therefore, on the basis of establishing the mathematical model of the problem, how to design an effective algorithm to solve the problem, shorten the mounting time of the mounting machine, and improve the production efficiency of the mounting machine and the SMT production line are the main contents of this paper. This paper systematically analyzes, classifies, compares and summarizes the current research ideas and methods on the optimization of surface assembly production, and analyzes the optimization problem of single mount machine with the aim of minimizing the assembly time of PCB board. A co-evolution-based method for solving the assembly time problem of stand-alone PCB boards is presented in this paper. We decompose the single-machine optimization problem into several, and then establish a two-stage mathematical model: in the first stage, the integer programming model of nozzle allocation is established, and the heuristic method is used to solve the problem. In the second stage, the mixed integer programming model of feeder assignment problem and component pick-up sequence problem is established, which is solved by the idea of co-evolution, combined with the core idea of multi-agent evolutionary algorithm and the advantages of local search algorithm. Finally, the optimal solution of the problem is obtained.
【學(xué)位授予單位】：華南理工大學(xué)
【學(xué)位級(jí)別】：碩士
【學(xué)位授予年份】：2015
【分類(lèi)號(hào)】：TN05

【參考文獻(xiàn)】

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

1 周泓;王建;譚小衛(wèi);;一種求解集成生產(chǎn)計(jì)劃的混合協(xié)同進(jìn)化算法[J];計(jì)算機(jī)集成制造系統(tǒng);2007年07期

，

本文編號(hào)：2456627