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 optimization.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

摘要： 在拱架式贴片机的贴装过程中，元器件的贴装顺序和喂料器的分配是影响拱架式贴片机贴装效率的主要因素。根据实际的贴装过程，建立了拱架式贴片机的集成优化模型。在问题求解上，将贴片机的贴装优化问题分解为两个子问题，分别利用禁忌算法进行喂料器分配优化和改进的混合蛙跳算法对元器件贴装顺序进行优化;通过迭代协调思想，将相互联系的两个问题分而求解再相互协调，最终实现贴片机贴装过程的优化。为验证算法有效性，以10块实际生产的PCB为实例进行了测试。实验结果表明，该算法能获得较好的贴片机贴装优化解，与混合遗传算法（HGA）相比，平均效率提高了9.55%。

关键词: 禁忌算法, 混合蛙跳算法, 喂料器分配优化, 元器件贴装顺序优化