Abstract

In this paper, a new approach to solve Chance Constrained Problems (CCPs) using huge data sets is proposed. Specifically, instead of the conventional mathematical model, a huge data set is used to formulate CCP. This is because such a large data set is available nowadays due to advanced information technologies. Since the data set is too large to evaluate the probabilistic constraint of CCP, a new data reduction method called Weighted Stratified Sampling (WSS) is proposed to describe a relaxation problem of CCP. An adaptive Differential Evolution combined with a pruning technique is also proposed to solve the relaxation problem of CCP efficiently. The performance of WSS is compared with a well known method, Simple Random Sampling. Then, the proposed approach is applied to a real-world application, namely the flood control planning formulated as CCP.

Highlights

  • In real-world applications, a wide range of uncertainties have to be taken into account

  • The proposed approach is applied to a real-world application, namely the flood control planning formulated as Chance Constrained Problems (CCPs) [5]

  • If the inflow of water is estimated through a complex mathematical computation taking hours [36] or the amount of rainfall is predicted from a huge weather data set [37], we must realize the advantage of the pruning technique that surely reduces the run time of Adaptive DE (ADE) without harming the quality of the obtained solution

Read more

Summary

Introduction

In real-world applications, a wide range of uncertainties have to be taken into account. In many real-world applications, the variance of observed data is caused by some uncertainties These applications are probably formulated as CCP more accurately by using a large data set instead of the mathematical model. By using the new data reduction method called WSS, the above CCP based on the full data set is converted into a relaxation problem of CCP. In order to solve the relaxation problem of CCP efficiently, a new optimization method based on Differential Evolution (DE) [18] is contrived in this paper. It is shown that the theoretical sample size is too large in practice; (2) By using larger data sets, the performance of WSS is examined more intensively by comparison with SRS.

Problem Formulation
Equivalence Problem of CCP
Data Reduction Methods
Procedure of SRS
Theoretical Sample Size
Procedure of WSS
Sample Generation by WSS
Relaxation Problems of CCP
Adaptive Differential Evolution with Pruning Technique
Strategy of DE
Adaptive Control of Parameters
Constraint Handling and Pruning Technique in Selection
Proposed Algorithm of ADEP
Performance Evaluation of WSS
Case Study 1
Case Study 2
Case Study 3
Formulation of CCP
Comparison of SRS and WSS
Solution of CCP
Performance Evaluation of ADEP
Conclusions
Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call