Skip to Main content Skip to Navigation
Conference papers

Analysis of Memetic Approaches for Graph Coloring Problem

Abstract : 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.
Document type :
Conference papers
Complete list of metadata
Contributor : Laurence Porte Connect in order to contact the contributor
Submitted on : Friday, May 16, 2014 - 4:16:54 PM
Last modification on : Tuesday, October 19, 2021 - 11:02:48 AM


  • HAL Id : hal-00992266, version 1



Alexandre Gondran, Laurent Moalic. Analysis of Memetic Approaches for Graph Coloring Problem. EURO-INFORMS 2013, 26th European Conference on Operational Research, Jul 2013, Rome, Italy. ⟨hal-00992266⟩



Les métriques sont temporairement indisponibles