Project : coprin

Section: New Results

Resolution of constraints satisfaction problem in finite fields

Another research axis is systems solving in finite domains. Although our main effort focus on problems with continuous domain variables, finite domains may have some interest for many application fields.

Genetic Algorithms for graph coloring problems

Keywords : genetic algorithm , genetic operator , graph coloring .

Participants : Blaise Madeline, Bertrand Neveu.

In his PhD thesis [13], Blaise Madeline has addressed the use of evolutionary algorithms (EA) to solve constraint satisfaction problems in finite domains, without any particular specialization nor hybridization. A comparison between tree search methods and meta-heuristics on over-constrained graph coloring, in a context of minimal tuning of the parameters was proposed. The search landscape was studied for understanding why the various methods have so different efficiency. Finally, a new genetic operators (crossover, mutation, diversification) with a parameter setting simpler than the classical operators was introduced.