一种可满足模理论的拟物优化求解算法  

An Algorithm for Quasi Physical Optimization of Satisfying Modular Theory

作　　者：卢道设[1] LU Daoshe(School of Information Engineering,Guangzhou Huaxia Vocational College,Guangzhou,China,510935)

机构地区：[1]广州华夏职业学院信息工程学院,广州510935

出　　处：《福建电脑》2021年第7期23-26,共4页Journal of Fujian Computer

摘　　要：为了研究改善可满足性模理论的求解效率,本文基于拟物方法结合萤火虫优化算法,设计出新的优化求解方案。实验结果表明,使用萤火虫优化算法求解可满足性问题在特定应用案例上效果显著,基于Benchmarks(可满足模理论求解器公开基准测试案例库)的基准测试案例中求解效率平均比纯拟物拟人算法上提高至少10%的性能。基于拟物方法结合最优化算法在特定领域的可满足性求解算法不仅容易实现,同时能有效提高求解效率。In order to improve the solution efficiency of the theory of Satisfiability module,a new optimization solution is designed in this paper.The experimental results show that using firefly optimization algorithm to solve the satisfiability problem is effective in specific application cases.In the benchmark case,the efficiency of the algorithm is 10% higher than that of the pure quasi physical and anthropomorphic algorithms.The algorithm in this paper is not only easy to implement in the specific domain of satisfiability,but also can effectively improve the efficiency of solving.

关 键 词：拟物拟人算法 可满足模理论 萤火虫优化算法 SAT 最优化算法 

分 类 号：TP391[自动化与计算机技术—计算机应用技术]