A Distributed Hybrid Algorithm for the Graph Coloring Problem - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2015

A Distributed Hybrid Algorithm for the Graph Coloring Problem

Résumé

We propose a multi-agent based Distributed Hybrid algorithm for the Graph Coloring Problem (DH-GCP). DH-GCP applies a tabu search procedure with two different neighborhood structures for its intensification. To diversify the search into unexplored promising regions, two crossover operators and two types of perturbation moves are performed. All these search components are managed by a multi-agent model which uses reinforcement learning for decision making. The performance of the proposed algorithm is evaluated on well-known DIMACS benchmark instances.
Fichier principal
Vignette du fichier
Sghir2016.pdf (187.24 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-01449584 , version 1 (16-06-2021)

Licence

Paternité

Identifiants

Citer

Ines Sghir, Jin-Kao Hao, Inès Ben Jaâfar, Khaled Ghédira. A Distributed Hybrid Algorithm for the Graph Coloring Problem. International Conference on Artificial Evolution, 2015, Lyon, France. pp.205-218, ⟨10.1007/978-3-319-31471-6_16⟩. ⟨hal-01449584⟩

Collections

UNIV-ANGERS LERIA
35 Consultations
70 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More