Adaptive genetic algorithms guided by decomposition for PCSPs: application to frequency assignment problems - Université de Lorraine Access content directly
Journal Articles Frontiers of Computer Science Year : 2016

Adaptive genetic algorithms guided by decomposition for PCSPs: application to frequency assignment problems

Abstract

This paper proposes Adaptive Genetic Algorithms Guided by structural knowledges coming from decomposition methods, for solving PCSPs. The family of algorithms called AGAGD_x_y is designed to be doubly generic, meaning that any decomposition method and different heuristics for the genetic operators can be considered. To validate the approach, the decomposition algorithm due to Newman was used and several crossover operators based on structural knowledge such as the cluster, separator and the cut were tested. The experimental results obtained on the most challenging Minimum Interference-FAP problems of CALMA instances are very promising and lead to interesting perspectives to be explored in the future.
No file

Dates and versions

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

Identifiers

Cite

Lamia Sadeg-Belkacem, Zineb Habbas, Wassila Aggoune-Mtalaa. Adaptive genetic algorithms guided by decomposition for PCSPs: application to frequency assignment problems. Frontiers of Computer Science, 2016, 10 (6), pp.1012-1025. ⟨10.1007/s11704-016-4552-4⟩. ⟨hal-01784134⟩
31 View
0 Download

Altmetric

Share

Gmail Facebook X LinkedIn More