A Variable Neighborhood Walksat-Based Algorithm for MAX-SAT Problems
The simplicity of the maximum satisfiability problem (MAX-SAT) combined with its applicability in many areas of artificial intelligence and computing science made it one of the fundamental optimization problems. This NP-complete problem refers to the task of finding a variable assignment that satisf...
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Hindawi Limited
2014-01-01
|
| Series: | The Scientific World Journal |
| Online Access: | http://dx.doi.org/10.1155/2014/798323 |
| Summary: | The simplicity of the maximum satisfiability problem (MAX-SAT) combined with its
applicability in many areas of artificial intelligence and computing science made it one of
the fundamental optimization problems. This NP-complete problem refers to the task of
finding a variable assignment that satisfies the maximum number of clauses (or the sum
of weights of satisfied clauses) in a Boolean formula. The Walksat algorithm is considered
to be the main skeleton underlying almost all local search algorithms for MAX-SAT. Most
local search algorithms including Walksat rely on the 1-flip neighborhood structure. This
paper introduces a variable neighborhood walksat-based algorithm. The neighborhood
structure can be combined easily using any local search algorithm. Its effectiveness is
compared with existing algorithms using 1-flip neighborhood structure and solvers
such as CCLS and Optimax from the eighth MAX-SAT evaluation. |
|---|---|
| ISSN: | 2356-6140 1537-744X |