arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1410.4236math.OC
收藏

DC最优潮流的分布式计算方法

Distributed Approach for DC Optimal Power Flow Calculations

Javad Mohammadi, Soummya Kar, Gabriela Hug

摘要:

电力系统的趋势是向增加的分布式资源量移动,这意味着从当前的高度集中的控制结构向更加分布式的控制结构过渡。在本文中,我们提出了一种方法,使一个完全分布式的解决方案的直流最优潮流问题(DC-OPF),即发电设置,最大限度地减少成本,同时提供的负载,并确保所有的线路流量低于其限制是在一个分布式的方式确定。该方法包括一个分布式的过程,旨在解决一阶最优性条件,其中个别总线优化变量迭代更新,通过简单的本地计算和信息交换与邻近的实体。特别是,一个特定的总线的更新包括一个术语,它考虑到相邻的拉格朗日乘数变量和当地的创新条款,强制执行的需求/供应平衡之间的耦合。总线与其相邻总线交换关于其乘数的当前更新和总线角度的信息。分析证明了该方法收敛于DC-OPF的最优解。此外,性能评估使用IEEE可靠性测试系统作为测试用例。

英文摘要:

The trend in the electric power system is to move towards increased amounts of distributed resources which suggests a transition from the current highly centralized to a more distributed control structure. In this paper, we propose a method which enables a fully distributed solution of the DC Optimal Power Flow problem (DC-OPF), i.e. the generation settings which minimize cost while supplying the load and ensuring that all line flows are below their limits are determined in a distributed fashion. The approach consists of a distributed procedure that aims at solving the first order optimality conditions in which individual bus optimization variables are iteratively updated through simple local computations and information is exchanged with neighboring entities. In particular, the update for a specific bus consists of a term which takes into account the coupling between the neighboring Lagrange multiplier variables and a local innovation term that enforces the demand/supply balance. The buses exchange information on the current update of their multipliers and the bus angle with their neighboring buses. An analytical proof is given that the proposed method converges to the optimal solution of the DC-OPF. Also, the performance is evaluated using the IEEE Reliability Test System as a test case.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑