Stochastic Constraint Programming by Neuroevolution with Filtering

Creative Commons License

Prestwich S. D., TARIM Ş. A., Rossi R., HNİCH B.

7th International Conference Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, Bologna, İtalya, 14 - 18 Haziran 2010, cilt.6140, ss.282-283 identifier identifier

  • Yayın Türü: Bildiri / Tam Metin Bildiri
  • Cilt numarası: 6140
  • Doi Numarası: 10.1007/978-3-642-13520-0_30
  • Basıldığı Şehir: Bologna
  • Basıldığı Ülke: İtalya
  • Sayfa Sayıları: ss.282-283
  • Hacettepe Üniversitesi Adresli: Evet

Özet

Stochastic Constraint Programming is an extension of Constraint Programming for modelling and solving combinatorial problems involving uncertainty. A solution to such a problem is a policy tree that specifies decision variable assignments in each scenario. Several complete solution methods have been proposed, but the authors recently showed that an incomplete approach based on neuroevolution is more scalable. In this paper we hybridise neuroevolution with constraint filtering on hard constraints, and show both theoretically and empirically that the hybrid can learn more complex policies more quickly.