Evolving parameterised policies for stochastic constraint programming

Research output: Chapter in Book/Report/Conference proceedingsChapterpeer-review

Abstract

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 solution methods have been proposed but none seems practical for large multi-stage problems. We propose an incomplete approach: specifying a policy tree indirectly by a parameterised function, whose parameter values are found by evolutionary search. On some problems this method is orders of magnitude faster than a state-of-the-art scenario-based approach, and it also provides a very compact representation of policy trees.

Original languageEnglish
Title of host publicationPrinciples and Practice of Constraint Programming - CP 2009 - 15th International Conference, CP 2009, Proceedings
Pages684-691
Number of pages8
DOIs
Publication statusPublished - 2009
Event15th International Conference on Principles and Practice of Constraint Programming, CP 2009 - Lisbon, Portugal
Duration: 20 Sep 200924 Sep 2009

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume5732 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference15th International Conference on Principles and Practice of Constraint Programming, CP 2009
Country/TerritoryPortugal
CityLisbon
Period20/09/0924/09/09

Fingerprint

Dive into the research topics of 'Evolving parameterised policies for stochastic constraint programming'. Together they form a unique fingerprint.

Cite this