Design of a New Metaheuristic for MAXSAT Problems

Abstract

Metaheuristics are approximate algorithms which effectively and efficiently exploit search space characteristics to find near-optimal solutions. Their combination with CP is also very successful. In this work we present a new metaheuristic for tackling large MAXSAT instances. The algorithm we designed is based on iterated local search strategy and combines the most effective local search strategies for SAT problems