%0 Journal Article
%T Parallel ant colony algorithm for weighted MAX-SAT<br>并行蚁群算法求解加权MAX-SAT*
%A SUN Ru-xiang
%A TANG Tian-bing
%A LI Bing-hui
%A <br>孙如祥
%A 唐天兵
%A 李炳慧
%J 计算机应用研究
%D 2012
%I 
%X For making the algorithm more direct control, the algorithm more efficient,this paper weighted the characterisics of the MAX-SAT, simplified discrete approach to re-model of ant colony algorithm and proposed the concept of probability values, replaced the traditional elements of pheromone ant colony algorithm, finally made parallel improvements of the algorithm. Experimental results show that the new algorithm is more parallel efficiency,reduces the search time significantly, and achieves good speedup and efficiency.
%K ant colony algorithm
%K speedup
%K parallel
%K maximum satisfiability problem(MAX-SAT)
%K weighted MAX-SAT
%K multi-core<br>蚁群算法
%K 加速比
%K 并行
%K 最大化可满足性问题（MAX-SAT）
%K 加权MAX-SAT
%K 多核
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=5B3AB970F71A803DEACDC0559115BFCF0A068CD97DD29835&cid=8240383F08CE46C8B05036380D75B607&jid=A9D9BE08CDC44144BE8B5685705D3AED&aid=4189763B19B8AD450AD3B1D5453B3690&yid=99E9153A83D4CB11&vid=771469D9D58C34FF&iid=CA4FD0336C81A37A&sid=2A3781E88AB1776F&eid=987EDA49D8A7A635&journal_id=1001-3695&journal_name=计算机应用研究&referenced_num=0&reference_num=8