基于RLS的用于贴片机贴装顺序优化的禁忌搜索算法  

RLS-Based Tabu Search Algorithm for Mounting Sequence Optimization of Surface Mounting Machines

作　　者：罗家祥[1] 罗树浩[1] 吴忻生[1] 

机构地区：[1]华南理工大学自动化科学与工程学院,广东广州510640

出　　处：《华南理工大学学报（自然科学版）》2012年第3期74-80,共7页Journal of South China University of Technology(Natural Science Edition)

基　　金：国家自然科学基金资助项目(60804053;60835001);教育部博士点基金资助项目(200805611065);华南理工大学中央高校基本科研业务费专项资金资助项目(2009ZM0122)

摘　　要：对元器件的拾取与贴装顺序进行优化是提高电子组装生产线上贴片机贴装效率的主要方法.在给定喂料器位置的前提下,寻求好的元器件拾取与贴装顺序,可以缩短贴装路径,提高贴装效率.为此,文中建立了数学规划模型,提出了一种基于参考解局部搜索(RLS)的改进禁忌搜索算法.在算法中,采用了双禁忌表来避免迂回搜索,设计了基于取贴循环插入移动的参考解局部搜索策略以提高算法跳出局部最优的能力.对20个印刷电路板贴装数据的仿真实验表明,文中所提算法的求解效果优于现有方法.The optimization of component picking and mounting sequences is a major way of improving the efficiency of surface mounting machine in electronic assembly line.Seeking good component picking and mounting sequences with a given feeder allocation is helpful in minimizing the mounting distance and in improving the mounting efficiency.In this paper,a mathematical programming model is established and an improved tabu search algorithm based on the referenced local search（RLS） is proposed.In the algorithm,double tabu lists are designed to avoid circuitous search,and a RLS strategy based on the inserting of mounting cycles is implemented to improve the algorithm＇s ability of escaping local optima.Experiments are also carried out on the mounting data for 20 printed circuit boards.The results show that the proposed algorithm outperforms the existing one since it achieves better solutions.

关 键 词：表面贴装技术 贴装顺序优化 禁忌搜索 参考解局部搜索 

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