基于表面贴装分配的改进型禁忌搜索算法  

Improved Taboo Search Algorithm Based on Surface Mounting Arrangement

作　　者：罗汶锋[1] 罗家祥[1] 

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

出　　处：《计算机工程》2011年第13期288-290,共3页Computer Engineering

基　　金：国家自然科学青年基金资助项目(60835001;60804053);教育部博士点基金资助项目(200805611065);中央高校基本科研业务费科研专项基金资助项目

摘　　要：针对表面贴装分配的路径优化问题,提出改进型的禁忌搜索(TS)算法,实现印刷电路板排序与元器件分配的优化。该算法在传统TS算法的基础上融合序优化算法与分散型kick移动策略。序优化算法的应用弥补了TS算法对初始解具有较大依赖性的不足,而分散型kick移动策略的引入则加强了TS算法的全局搜索能力。实验结果表明,该算法在表面贴装路径优化问题的应用上优于一般的TS算法。This paper focuses on Printed Circuit Board（PCB） and their components arrangement optimization problem,which includes two tasks： the sequencing of PCB and the assignment of components on PCB to different mounting machines.A taboo search with kick strategy is proposed to solve the problem that ordinal optimization is applied to obtain a favorable initial solution.It compensates for the dependence on the initial solution of taboo search and contributes to obtain a better result in a large possibility.Kick strategy is embedded into taboo search,and the global search ability of the algorithm is greatly strengthened.Experimental result shows that the algorithm is effective for solving the PCB and their components arrangement optimization problem

关 键 词：表面贴装分配 禁忌搜索 序优化 kick策略 

分 类 号：TP301.6[自动化与计算机技术—计算机系统结构]