Méthodes à divergences pour la résolution de problèmes de satisfaction de contraintes et d'optimisation combinatoire

Wafa Karoui 1
1 LAAS-MOGISA
LAAS - Laboratoire d'analyse et d'architecture des systèmes [Toulouse]
Abstract : In this PhD thesis, we study several tree search methods for solving CSPs and focus on the discrepancy concept (a discrepancy is a deviation from the first choice of the heuristic). In this context, we propose improving mechanisms for general methods. These mechanisms take benefits from conflicts and guide the search by weighting the variables and the values. We propose also special mechanisms for methods based on discrepancies as the discrepancies restriction, the discrepancies counting, and the discrepancies positions. All propostions are validated by experiments done on real and random CSPs. We compare variants of methods based on discrepancies integrating several combinations of imrprovements and other methods known for their efficiency. In a second part, we extend our propositions to an optimisation context considering scheduling problems with time lags. In this purpose, we adapt a discrepancy-based method, Climbing Discrepancy Search, to solve these problems. Efficiency of some improved variants of this method is tested on known benchmarks.
Document type :
Theses
Automatic. INSA de Toulouse, 2010. French


https://tel.archives-ouvertes.fr/tel-00538672
Contributor : Arlette Evrard <>
Submitted on : Monday, November 29, 2010 - 4:01:31 PM
Last modification on : Monday, June 22, 2015 - 10:20:32 AM

Identifiers

  • HAL Id : tel-00538672, version 1

Citation

Wafa Karoui. Méthodes à divergences pour la résolution de problèmes de satisfaction de contraintes et d'optimisation combinatoire. Automatic. INSA de Toulouse, 2010. French. <tel-00538672>

Export

Share

Metrics

Consultation de
la notice

122

Téléchargement du document

248