Skip to Main content Skip to Navigation
Journal articles

A cooperative search method for the $k$-coloring problem

Abstract : In this paper, a cooperative search method, based on a multi-agent structure is developed to deal with the $k$-coloring problem. Three agents coordinate using an adaptive memory, a search agent, an intensification agent and a diversification agent. We use the results of a preliminary fitness landscape study to adjust the navigation strategy in the solution space and to fix the search parameters. Our method provides competitive results and it is fast when compared with best existing techniques on instances extracted from the second DIMACS challenge.
Document type :
Journal articles
Complete list of metadata
Contributor : Talbi El-Ghazali <>
Submitted on : Friday, June 21, 2013 - 3:16:21 PM
Last modification on : Monday, June 7, 2021 - 2:40:03 PM

Links full text



Hind Bouziri, El-Ghazali Talbi, Khaled Mellouli. A cooperative search method for the $k$-coloring problem. Journal of Mathematical Modelling and Algorithms, Springer Verlag, 2008, 7 (2), pp.125-142. ⟨10.1007/s10852-008-9081-1⟩. ⟨hal-00836812⟩



Record views