Title :
Noisy GA Resampling on Evolved Parameterized Policies for Stochastic Constraint Programming
Author :
Tian, Jing ; Murata, Tomohiro
Author_Institution :
Grad. Sch. of Inf., Production & Syst., Waseda Univ., Kitakyushu, Japan
Abstract :
Stochastic Constraint Programming is an extension of Constraint Programming for modeling and solving combinatorial problems which involve uncertainty in real world. Evolved Parameterized Policies (EPP) is the first incomplete approach to stochastic constraint problems which has higher performance rather than other methods, but still seems non-practical for large multi-stage problems due to scenarios exponentially growing. We proposed new resampling method called IDGAS based on Noisy GAs and other Evolutionary Computation algorithms, which aim to ensure the reliability while keeping in high search performance. In experiments on credit portfolio management with multi-stage, it performed more effective than conventional EPP and other resampling methods.
Keywords :
constraint handling; genetic algorithms; investment; sampling methods; search problems; EPP; IDGAS; combinatorial problems; credit portfolio management; evolutionary computation algorithms; evolved parameterized policies; high search performance; increasing decreasing greedy averaged sampling; large multi-stage problems; noisy GA resampling; stochastic constraint problems; stochastic constraint programming; Biological cells; Genetic algorithms; Noise measurement; Portfolios; Programming; Reliability; Stochastic processes; Evolved Parameterized Policies; Noisy GA; Resampling/Sampling; Stochastic Constraint Programming;
Conference_Titel :
Computer Science & Service System (CSSS), 2012 International Conference on
Conference_Location :
Nanjing
Print_ISBN :
978-1-4673-0721-5
DOI :
10.1109/CSSS.2012.362