A multilevel hyper-heuristic for solving Max-SAT
by Mourad Lassouaoui; Dalila Boughaci; Belaid Benhamou
International Journal of Metaheuristics (IJMHEUR), Vol. 6, No. 3, 2017

Abstract: A hyper-heuristic is a high-level method that manages a set of low-level heuristics to solve various problems in a problem-independent manner. In this paper, we propose a new selection hyper-heuristic with the multilevel paradigm. The multilevel paradigm refers to the process of dividing large problems into sub-problems. Each sub-problem is being solved to reach an optimal solution by using the resulting solution from a previous level as a starting solution at the next level. The selection strategy chooses the adequate low-level heuristic at any iteration during the search. For analysis purposes, several variants of hyper-heuristics are implemented and Max-SAT is used as the test bed. The experimental results revealed that the multilevel paradigm together with a new hybrid-heuristic selection mechanism provides a substantial performance improvement. A comparison with two known state of the art algorithms that are GSAT and WALKSAT is given to further show the efficiency of our method.

Online publication date: Thu, 15-Jun-2017

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
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 Metaheuristics (IJMHEUR):
Login with your Inderscience username and password:

    Username:        Password:         

Forgotten your 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