Skip to Main content Skip to Navigation
New interface
Journal articles

The $k$-coloring fitness landscape

Abstract : This paper deals with the fitness landscape analysis of the $k$-coloring problem. We study several standard instances extracted from the second DIMACS benchmark. Statistical indicators are used to investigate both global and local structure of fitness landscapes. An approximative distance on the $k$-coloring space is proposed to perform these statistical measures. Local search operator trajectories on various landscapes are then studied using the time series analysis. Results are used to better understand the behavior of metaheuristics based on local search when dealing with the graph coloring problem.
Document type :
Journal articles
Complete list of metadata
Contributor : TALBI El-Ghazali Connect in order to contact the contributor
Submitted on : Friday, June 21, 2013 - 2:26:56 PM
Last modification on : Thursday, January 20, 2022 - 5:27:50 PM

Links full text



Hind Bouziri, Khaled Mellouli, El-Ghazali Talbi. The $k$-coloring fitness landscape. Journal of Combinatorial Optimization, 2011, 21, pp.306-329. ⟨10.1007/s10878-009-9249-2⟩. ⟨hal-00836736⟩



Record views