Dynamic Cooperative Search for constraint satisfaction and combinatorial optimization : application to a rostering problem - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2007

Dynamic Cooperative Search for constraint satisfaction and combinatorial optimization : application to a rostering problem

Christian Artigues
Eric Bourreau

Résumé

In this paper, we are interested in enumerative resolution methods for combinatorial optimization (COP) and constraint satisfaction problems (CSP). We introduce a new approch for the management of branching, called Dynamic Cooperative Search (DCS) inspired from the impact-based search method proposed in Refalo (2004) for CSPs. This method defines in a dynamic way priority rules for variable and value selection in the branching scheme. These rules are meant to be independent of the considered problem. As in Refalo (2004), the principle is to take into account, through learning methods, of the impact of branching decisions in already explored subparts of the search tree. We show the interest of DCS on a real-life rostering problem.
Fichier principal
Vignette du fichier
bontoux-feillet-artigues-bourreau.pdf (74.58 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-00196145 , version 1 (12-12-2007)

Identifiants

  • HAL Id : hal-00196145 , version 1

Citer

Boris Bontoux, Dominique Feillet, Christian Artigues, Eric Bourreau. Dynamic Cooperative Search for constraint satisfaction and combinatorial optimization : application to a rostering problem. 3rd Multidisciplinary International Conference on Scheduling: Theory and Application, Aug 2007, Paris, France. pp.557-560. ⟨hal-00196145⟩
230 Consultations
86 Téléchargements

Partager

Gmail Facebook X LinkedIn More