A new approach to solve Chance Constrained Optimization Problem (CCOP) without using the Monte Carlo simulation is proposed. Specifically, the prediction interval based on Chebyshev inequality is used to estimate a stochastic function value included in CCOP from a set of samples. By using the prediction interval, CCOP is transformed into Upper-bound Constrained Optimization Problem (UCOP). The feasible solution of UCOP is proved to be feasible for CCOP. In order to solve UCOP efficiently, a modified Differential Evolution (DE) combined with three sample-saving techniques is also proposed. Through the numerical experiments, the usefulness of the proposed approach is demonstrated.
CITATION STYLE
Tagawa, K., & Fujita, S. (2017). Chebyshev inequality based approach to chance constrained optimization problems using differential evolution. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 10385 LNCS, pp. 440–448). Springer Verlag. https://doi.org/10.1007/978-3-319-61824-1_48
Mendeley helps you to discover research relevant for your work.