改进禁忌搜索算法的贴片机贴装过程优化  

Component placement process optimization for multi-head surface mounting machine based on improved tabu search algorithm

作　　者：陈铁梅[1,2] 罗家祥[2] 

机构地区：[1]广东商学院信息学院,广州510320 [2]华南理工大学,精密电子制造装备教育部工程研究中心,自动化科学与工程学院,广州510640

出　　处：《计算机工程与应用》2012年第17期31-35,共5页Computer Engineering and Applications

基　　金：国家自然科学基金(No.61105081)

摘　　要：以多贴装头拱架式贴片机为研究对象,利用带块变异算子的改进禁忌算法实现实贴片机贴装过程的优化。在基本禁忌算法的基础上,利用块变异因子扩大元器件贴装顺序优化的搜索空间,并在禁忌搜索过程中利用局部迭代搜索实现喂料器的分配优化。为验证算法有效性,以10块实际生产的PCB为实例进行了测试。实验证明,提出的算法能获得更好的贴片机贴装优化解。This paper describes an improved tabu search algorithm for the multi-head surface mounting machine. The algorithm is based on the traditional tabu search algorithm, adopting a mutation operator to expand the search place. A local descent search strategy is embedded into the algorithm to optimize the feeder assignment. To verify the efficiency of the algorithm, experiments on 10 PCBs instances are executed. Experimental results show that the proposed algorithm is superior in terms of solution quality.

关 键 词：禁忌搜索算法 块变异算子 喂料器分配优化 元器件贴装顺序优化 

分 类 号：TP202[自动化与计算机技术—检测技术与自动化装置]