期刊
IEEE TRANSACTIONS ON POWER SYSTEMS
卷 26, 期 1, 页码 30-37出版社
IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
DOI: 10.1109/TPWRS.2010.2052076
关键词
Computation time; losses; networks; power distribution control
资金
- Department of Electrical and Computer Engineering at North Dakota State University (NDSU)
The efficiency of network reconfiguration depends on both the efficiency of the loss estimation technique and the efficiency of the reconfiguration approach itself. We propose two novel algorithmic techniques for speeding-up the computational runtime of both problems. First, we propose an efficient heuristic algorithm to solve the distribution network reconfiguration problem for loss reduction. We formulate the problem of finding incremental branch exchanges as a minimum cost maximum flow problem. This approach finds the best set of concurrent branch exchanges yielding larger loss reduction with fewer iterations, hence significantly reducing the computational runtime. Second, we propose an efficient random walks-based technique for the loss estimation in radial distribution systems. The novelty of this approach lies in its property of localizing the computation. Therefore, bus voltage magnitude updates can be calculated in much shorter computational runtimes in scenarios where the distribution system undergoes isolated topological changes, such as in the case of network reconfiguration. Experiments on distribution systems with sizes of up to 10 476 buses demonstrate that the proposed techniques can achieve computational runtimes shorter with up to 7.78 times and with similar or better loss reduction compared to the Baran's reconfiguration technique [1].
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据