arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1306.5070cs.AIcs.NE
收藏

3-SAT问题一种新的模因粒子群算法

3-SAT Problem A New Memetic-PSO Algorithm

EMU University(东地中海大学)

Nasser Lotfi, Jamshid Tamouk, Mina Farmanbar

摘要:

3-SAT问题在许多科学和技术应用中具有重要意义。本文提出了一种新的混合进化算法来解决这个可满足性问题。3-SAT问题具有巨大的搜索空间,因此被称为NP难问题。因此,确定性方法不适用于这种情况。因此,应用进化处理方法,特别是粒子群算法,将是解决这类问题的有效方法。本文介绍了一种新的进化优化技术,基于粒子群算法,Memetic算法和局部搜索方法。当一些竞争力混合时,它们的优势也被收集起来,我们可以达到更好的结果。最后,我们测试我们提出的算法在一些基准使用的一些其他可用的算法。实验结果表明,该方法在适当的时间内可以得到较好的结果。与现有的纯遗传算法和一些经过验证的算法相比,取得了较好的效果

英文摘要:

3-SAT problem is of great importance to many technical and scientific applications. This paper presents a new hybrid evolutionary algorithm for solving this satisfiability problem. 3-SAT problem has the huge search space and hence it is known as a NP-hard problem. So, deterministic approaches are not applicable in this context. Thereof, application of evolutionary processing approaches and especially PSO will be very effective for solving these kinds of problems. In this paper, we introduce a new evolutionary optimization technique based on PSO, Memetic algorithm and local search approaches. When some heuristics are mixed, their advantages are collected as well and we can reach to the better outcomes. Finally, we test our proposed algorithm over some benchmarks used by some another available algorithms. Obtained results show that our new method leads to the suitable results by the appropriate time. Thereby, it achieves a better result in compared with the existent approaches such as pure genetic algorithm and some verified types

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑