Improved Inner Approximation for Aggregating Power Flexibility in Active Distribution Networks and its Applications
Concise and reliable modeling for aggregating power flexibility of distributed energy resources in active distribution networks (ADNs) is a crucial technique for coordinating transmission and distribution networks. Our recent research has successfully derived an explicit expression for the exact aggregation model (EAM) of power flexibility at the substation level under linearized distribution network constraints. The EAM, however, is impractical for decision-making purposes due to its exponential complexity. In this paper, we propose an inner approximation method for aggregating flexibility in ADNs that utilizes the properties of the EAM to improve performance. Specifically, the geometric prototype of the inner approximation model is defined according to a subset of the coefficient vector set of the EAM, which enhances the accuracy. On the other hand, the computation efficiency of the inner approximation is also significantly improved by exploiting the regularity of coefficient vectors in the EAM in the parameter calculation process. The inner approximated flexibility model of ADNs is further incorporated into the security-constrained unit commitment problem as an application. Numerical simulations verify the effectiveness of the proposed method.
Code (0)
등록된 구현이 없습니다.
Tasks
Decision MakingSimilar Papers 제목 키워드 기반
Scalable and Efficient Aggregation of Energy-Constrained Flexible Loads
Loads represent a promising flexibility source to support the integration of renewable energy sources, as they may shift their energy consumption over time. By computing the aggregated flexibility of power and energy-con…
An Efficient Method for Quantifying the Aggregate Flexibility of Plug-in Electric Vehicle Populations
Plug-in electric vehicles (EVs) are widely recognized as being highly flexible electric loads that can be pooled and controlled via aggregators to provide low-cost energy and ancillary services to wholesale electricity m…
Approximation Algorithms for Preference Aggregation Using CP-Nets
This paper studies the design and analysis of approximation algorithms for aggregating preferences over combinatorial domains, represented using Conditional Preference Networks (CP-nets). Its focus is on aggregating pref…
Multiwinner Voting with Fairness Constraints
Multiwinner voting rules are used to select a small representative subset of candidates or items from a larger set given the preferences of voters. However, if candidates have sensitive attributes such as gender or ethni…
AttributeFairnessLeveraging Two-Stage Adaptive Robust Optimization for Power Flexibility Aggregation
Adaptive robust optimization (ARO) is a well-known technique to deal with the parameter uncertainty in optimization problems. While the ARO framework can actually be borrowed to solve some special problems without uncert…
Vocal Bursts Valence Prediction