.png){kind=icon}
返回
Large-Scale Network Layout Optimization for Radial Distribution Networks by Parallel Computing
.png){kind=icon}
PRE
AI
DOI：10.1109/TPWRD.2011.2123924.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
This paper presents an algorithm to simultaneously optimize the layout and conductor type in a radial distribution network. The optimization includes the investment cost and losses in the lines, with the maximum current constraints per conductor, maximum voltage drop in any node in the network, and tapering constraints. A branch-exchange algorithm is used for layout optimization; this generates intermediate points to avoid reaching local minimums, and conductor optimization is solved with a dynamic programming algorithm. There is also a variant for use in large-scale areas with several feeding points and a set of geographically distributed loads, which do not require a preassignation of the loads, allowing their connection to the point that offers lower overall cost. To achieve reasonable resolution times, a grid is built to utilize parallel computing.
Keyword:
Branch exchange
network planning
parallel computing
power distribution planning
期刊
IF:
3.7
论文数:
9.1K
被引数:
2.2W
机构
引用论文
.png){kind=icon}
分享收藏Large-Scale Distribution Planning-Part II: Macro-Optimization With Voronoi's Diagram And Tabu Search
PREAI
分享收藏
分享收藏Large-Scale Distribution Planning-Part I: Simultaneous Network and Transformer Optimization大规模配电计划-第一部分: 同时网络和变压器优化
PREAI
分享收藏
查看更多内容