A new greedy randomised adaptive search procedure for solving the maximum satisfiability problem Online publication date: Tue, 29-Jul-2014
by Abdesslem Layeb
International Journal of Operational Research (IJOR), Vol. 17, No. 4, 2013
Abstract: The maximum satisfiability problem (Max-Sat) is one of the most known variant of satisfiability problems. The objective is to find the best assignment for a set of Boolean variables that gives the maximum of verified clauses in a Boolean formula. Unfortunately, this problem was showed NP-complete if the number of variable per clause is higher than 3. In this paper, a new incomplete algorithm based on a greedy randomised adaptive search procedure (GRASP) is presented to deal with Max 3-Sat problem. The first GRASP's phase is a new greedy algorithm based on iterative application of a new version of pure literal elimination technique called weighted literal elimination. In the next stage of the GRASP algorithm, a modified version of the Walksat procedure is applied using, as initial solutions, the solutions found by the greedy procedure of the GRASP algorithm. The obtained results are very encouraging and show the feasibility and effectiveness of the proposed approach.
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Operational Research (IJOR):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email subs@inderscience.com
Our Blog 
Follow us on Twitter 
Visit us on Facebook