A Two-Stage Sustainable Optimal Scheduling Strategy for Multi-Contract Collaborative Distributed Resource Aggregators
Bibliographic record
Abstract
To address the challenges posed by the instability of renewable energy output and load fluctuations on grid operations and to support the low-carbon sustainable development of the energy system, this paper integrates artificial intelligence technology to establish an economic stability dispatch framework for distributed resource aggregators. A phased multi-contract collaborative scheduling model oriented toward sustainable development is proposed. Through intelligent algorithms, the model dynamically optimises decisions across the day-ahead and intraday phases: During the day-ahead scheduling phase, intelligent algorithms predict load demand and energy output, and combine with elastic performance-based response contracts to construct a user-side electricity consumption behaviour intelligent control model. Under the premise of ensuring user comfort, the model generates a 24 h scheduling plan with the objectives of minimising operational costs and efficiently integrating renewable energy. In the intraday scheduling phase, a rolling optimisation mechanism is used to activate energy storage capacity contracts and dynamic frequency stability contracts in real time based on day-ahead prediction deviations. This efficiently coordinates the intelligent frequency regulation strategies of energy storage devices and electric vehicle aggregators to quickly mitigate power fluctuations and achieve coordinated control of primary and secondary frequency regulation. Case study results indicate that the intelligent optimisation-driven multi-contract scheduling model significantly improves system operational efficiency and stability, reduces system operational costs by 30.49%, and decreases power purchase fluctuations by 12.41%, providing a feasible path for constructing a low-carbon, resilient grid under high renewable energy penetration.
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.001 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.001 | 0.000 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.003 | 0.000 |
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".