A variable neighbourhood search structure based-genetic algorithm for combinatorial optimisation problems
by Noureddine Bouhmala
International Journal of Intelligent Systems Technologies and Applications (IJISTA), Vol. 15, No. 2, 2016

Abstract: In this paper, a variable-neighbourhood-genetic-based-algorithm is proposed for the MAX-SAT problem. Most of the work published earlier on variable neighbourhood search (VNS) starts from the first neighbourhood and moves on to higher neighbourhoods without controlling and adapting the ordering of neighbourhood structures. The order in which the neighbourhood structures have been proposed during the search process in this work enables the genetic algorithm with a better mechanism for performing diversification and intensification. A set of benchmark problem instances is used to compare the effectiveness of the proposed algorithm against the standard genetic algorithm. We also report promising results when the proposed algorithm is compared with state-of-the-art solvers.

Online publication date: Tue, 10-May-2016

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 Intelligent Systems Technologies and Applications (IJISTA):
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