Combining graph decomposition techniques and metaheuristics for solving PCSPs. Application to MI-FAP - Université de Lorraine Access content directly
Journal Articles International Journal of Reasoning-based Intelligent Systems Year : 2016

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.
No file

Dates and versions

hal-01784141 , version 1 (03-05-2018)

Identifiers

Cite

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), pp.104-118. ⟨10.1504/IJRIS.2016.082960⟩. ⟨hal-01784141⟩
51 View
0 Download

Altmetric

Share

Gmail Facebook X LinkedIn More