Value Interchangeability In Scenario Generation

CP'13: Proceedings of the 19th International Conference on Principles and Practice of Constraint Programming(2013)

引用 6|浏览16
暂无评分
摘要
Several types of symmetry have been identified and exploited in Constraint Programming, leading to large reductions in search time. We present a novel application of one such form of symmetry: detecting dynamic value interchangeability in the random variables of a 2-stage stochastic problem. We use a real-world problem from the literature: finding an optimal investment plan to strengthen a transportation network, given that a future earthquake probabilistically destroys links in the network. Detecting interchangeabilities enables us to bundle together many equivalent scenarios, drastically reducing the size of the problem and allowing the exact solution of cases previously considered intractable and solved only approximately.
更多
查看译文
关键词
Mixed Integer Programming, Stochastic Program, Constraint Programming, Constraint Satisfaction Problem, Stochastic Dominance
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要