Intensification/Diversification-Driven ILS for a Graph Coloring Problem
Résumé
This paper presents an extension of the ILS algorithm, called ID-ILS, by introducing new local search devices that enforce an efficient tradeoff of intensification and diversification. Experiments performed on the DIMACS benchmarks show that our method is competitive with the best coloring algorithms.
| Origine | Fichiers produits par l'(les) auteur(s) |
|---|