Combining graph decomposition techniques and metaheuristics for solving PCSPs. Application to MI-FAP

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.
Document type :
Journal articles
Complete list of metadatas

https://hal.univ-lorraine.fr/hal-01784141
Contributor : Lcoms Ul <>
Submitted on : Thursday, May 3, 2018 - 9:36:10 AM
Last modification on : Thursday, February 7, 2019 - 3:04:28 PM

Identifiers

Collections

Citation

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

Share

Metrics

Record views

50