A Generic Convex Model for a Chance-Constrained Look-Ahead Economic Dispatch Problem Incorporating an Efficient Wind Power Distribution Modeling
Bibliographic record
Abstract
Power systems with high penetration of wind resources must cope with significant uncertainties originated from wind power prediction error. This uncertainty might lead to wind power curtailment and load shedding events in the system as a big challenge. Efficient modeling and incorporation of wind power uncertainty in generation and reserve scheduling can prevent these events. This paper presents a new framework for wind power cumulative distribution function (CDF) modeling and its incorporation in a new chance-constrained economic dispatch (CCED) problem. The proposed CDF modeling uses few moments of wind power random samples. To validly capture the actual features of the wind power distribution such as main mass, high skewness, tails, and especially boundaries from the moments, an efficient moment problem is presented and solved using the beta kernel density representation (BKDR) technique. Importantly, a new polynomial cost function for efficient modeling of wind power misestimation costs is proposed for the CCED problem that eliminates the need for an analytical CDF and enables the use of an accurate piecewise linearization technique. Using this technique, the non-linear CCED problem is converted to a mixed-integer linear programming (MILP)-based problem that is convex with respect to the continuous variables of the problem. Therefore, it is solved via off-the-shelf mathematical programming solvers to reach more optimal results. Numerical simulations using the IEEE 118-bus test system show that compared with conventional approaches, the proposed MILP-based model leads to lower power system total cost, and thereby is suggested for practical applications.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
How this classification was reachedexpand
Full frame machine prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.001 | 0.002 |
| Meta-epidemiology (narrow) | 0.002 | 0.001 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.000 | 0.001 |
| Scholarly communication | 0.002 | 0.001 |
| Open science | 0.002 | 0.001 |
| Research integrity | 0.002 | 0.002 |
| Insufficient payload (model declined to judge) | 0.005 | 0.001 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".