A Hyperheuristic Approach to Select Enumeration Strategies in Constraint Programming

Crawford B., Montecinos M., Castro C., Monfroy E.

9th WSEAS International Conference on Applied Informatics and Communications, Moscow, Rusya, 20 - 22 Ağustos 2009, ss.460-462 identifier

  • Yayın Türü: Bildiri / Tam Metin Bildiri
  • Basıldığı Şehir: Moscow
  • Basıldığı Ülke: Rusya
  • Sayfa Sayıları: ss.460-462
  • İstanbul Teknik Üniversitesi Adresli: Hayır

Özet

In this work we exploit search process features to dynamically adapt a Constraint Programming solver in order to more efficiently solve Constraint Satisfaction Problems. Our proposal uses a hyperheuristic to decide adaptation possibilities. The main novelty of our approach is that we reconfigure the search based solely on performance data gathered while solving the current problem. We report encouraging results where our combination of strategies outperforms the use of individual strategies.