Guiding tree search with local search

Eric Monfroy, Carlos Castro, BRODERICK CRAWFORD LABRIN

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

For Constraint Programming (CP), enumeration strategies (selection of a variable and a value of its domain) are crucial for resolution performances. We propose to use Local Search for guiding enumeration: we extend the common variable selection strategies of CP and we achieve the value selection based on a Local Search. The experimental results are rather promising, both in terms of needed enumerations and in terms of CPU time.

Original languageEnglish
Title of host publicationAnnals of DAAAM for 2009 and Proceedings of the 20th International DAAAM Symposium "Intelligent Manufacturing and Automation
Subtitle of host publicationFocus on Theory, Practice and Education"
PublisherDanube Adria Association for Automation and Manufacturing, DAAAM
Pages1333-1334
Number of pages2
ISBN (Print)9783901509704
StatePublished - 1 Jan 2009
EventAnnals of DAAAM for 2009 and 20th International DAAAM Symposium "Intelligent Manufacturing and Automation: Focus on Theory, Practice and Education" - Vienna, Austria
Duration: 25 Nov 200928 Nov 2009

Publication series

NameAnnals of DAAAM and Proceedings of the International DAAAM Symposium
ISSN (Print)1726-9679

Conference

ConferenceAnnals of DAAAM for 2009 and 20th International DAAAM Symposium "Intelligent Manufacturing and Automation: Focus on Theory, Practice and Education"
CountryAustria
CityVienna
Period25/11/0928/11/09

Keywords

  • Constraint programming
  • Constraint satisfaction problems
  • Local search

Fingerprint Dive into the research topics of 'Guiding tree search with local search'. Together they form a unique fingerprint.

Cite this