Algorithmes évolutionnaires et résolution de problèmes de satisfaction de contraintes en domaines finis

Abstract : This thesis deals with the use of evolutionary algorithms (EA) to solve constraint satisfaction problems (CSP) in finite domains, without any particular specialization nor hybridization. Having presented the CSP and general methods used to solve them (chapters 1 and 2), we present the evolutionary paradigm and its applications (chapters 3 and 4). Then, we propose a comparison between the tree search methods and metaheuristics on over-constrained graph coloring, in a context of minimal regulation of the parameters (chapter 5). We study the research landscape for understanding the reasons of the differences in efficiency of methods. Finally, we propose new genetic operators (crossover, mutation, diversification), the parameter setting of which is less difficult than with the classical operators (chapter 6). We conclude on the interest of investigating the neutrality networks.
Document type :
Theses
Automatic. Université Nice Sophia Antipolis, 2002. French


https://tel.archives-ouvertes.fr/tel-00505450
Contributor : Estelle Nivault <>
Submitted on : Friday, July 23, 2010 - 4:54:46 PM
Last modification on : Wednesday, April 15, 2015 - 4:09:51 PM

Identifiers

  • HAL Id : tel-00505450, version 1

Collections

Citation

Blaise Madeline. Algorithmes évolutionnaires et résolution de problèmes de satisfaction de contraintes en domaines finis. Automatic. Université Nice Sophia Antipolis, 2002. French. <tel-00505450>

Export

Share

Metrics

Consultation de
la notice

285

Téléchargement du document

112