Chebyshev inequality based approach to chance constrained optimization problems using differential evolution

0Citations
Citations of this article
1Readers
Mendeley users who have this article in their library.
Get full text

Abstract

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.

Cite

CITATION STYLE

APA

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

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free