.png){kind=icon}
.png){kind=icon}
Return
ISSATA: An algorithm for solving the 3-satisfiability problem based on improved strategy
.png){kind=icon}
PRE
AI
DOI：10.1007/s10489-021-02493-1.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Stochastic local search algorithm with configuration check strategy can effectively solve random satisfiability instances, so configuration check strategy is widely used in combinatorial optimization problems. Inspired by this, we proposed an ISSATA algorithm to solve the 3-satisfiability problem. In this algorithm, a new initialization strategy is given, which can assign initial values to variables more efficiently. At the same time, a new variable selection strategy and a new neighbor priority strategy are proposed to improve the performance of selecting flipped variables. Comparative experiments conducted in public datasets show that ISSATA has better solution accuracy and efficiency.
Keywords:
Combinatorial optimization
Heuristic algorithm
Satisfiability problem
Stochastic local search
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.