The $k$-coloring fitness landscape - Inria - Institut national de recherche en sciences et technologies du numérique Accéder directement au contenu
Article Dans Une Revue Journal of Combinatorial Optimization Année : 2011

The $k$-coloring fitness landscape

Résumé

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.

Dates et versions

hal-00836736 , version 1 (21-06-2013)

Identifiants

Citer

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⟩
75 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More