Accéder directement au contenu Accéder directement à la navigation
Nouvelle interface
Communication dans un congrès

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.
Type de document :
Communication dans un congrès
Liste complète des métadonnées

https://hal-enac.archives-ouvertes.fr/hal-00992266
Contributeur : Laurence Porte Connectez-vous pour contacter le contributeur
Soumis le : vendredi 16 mai 2014 - 16:16:54
Dernière modification le : mardi 19 octobre 2021 - 11:02:48

Identifiants

  • HAL Id : hal-00992266, version 1

Citation

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⟩

Partager

Métriques

Consultations de la notice

75