The k-coloring fitness landscape

Authors:
Hend Bouziri;Khaled Mellouli;El-Ghazali Talbi
Affiliations:
LARODEC-ISG, ESSEC, Tunis, Tunisia;LARODEC-ISG, IHEC, Carthage, Tunisia;LIFL, University of Lille 1, CNRS, INRIA, Lille, France
Venue:
Journal of Combinatorial Optimization
Year:
2011

Citing 3
Cited 0

Local optima topology for the k-coloring problem

Discrete Applied Mathematics - Special volume: viewpoints on optimization
Fitness landscape analysis and memetic algorithms for the quadratic assignment problem

IEEE Transactions on Evolutionary Computation
Multidimensional Knapsack Problem: A Fitness Landscape Analysis

IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics

Quantified Score

Hi-index	0.00

Visualization

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.