Economic dispatch of interconnected networks considering hidden flexibility
- 1. College of Electrical Engineering, Guangxi University, Nanning (China)
- 2. State Key Laboratory of Power Transmission Equipment & System Security and New Technology, College of Electrical Engineering, Chongqing University, Chongqing (China)
- 3. Electrical Power Research Institute of Henan Electric Power Corporation, Zhengzhou (China)
Description
Highlights: • A dispatch model considering hidden flexibility of external network is proposed. • An equivalence-based model capturing external operational constraints is proposed. • The proposed flexibility model can protect data privacy of external network. • A heuristic method is proposed to reduce the computational burden. • Case studies demonstrate the desired accuracy of the proposed method. —Owing to privacy concerns, data sharing between interconnected power networks is not always possible. Data sharing hinders cooperation among internal and external networks. Existing equivalence-based models can protect privacy and represent external characteristics. However, these models can be used only for a single-period economic dispatch, ignoring the hidden flexibility of the external network, especially the ramping flexibility. This paper proposes a multiperiod economic dispatch model considering the hidden flexibility. The hidden flexibility subjected to the operational constraints of the external network is represented by the proposed equivalent flexibility model. In this model, the operational constraints, including power balance equations, transmission capacity limits, and generation capacity limits, are equivalent to the feasible regions of tie lines based on multiparametric programming. To further capture the hidden ramping flexibility, equivalent ramping constraints are proposed, which are formulated as piecewise functions with respect to the tie line power. Based on the equivalent flexibility model, the multiperiod economic dispatch model of the interconnected power networks is constructed, which is a mixed integer linear programing (MILP) problem. A heuristic method is proposed to reduce the computational burden. The effectiveness of the proposed method is demonstrated by test systems.
Availability note (English)
Available from http://dx.doi.org/10.1016/j.energy.2021.120054Additional details
Identifiers
- DOI
- 10.1016/j.energy.2021.120054;
- PII
- S0360544221003030;
Publishing Information
- Journal Title
- Energy (Oxford)
- Journal Volume
- 223
- Journal Page Range
- vp.
- ISSN
- 0360-5442
- CODEN
- ENEYDS
INIS
- Country of Publication
- United Kingdom
- Country of Input or Organization
- International Atomic Energy Agency (IAEA)
- INIS RN
- 53123474
- Subject category
- S97: MATHEMATICAL METHODS AND COMPUTING;
- Descriptors DEI
- COMPUTERIZED SIMULATION; FLEXIBILITY; PROGRAMMING
- Descriptors DEC
- MECHANICAL PROPERTIES; SIMULATION; TENSILE PROPERTIES
Optional Information
- Copyright
- Copyright (c) 2021 Elsevier Ltd. All rights reserved.