KO algorithm-based bi-level optimal scheduling of electricity-carbon-hydrogen coupling systems with flexible resources for renewable energy integration
As renewable energy penetration keeps growing, its intermittent nature poses huge challenges on the reliable and flexible operation of power systems. The uncertainty and reverse peak shaving characteristics of renewable energy further exacerbate issues of load shedding and renewable energy curtailme...
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Elsevier
2025-09-01
|
| Series: | Results in Engineering |
| Subjects: | |
| Online Access: | http://www.sciencedirect.com/science/article/pii/S2590123025028804 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Summary: | As renewable energy penetration keeps growing, its intermittent nature poses huge challenges on the reliable and flexible operation of power systems. The uncertainty and reverse peak shaving characteristics of renewable energy further exacerbate issues of load shedding and renewable energy curtailment. Additionally, both carbon trading and hydrogen energy which play important roles in reducing carbon emissions have attracted great attention. A novel bi-level optimal scheduling model of the electricity-carbon-hydrogen coupling system is proposed considering carbon trading, load flexibility and deep peak shaving. The model simultaneously minimizes load shedding, renewable energy curtailment and the operation cost. Moreover, the Kepler optimization (KO) algorithm is applied and benchmarked against flower pollination (FP) algorithm and particle swarm optimization (PSO) algorithm. Finally, comparative studies confirm that incorporating flexible resources (flexible load and deep peak shaving) significantly reduce renewable curtailment, eliminate load shedding, and lower operation cost. Furthermore, the newly introduced KO algorithm demonstrates superior performance over both FP and PSO algorithms across all evaluated metrics. |
|---|---|
| ISSN: | 2590-1230 |