Improving probability learning based local search for graph coloring

Abstract :

This paper presents an improved probability learning based local search algorithm for the well-known graph coloring problem. The algorithm iterates through three distinct phases: a starting coloring generation phase based on a probability matrix, a heuristic coloring improvement phase and a learning based probability updating phase. The method maintains a dynamically updated probability matrix which specifies the chance for a vertex to belong to each color group. To explore the specific feature of the graph coloring problem where color groups are interchangeable and to avoid the difficulty posed by symmetric solutions, a group matching procedure is used to find the group-to-group correspondence between a starting coloring and its improved coloring. Additionally, by considering the optimization phase as a black box, we adopt the popular tabu search coloring procedure for the coloring improvement phase. We show extensive computational results on the well-known DIMACS benchmark instances and comparisons with state-of-the-art coloring algorithms.

Liste complète des métadonnées
Contributeur : Okina Université d'Angers <>
Soumis le : lundi 12 février 2018 - 15:47:33
Dernière modification le : lundi 19 mars 2018 - 10:26:32




Yangming Zhou, Béatrice Duval, Jin-Kao Hao. Improving probability learning based local search for graph coloring. Applied Soft Computing, 2018, 65, pp.542-553. 〈〉. 〈10.1016/j.asoc.2018.01.027〉. 〈hal-01707180〉



Consultations de la notice