SAT and Hybrid models of the Car-Sequencing problem - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2013

SAT and Hybrid models of the Car-Sequencing problem

Résumé

We improve the state of the art for solving car-sequencing problems by combining together the strengths of SAT and CP. We compare both pure SAT and hybrid CP/SAT models. Three features of these models are crucial to success. For quickly finding solutions, advanced CP heuristics are important and good propagation (either by a specialized propagator or by a sophisticated SAT encoding that simulates one) is necessary. For proving infeasibility, clause learning in the SAT solver is critical. Our models contain a number of other novelties. In our SAT models, we introduce powerful new encodings for the AtMostSeqCard constraint on which unit propagation simulates an AC propagator. In our hybrid models, we develop a novel linear time mechanism for explaining failure in the same constraint. Our study demonstrates some of the potential and complementarity of SAT and hybrid methods for solving complex constraint models.
Fichier principal
Vignette du fichier
13-08-31-SATHybrid-Car-Seq.pdf (272.2 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-00871729 , version 1 (10-10-2013)
hal-00871729 , version 2 (11-10-2013)

Identifiants

  • HAL Id : hal-00871729 , version 2

Citer

Christian Artigues, Emmanuel Hébrard, Valentin Mayer-Eichberger, Mohamed Siala, Toby Walsh. SAT and Hybrid models of the Car-Sequencing problem. Third International Workshop on the Cross-Fertilization Between CSP and SAT, in conjunction with CP 2013, Sep 2013, Uppsala, Sweden. ⟨hal-00871729v2⟩
261 Consultations
400 Téléchargements

Partager

Gmail Facebook X LinkedIn More