Combining graph decomposition techniques and metaheuristics for solving PCSPs. Application to MI-FAP
by Lamia Sadeg-Belkacem; Zineb Habbas; Wassila Aggoune-Mtalaa; Fatima Benbouzid-Si Tayeb
International Journal of Reasoning-based Intelligent Systems (IJRIS), Vol. 8, No. 3/4, 2016

Abstract: This paper presents a study towards a framework for solving discrete optimisation problems modelled as partial constraint satisfaction problems (PCSPs). These studies follow two approaches, namely a bottom-up, and a top-down one. Three decomposition methods and an adaptive genetic algorithm (AGA) are associated with these approaches. The experimental results obtained for MI-FAP problems show a good trade-off between the quality of the solution and the execution time of the different algorithms.

Online publication date: Fri, 17-Mar-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 Reasoning-based Intelligent Systems (IJRIS):
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