Component Placement Process Optimization for Multi-Head Surface Mounting Machine Based on Tabu Search and Improved Shuffled Frog-Leaping Algorithm

This paper considers the SMT placement process optimization problem to minimize the assembly time of Multi-head surface mounting machine (SMM).A mathematical model is firstly established.Considering that the component pick-and-place sequencing and the feeder assignment are the two main important factors which determine the assembly time of a device,the optimization problem is divided into two sub-problems,called feeder assignment sub-problem and the component pick-place sequencing sub-problem.Then the tabu search algorithm and the improved shuffled frog leaping algorithm with mutation are applied to optimize the two sub-problems respectively.Finally,according to the thoughts of iteration and cooperation,the two interrelated sub-problems could be cooperated with each other to improve the efficiency of optimization.To verify the efficiency of the algorithm,experiments on 10 PCBs instances are executed.Experimental results show that the algorithm could obtain satisfied quasi-optimal solutions to the mounting process,and it makes an improvement 9.55% on the hybrid genetic algorithm reported in literature.