Analysis of Memetic Approaches for Graph Coloring Problem
Résumé
Some real life problems can be modeled as a graph coloring problem. The main idea consists of partitioning all vertices into k independent sets. The best known approaches consist of hybridize genetic algorithm with a local search in a memetic way. One of the key feature is to find the best balance between intensification and diversification. In this work we present an analyze of the influence of the main parameters (population size, number of parents for crossover, number of local search iterations, ...) on the balance intensification/diversification.