A Variable Neighborhood Walksat-Based Algorithm for MAX-SAT Problems

Algorithm 2

VNS-WS.

   input: Problem in CNF Format

   output: Number of unsatisfied clauses

(1) /* Determine the set of neighborhood structures    = 1, 2,…, /*;

(2)  0;

(3)  while  (Not reached the desired set of neighborhood)  do

(4)   Construct;

(5)   ;

(6) Generate a random solution from neighborhood;

(7)  ;

(8)  while   do 

(9)   Apply Walksat with as input solution;

(10)     Project();

(11)     ;

(12) Apply Walksat with () as input solution;

(13) return ();