垂直旋转式高速贴片机贴装路径优化研究

发布时间：2018-04-13 21:47

本文选题：贴装路径优化 + 蚁群算法　；参考：《江苏大学》2017年硕士论文

【摘要】：表面贴装技术(SMT)是一种先进的电子元器件贴装技术和工艺,实现了贴装产线的自动化和智能化,而贴片机又是该产线中最为关键的自动化设备,直接决定了产线的生产效率和精度。随着电子产品的轻薄化,对贴片机的贴装效率与精度提出了更高的要求,而贴片机贴装路径又是影响贴装效率的重要因素之一,故贴片机的贴装路径优化具有极其重要的研究意义和应用价值。本文综合分析了高速贴片机及其贴装路径优化的国内外研究现状,并结合实际贴装流程完成了贴装路径优化的数学建模,提出了适合求解贴装路径优化问题的精英蚁群算法。本文的主要研究内容如下:首先,阐述了各类贴片机的工作原理,分析了垂直旋转式贴片机的贴装过程以及贴片头的旋转流程,总结了贴装效率的影响因素,制定了贴装效率的优化目标,并建立了贴装路径优化的数学模型。其次,分析研究蚁群算法、遗传算法、模拟退火算法的内容及机理,通过实验数据的对比分析发现,蚁群算法在求解TSP问题时优势突出,为下文贴装路径的优化,提供了算法支持。然后,结合贴装效率的影响因素以及贴装路径优化的数学模型,进行了TSP模型的改进,并在基本蚁群算法的基础上提出了适合求解贴装路径优化问题的精英蚁群算法。相对于基本蚁群算法,精英蚁群算法进行如下四点改进:第一,将复杂的贴装路径问题分解成两个相关联的子问题;第二,进行贴装分组,减小了蚂蚁的搜索子集范围;第三,引入精英蚂蚁的策略;第四,信息素的更新采用全局与局部相结合的方式。最后,完成贴装路径优化算法的编程,分别运用精英蚁群算法和基本蚁群算法求解PCB板的贴装路径,并采用固高控制卡结合三维交流闭环平台对两种算法所求的最优解进行模拟贴装实验。由实验数据的分析对比可知,精英蚁群算法可高效地完成垂直旋转式高速贴片机的贴装路径优化。
[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.
【学位授予单位】：江苏大学
【学位级别】：硕士
【学位授予年份】：2017
【分类号】：TP18;TN405

【参考文献】