A Comparative Runtime Analysis of Heuristic Algorithms for Satisfiability Problems

Yuren Zhou, Jun He, Qing Nie

Allbwn ymchwil: Cyfraniad at gyfnodolynErthygladolygiad gan gymheiriaid

29 Dyfyniadau (Scopus)

Crynodeb

The satisfiability problem is a basic core NP-complete problem. In recent years, a lot of heuristic algorithms have been developed to solve this problem, and many experiments have evaluated and compared the performance of different heuristic algorithms. However, rigorous theoretical analysis and comparison are rare. This paper analyzes and compares the expected runtime of three basic heuristic algorithms: RandomWalk, (1+1) EA, and hybrid algorithm. The runtime analysis of these heuristic algorithms on two 2-SAT instances shows that the expected runtime of these heuristic algorithms can be exponential time or polynomial time. Furthermore, these heuristic algorithms have their own advantages and disadvantages in solving different SAT instances. It also demonstrates that the expected runtime upper bound of RandomWalk on arbitrary k-SAT (kgreater-or-equal, slanted3) is O((k−1)n), and presents a k-SAT instance that has Θ((k−1)n) expected runtime bound.
Iaith wreiddiolSaesneg
Tudalennau (o-i)240-257
Nifer y tudalennau18
CyfnodolynArtificial Intelligence
Cyfrol173
Rhif cyhoeddi2
Dyddiad ar-lein cynnar07 Tach 2008
Dynodwyr Gwrthrych Digidol (DOIs)
StatwsCyhoeddwyd - Chwef 2009

Ôl bys

Gweld gwybodaeth am bynciau ymchwil 'A Comparative Runtime Analysis of Heuristic Algorithms for Satisfiability Problems'. Gyda’i gilydd, maen nhw’n ffurfio ôl bys unigryw.

Dyfynnu hyn