首页|基于耦合约束解耦的虚拟电厂动态可行域求解方法

基于耦合约束解耦的虚拟电厂动态可行域求解方法

扫码查看
构建以新能源为主体的新型电力系统需深入挖掘需求侧灵活性资源的调度潜力,使其参与电网调度调节任务以提升电网平衡调节能力。灵活性资源的海量异构特性使其聚合可行域的求解计算复杂度提升、约束满足难度增大。该文基于顶点搜索法,建立计及分布式电源出力不确定性的虚拟电厂动态可行域求解模型,进而通过李雅普诺夫优化将求解模型内部耦合约束松弛解耦为虚拟队列稳定性问题,提出以顶点搜索与队列稳定为目标的数学模型,最终通过建立虚拟时间队列形成求解算法。所提算法通过耦合约束解耦以提高求解效率;通过满足调度能力约束以提升资源调度能力。算例结果表明,在日前与日内场景下,所提算法具备提升计算效率与约束满足能力等方面的优势。
Solution Method of Virtual Power Plant Dynamic Feasible Region Based on Decoupling of Coupling Constraints
The construction of a new power system with new energy as the main body needs to deeply explore the scheduling potential of flexible resources on the demand side,so that they can participate in grid scheduling and adjustment to improve grid balance and adjustment capabilities.The characteristics of massive and heterogeneous flexible resources increase the complexity of resource aggregation and solving feasible region.In this regard,based on the vertex search method,this paper establishes a virtual power plant dynamic feasible region solution model that takes into account the uncertainty of distributed power output,and then decouples the internal coupling constraint relaxation of the solution model into a virtual queue stability problem through Lyapunov optimization.A mathematical model aiming at vertex search and queue stability is proposed,and finally a solution algorithm is formed by establishing a virtual time queue.The proposed algorithm improves the solution efficiency by decoupling the coupling constraints,and improves the resource scheduling capability by satisfying the scheduling capability constraints.The example results show that the proposed algorithm has the advantages in improving computational efficiency and constraint satisfaction ability in day-ahead and real-time scenarios.

virtual power plant(VPP)feasible domainflexible loadtemporal coupling constraintLyapunov optimization

许泽凯、和敬涵、刘曌、陈韦韬、王小君、张沛

展开 >

北京交通大学电气工程学院,北京市 海淀区 100044

虚拟电厂 可行域 柔性负荷 时间耦合约束 李雅普诺夫优化

国家重点研发计划项目

2022YFB2403400

2024

中国电机工程学报
中国电机工程学会

中国电机工程学报

CSTPCD北大核心
影响因子:2.712
ISSN:0258-8013
年,卷(期):2024.44(9)
  • 26