基于蚁群算法的PCB组装过程优化

PCB Assembly Optimization Based on Ant Colony Algorithm

摘要: 在转塔式贴片机的印制电路板(PCB)组装过程中，元件贴装顺序和装载有不同类型元件的供料器在供料架上的布置是影响转塔式贴片机贴装时间的主要因素。在分析实际工程应用的基础上，建立了转塔式贴片机上PCB组装的集成优化模型，对蚁群算法进行了改进，提出了相互通信的最大–最小蚂蚁算法，用两种不同职能的蚂蚁相互协作，以元件组装顺序来驱动供料器布置，引导蚂蚁实现元件贴装顺序的优化，而执行蚂蚁根据引导蚂蚁选择元件的结果来实现供料器布置优化。算法可对元件贴装顺序和供料器的布置进行同时优化，从而提高转塔式贴片机上PCB组装的效率。最后通过实例验证了算法的有效性。

Abstract: The component placement sequence and feeder arrangement are the critical factors determining assembly time of chip shooter (CS) machine. In addition, the different size of component and different arrangement strategy affect the feeder arrangement and component placement sequence. Based on the engineering analysis, an integrated optimization model of printed circuit board (PCB) assembly for CS machine is established. According to the parallel placement character of CS machine, “Max-Min Ant Colony Algorithm with Communication function” is designed based on traditional Ant Colony Algorithm. The idea that two ants with different duties collaborate to solve the optimization problem is presented. Guide ants optimize placement sequence while executant ants optimize feeder arrangement according to the components placement sequence. The component placement sequence and feeder arrangement are optimized simultaneously.