Stochastic Constraint Programming (SCP) is an extension of Constraint Programming for modelling and solving combinatorial problems involving uncertainty. This paper proposes a metaheuristic approach to SCP that can scale up to large problems better than state-of-the-art complete methods, and exploits standard filtering algorithms to handle hard constraints more efficiently. For problems with many scenarios it can be combined with scenario reduction and sampling methods.
CITATION STYLE
Prestwich, S. D., Tarim, S. A., Rossi, R., & Hnich, B. (2015). Hybrid metaheuristics for stochastic constraint programming. Constraints, 20(1), 57–76. https://doi.org/10.1007/s10601-014-9170-x
Mendeley helps you to discover research relevant for your work.