A Scatter Search Variant to Solve max-SAT Problems
نویسندگان
چکیده
In this work, a new scatter search-based approach is studied for the NP-Hard satisfiability problems, in particular for its optimization version namely max-SAT. The paper describes a scatter search algorithm enhanced with a tabu search component combined with a uniform crossover operator. The latter is used to identify promising search regions while tabu search performs an intensified search of solutions around these regions. Our objective is to achieve a good compromise between intensification and diversification in the search process. Empirical tests are performed on DIMACS benchmark instances. Numerical results show a considerable performance in favor of our new approach. keywords: scatter search, tabu search, max-SAT, metaheurictics, hybridization.
منابع مشابه
Scaling and Probabilistic Smoothing: Dynamic Local Search for Unweighted MAX-SAT
In this paper, we study the behaviour of the Scaling and Probabilistic Smoothing (SAPS) dynamic local search algorithm on the unweighted MAXSAT problem. MAX-SAT is a conceptually simple combinatorial problem of substantial theoretical and practical interest; many application-relevant problems, including scheduling problems or most probable explanation finding in Bayes nets, can be encoded and s...
متن کاملBackbone Guided Local Search for Maximum Satisfiability
Maximum satisfiability (Max-SAT) is more general and more difficult to solve than satisfiability (SAT). In this paper, we first investigate the effectiveness of Walksat, one of the best local search algorithms designed for SAT, on Max-SAT. We show that Walksat is also effective on Max-SAT, while its effectiveness degrades as the problem is more constrained. We then develop a novel method that e...
متن کاملOn SAT Modulo Theories and Optimization Problems
Solvers for SAT Modulo Theories (SMT) can nowadays handle large industrial (e.g., formal hardware and software verification) problems over theories such as the integers, arrays, or equality. Here we show that SMT approaches can also efficiently solve problems that, at first sight, do not have a typical SMT flavor. In particular, here we deal with SAT and SMT problems where models M are sought s...
متن کاملComparative Studies of Constraint
Maximum satissability (MAX-SAT) is an extension of satissability (SAT), in which a partial solution is sought that satisses the maximum number of clauses in a logical formula. Enumerative methods giving guaranteed optimal solutions can be derived from traditional search algorithms used to solve SAT problems, in particular the Davis-Putnam procedure. Algorithms have also been developed for the m...
متن کاملSolving MAX-XOR-SAT Problems with Stochastic Local Search
The MAX-SAT problem is to find a truth assignment that satisfies the maximum number of clauses in a finite set of logical clauses. In the special case of MAX-XOR-SAT, arising from Linear Cryptanalysis, each clause is a set of literals joined by exclusive-or (xor). Solving MAX-XOR-SAT is useful in finding keys to decrypt intercepted encrypted messages. This report presents and evaluates Xor-Walk...
متن کامل