Scenario-Based Distributionally Robust Unit Commitment Optimization Involving Cooperative Interaction with Robots.

Inf Syst Front

Graduate School of Information, Production and Systems, Waseda University, Kitakyushu, 808-0135 Japan.

Published: September 2022

With the increasing penetration of renewable energy, uncertainty has become the main challenge of power systems operation. Fortunately, system operators could deal with the uncertainty by adopting stochastic optimization (SO), robust optimization (RO) and distributionally robust optimization (DRO). However, choosing a good decision takes much experience, which can be difficult when system operators are inexperienced or there are staff shortages. In this paper, a decision-making approach containing robotic assistance is proposed. First, advanced clustering and reduction methods are used to obtain the scenarios of renewable generation, thus constructing a scenario-based ambiguity set of distributionally robust unit commitment (DR-UC). Second, a DR-UC model is built according to the above time-series ambiguity set, which is solved by a hybrid algorithm containing improved particle swarm optimization (IPSO) and mathematical solver. Third, the above model and solution algorithm are imported into robots that assist in decision making. Finally, the validity of this research is demonstrated by a series of experiments on two IEEE test systems.

Download full-text PDF

Source
http://www.ncbi.nlm.nih.gov/pmc/articles/PMC9472199PMC
http://dx.doi.org/10.1007/s10796-022-10335-9DOI Listing

Publication Analysis

Top Keywords

distributionally robust
12
robust unit
8
unit commitment
8
system operators
8
robust optimization
8
ambiguity set
8
optimization
5
scenario-based distributionally
4
robust
4
commitment optimization
4

Similar Publications

Integrative analysis of data from multiple sources is critical to making generalizable discoveries. Associations consistently observed across multiple source populations are more likely to be generalized to target populations with possible distributional shifts. In this paper, we model the heterogeneous multi-source data with multiple high-dimensional regressions and make inferences for the maximin effect (Meinshausen, Bühlmann, AoS, 43(4), 1801-1830).

View Article and Find Full Text PDF

FairDRO: Group fairness regularization via classwise robust optimization.

Neural Netw

February 2025

Department of Electrical and Computer Engineering, Seoul National University, Seoul, 08826, South Korea; ASRI/INMC/IPAI/AIIS, Seoul National University, Seoul, 08826, South Korea. Electronic address:

Existing group fairness-aware training methods fall into two categories: re-weighting underrepresented groups according to certain rules, or using regularization terms such as smoothed approximations of fairness metrics or surrogate statistical quantities. While each category has its own strength in applicability or performance when compared to each other, their successful performances are typically limited to specific cases. To that end, we propose a new approach called FairDRO, which takes advantage of both categories through a classwise group distributionally robust optimization (DRO) framework.

View Article and Find Full Text PDF

In distributed learning systems, robustness threat may arise from two major sources. On the one hand, due to distributional shifts between training data and test data, the trained model could exhibit poor out-of-sample performance. On the other hand, a portion of working nodes might be subject to Byzantine attacks, which could invalidate the learning result.

View Article and Find Full Text PDF

Rank aggregation with pairwise comparisons is widely encountered in sociology, politics, economics, psychology, sports, etc. Given the enormous social impact and the consequent incentives, the potential adversary has a strong motivation to manipulate the ranking list. However, the ideal attack opportunity and the excessive adversarial capability cause the existing methods to be impractical.

View Article and Find Full Text PDF

The multiple-choice knapsack problem (MCKP) is a classic NP-hard combinatorial optimization problem. Motivated by several significant real-world applications, this work investigates a novel variant of MCKP called the chance-constrained MCKP (CCMCKP), where item weights are random variables. In particular, we focus on the practical scenario of CCMCKP, in which the probability distributions of random weights are unknown and only sample data is available.

View Article and Find Full Text PDF

Want AI Summaries of new PubMed Abstracts delivered to your In-box?

Enter search terms and have AI summaries delivered each week - change queries or unsubscribe any time!