A New Hybrid Genetic Algorithm for the Graph Colouring Problem

Lhassane Idoumghar 1 René Schott 2 Miguel Alabau
1 ISA - Models, algorithms and geometry for computer graphics and vision
INRIA Lorraine, LORIA - Laboratoire Lorrain de Recherche en Informatique et ses Applications
Abstract : This paper presents a new hybrid genetic algorithm for the graph colouring problem. The hybrid genetic algorithm presented in this paper combines an original probabilistic tabu search as a mutation operator, and new crossovers. Results obtained by our algorithm are better than the best known results obtained by other methods : local search, genetic algorithms, hybrid algorithms. Our results are validated in the field of radio broadcasting and compared to the best existing solutions in this domain.
Type de document :
Communication dans un congrès
INRIA Lorraine. 3rd Colloquium on Computational Telecommunications - ALGOTEl'2001, 2001, Saint Jean de Luz, France, 7 p, 2001
Liste complète des métadonnées

https://hal.inria.fr/inria-00100443
Contributeur : Publications Loria <>
Soumis le : mardi 26 septembre 2006 - 14:45:26
Dernière modification le : jeudi 11 janvier 2018 - 06:19:48

Identifiants

  • HAL Id : inria-00100443, version 1

Collections

Citation

Lhassane Idoumghar, René Schott, Miguel Alabau. A New Hybrid Genetic Algorithm for the Graph Colouring Problem. INRIA Lorraine. 3rd Colloquium on Computational Telecommunications - ALGOTEl'2001, 2001, Saint Jean de Luz, France, 7 p, 2001. 〈inria-00100443〉

Partager

Métriques

Consultations de la notice

135