Reactive search, a history-sensitive heuristic for MAX-SAT
Journal of Experimental Algorithmics (JEA)
A Parallel GRASP for MAX-SAT Problems
PARA '96 Proceedings of the Third International Workshop on Applied Parallel Computing, Industrial Computation and Optimization
Scatter Search with Random Walk Strategy for SAT and MAX-W-SAT Problems
Proceedings of the 14th International conference on Industrial and engineering applications of artificial intelligence and expert systems: engineering of intelligent systems
Context-Independent Scatter and Tabu Search for Permutation Problems
INFORMS Journal on Computing
Hybrid of genetic algorithm and local search to solve MAX-SAT problem using nVidia CUDA framework
Genetic Programming and Evolvable Machines
ABSO: advanced bee swarm optimization metaheuristic and application to weighted MAX-SAT problem
BI'11 Proceedings of the 2011 international conference on Brain informatics
Efficient and experimental meta-heuristics for MAX-SAT problems
WEA'05 Proceedings of the 4th international conference on Experimental and Efficient Algorithms
| Hi-index | 0.00 |
In the last three decades, many researchers have focused on the Satisfiability problem and on many of its variants, in particular, on the Weighted Maximum Satisfiability problem (Max-W-Sat). The latter is known to be difficult to solve, due to a high number of local minima present in its search space. In this Work, we present a metaheuristic based on Taboo search (TS) procedure that makes use of the Scatter search (SS) paradigm. Our objective is to support a TS by a SS add-on to explore the influence of a population and combination strategies on the ability of generating high quality solutions.