计算机工程与应用2011，Vol.47Issue(26)：14-17,4.DOI:10.3778/j.issn.1002-8331.2011.26.005
禁忌搜索-混合蛙跳算法的贴片机优化
Optimization for multi-head surface mounting machine based on tabu search and shuffled frog-leaping algorith
摘要
Abstract
The component placement sequence and feeder arrangement are the important factors determining assembly time of the multi-head surface mounting device.A mathematical model is specifically established for the multi-head surface mounting machine to minimize the assembly time.Firstly the SMT placement process optimization problem is divided into two sub-problems, then Tabu Search(TS) algorithm and the shuffled frog leaping algorithm with mutation are used to optimize feeder assignment and the component placement sequence respectively.Finally according to the thoughts of iteration and cooperation, two interrelated sub-problems should be linked and incorporated with each other to improve the efficiency of optimi-zation.To verify the efficiency of the algorithm, experimens on 10 PCBs instances are executed.Experimental results show that the algorithm can obtain satisfied quasi-optimal solutions to the mounting process, and it makes an improvement 9.55% on the Hybrid Genetic Algorithm(HGA) reported in literature.关键词
禁忌算法/混合蛙跳算法/喂料器分配优化/元器件贴装顺序优化Key words
tabu search algorithm/shuffled frog-leaping algorithm/feeder assignment/component mounting sequence optimization分类
信息技术与安全科学引用本文复制引用
陈铁梅,罗家祥..禁忌搜索-混合蛙跳算法的贴片机优化[J].计算机工程与应用,2011,47(26):14-17,4.基金项目
国家自然科学基金(the National Natural Science Foundation of China under Grant No.60804053) （the National Natural Science Foundation of China under Grant No.60804053）
教育部博-点基金(No.200805611065). （No.200805611065）
