《计算机应用研究》|Application Research of Computers

置信传播和模拟退火相结合求解约束满足问题

Combining belief propagation and simulated annealing to solve random satisfaction problems

免费全文下载 (已被下载 次)  
获取PDF全文
作者 吴拨荣,赵春艳,原志强
机构 上海理工大学 理学院,上海 200093
统计 摘要被查看 次,已被下载
文章编号 1001-3695(2019)05-004-1297-05
DOI 10.19734/j.issn.1001-3695.2017.11.0790
摘要 约束满足问题是人工智能领域的一个重要问题。针对一个具有精确相变现象和能产生大量难解实例的随机约束满足问题,提出了置信传播和模拟退火相结合的求解算法。这种算法先通过置信传播方程收敛后得到变量取值的边际概率分布,分别采用最大概率和最小分量熵的策略产生一组启发式的初始赋值,再用模拟退火对这组赋值进行修正。实验结果表明,该算法大大提高了初始赋值向最优解收敛的速度,表现出了显著优越于模拟退火算法的求解性能。
关键词 RB模型; 相变现象; 置信传播; 模拟退火; 算法效率
基金项目 国家自然科学基金青年基金资助项目(11301339)
国家自然科学基金国际(地区)合作与交流项目(11491240108)
本文URL http://www.arocmag.com/article/01-2019-05-004.html
英文标题 Combining belief propagation and simulated annealing to solve random satisfaction problems
作者英文名 Wu Borong, Zhao Chunyan, Yuan Zhiqiang
机构英文名 College of Science,University of Shanghai for Science & Technology,Shanghai 200093,China
英文摘要 Constraint satisfaction problem is an important issue in the field of artificial intelligence. This paper proposed two algorithms combining belief propagation and simulated annealing to solve a random constraint satisfaction problem with exact phase transitions and large number of hard instances. The algorithms firstly obtained the marginal probability distribution of variable values after the convergence of the belief propagation equation, then used the strategy of maximum probability and minimum component entropy to generate a set of heuristic initial assignments, and then used simulated annealing to modify the assignments. The experimental results show that the algorithms greatly improve the convergence rate from the initial assignments toward the optimal solution, and shows a significant advantage over simulated annealing algorithm.
英文关键词 RB model; phase transition; belief propagation; simulated annealing; algorithm efficiency
参考文献 查看稿件参考文献
 
收稿日期 2017/11/29
修回日期 2018/1/16
页码 1297-1301
中图分类号 TP301.6
文献标志码 A