一种多区域互联电网资源调度方法及系统
By decomposing the day-ahead period into multiple scheduling period subsets and employing vertex search and dimension-upgrading intersection operations, the problem of high computational complexity of the feasible region of tie lines in multi-regional power grids is solved, and efficient coordination of information exchange and resource scheduling between multi-regional power grids is achieved.
Patent Information
- Authority / Receiving Office
- CN · China
- Patent Type
- Patents(China)
- Current Assignee / Owner
- CHINA SOUTHERN POWER GRID COMPANY
- Filing Date
- 2023-01-17
- Publication Date
- 2026-07-17
AI Technical Summary
Existing technologies fail to effectively consider the internal security and balance constraints of sub-regions in the coordinated operation of multi-level power grids, resulting in the inability of power transmission and reception plans to eliminate the situation of exceeding operational constraints. Furthermore, in multi-region interconnection scenarios, the computational complexity of the feasible domain of tie lines is high, making it difficult to meet the timeliness requirements of dispatching.
The daytime period is decomposed into multiple scheduling time period subsets. The feasible region of tie lines for each time period is calculated by vertex search method, and dimension increase and intersection operations are performed to reduce computational complexity and realize information exchange and resource scheduling between multi-regional power grids.
It reduces the complexity and computational load of calculating the feasible region of tie lines, improves the timeliness of scheduling, avoids the difficulty of information exchange, and ensures the accuracy and coordination of resource scheduling among multi-regional power grids.
Smart Images
Figure CN116011785B_ABST