A memetic algorithm with adaptive operator selection for graph coloring - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2024

A memetic algorithm with adaptive operator selection for graph coloring

Résumé

We present a memetic algorithm with adaptive operator selection for k-coloring and weighted vertex coloring. Our method uses online selection to adaptively determine the couple of crossover and local search operators to apply during the search to improve the efficiency of the algorithm. This leads to better results than without the operator selection and allows us to find a new coloring with 404 colors for C2000.9, one of the largest and densest instances of the classical DIMACS coloring benchmarks. The proposed method also finds three new best solutions for the weighted vertex coloring problem. We investigate the impacts of the different algorithmic variants on both problems.
Fichier principal
Vignette du fichier
EVOCOP_2024_AHEAD.pdf (1.14 Mo) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-04457706 , version 1 (14-02-2024)

Identifiants

  • HAL Id : hal-04457706 , version 1

Citer

Cyril Grelier, Olivier Goudet, Jin-Kao Hao. A memetic algorithm with adaptive operator selection for graph coloring. 24th European Conference on Evolutionary Computation in Combinatorial Optimisation, Apr 2024, Aberystwyth, United Kingdom. ⟨hal-04457706⟩
26 Consultations
33 Téléchargements

Partager

Gmail Facebook X LinkedIn More