Adaptive genetic algorithms guided by decomposition for PCSPs: application to frequency assignment problems - Université de Lorraine Accéder directement au contenu
Article Dans Une Revue Frontiers of Computer Science Année : 2016

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

Résumé

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.
Fichier non déposé

Dates et versions

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

Identifiants

Citer

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⟩
33 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Mastodon Facebook X LinkedIn More