计算机应用研究2012，Vol.29Issue(1)：49-51,3.DOI:10.3969/j.issn.1001-3695.2012.01.013
并行蚁群算法求解加权MAX-SAT
Parallel ant colony algorithm for weighted MAX-SAT
摘要
Abstract
For making the algorithm more direct control, the algorithm more efficient, this paper weighted the characterises 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.关键词
蚁群算法/加速比/并行/最大化可满足性问题(MAX-SAT)/加权MAX-SAT/多核Key words
ant colony algorithm/ speedup/ parallel/ maximum satisfiability problem( MAX-SAT) / weighted MAX-SAT/multi-core分类
信息技术与安全科学引用本文复制引用
孙如祥,唐天兵,李炳慧..并行蚁群算法求解加权MAX-SAT[J].计算机应用研究,2012,29(1):49-51,3.基金项目
国家自然科学基金资助项目(50605010) （50605010）
广西教育厅科研资助项目(200911LX15) （200911LX15）
广西大学科研资助项目(XJZ110585) （XJZ110585）
