%0 Journal Article
%T Mounting sequence optimization on surface mounting machine using ant-colony algorithm and shuffled frog-leaping algorithm<br>基于蚁群–混合蛙跳算法的贴片机贴装顺序优化
%A CHEN Tie-mei
%A LUO Jia-xiang
%A HU Yue-ming
%A <br>陈铁梅
%A 罗家祥
%A 胡跃明
%J 控制理论与应用
%D 2011
%I 
%X The component mounting sequence optimization of the surface mounting machine is considered under the condition that the feeder allocations are known. A new mathematical model of mounting sequence is specifically built for arch surface mounting machines. Based on the characteristics of searching for the optimal path, a new hybrid algorithm of ant-colony algorithm merged with the shuffled frog-leaping algorithm is proposed to solve the problem. According to the actual mounting situation, a few improved methods are proposed in the algorithm, such as the segmented heuristic function, the segmented pheromone, and the pheromone update strategy. To verify the efficiency of the algorithm, component mounting experiments of 20 printed-circuit-boards(PCBs) are tested. The results show the algorithm has higher accuracy in solving the problem, and in searching the optimal path. It provides an improvement in average efficiency 7.89% over the single shuffled frog-leaping algorithm, and 3.79% over the single ant-colony algorithm.
%K component mounting sequence optimization
%K ant-colony algorithm
%K shuffled frog-leaping algorith<br>贴装顺序优化
%K 蚁群算法
%K 混合蛙跳算法
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=5B3AB970F71A803DEACDC0559115BFCF0A068CD97DD29835&cid=8240383F08CE46C8B05036380D75B607&jid=970898A57DFC021F93AB51667BAED7F7&aid=21567333E5794BF582BB925B96804374&yid=9377ED8094509821&vid=D3E34374A0D77D7F&iid=59906B3B2830C2C5&sid=D217FECA03012AA9&eid=5A8DDE4CFC853172&journal_id=1000-8152&journal_name=控制理论与应用&referenced_num=0&reference_num=0