Academic Journals Database
Disseminating quality controlled scientific knowledge

A Multilevel Tabu Search for the Maximum Satisfiability Problem

ADD TO MY LIST
 
Author(s): Noureddine Bouhmala | Sirar Salih

Journal: International Journal of Communications, Network and System Sciences
ISSN 1913-3715

Volume: 05;
Issue: 10;
Start page: 661;
Date: 2012;
Original page

Keywords: Maximum Satisfiability Problem | Tabu Search | Multilevel Techniques

ABSTRACT
The maximum satisfiability problem (MAX-SAT) refers to the task of finding a variable assignment that satisfies the maximum number of clauses (or the sum of weight of satisfied clauses) in a Boolean Formula. Most local search algorithms including tabu search rely on the 1-flip neighbourhood structure. In this work, we introduce a tabu search algorithm that makes use of the multilevel paradigm for solving MAX-SAT problems. The multilevel paradigm refers to the process of dividing large and difficult problems into smaller ones, which are hopefully much easier to solve, and then work backward towards the solution of the original problem, using a solution from a previous level as a starting solution at the next level. This process aims at looking at the search as a multilevel process operating in a coarse-to-fine strategy evolving from k-flip neighbourhood to 1-flip neighbourhood-based structure. Experimental results comparing the multilevel tabu search against its single level variant are presented.
Affiliate Program     

Tango Jona
Tangokurs Rapperswil-Jona