...
  • 主题
高级搜索  >
历史搜索 清空历史
首页> 外文期刊>International Journal of Electrical Power & Energy Systems >An efficient heuristic algorithm for reconfiguration based on branch power flows direction
【24h】

An efficient heuristic algorithm for reconfiguration based on branch power flows direction

机译：一种基于分支潮流方向的高效启发式重构算法

获取原文
获取原文并翻译 | 示例
           
页面导航
  • 摘要
  • 著录项
  • 相似文献
  • 相关主题

摘要

This paper presents a meshed algorithm for optimal reconfiguration of distribution systems. In the reconfiguration problem, the final objective is to reach a radial network that optimizes some function like the network losses. Many algorithms start from a radial network where a switch closure is complemented by opening of another switch to ensure a radial network. These radial algorithms have an inherent inconvenient, that is, the final solution depends on the initial radial network selected. Other group of algorithms initially represent the distribution network as a meshed network and then open switches until a radial system is obtained. In this paper, to avoid the above aforementioned inconvenient of radial algorithms, a meshed algorithm is used. Furthermore, taking into account that breakpoint nodes are defined as the nodes where the branch power flows converge, the contribution of this paper is to provide a method for solving the problem when multiple loops are considered using an approach based on the breakpoint nodes, since it is complicated to associate each breakpoint node with its corresponding loop. On the other hand, one of the drawbacks of the reconfiguration problem is the need to solve a great number of power flow computations for calculating the losses in each stage of the algorithm. The algorithm proposed has the property that reduces the number of power flows. By this way, the execution time of the algorithm is improved. Besides, it is not necessary to check the network connectivity at each step of the procedure. To prove the effectiveness of the proposed algorithm several test systems have been used, achieving good results.
机译：本文提出了一种用于优化配电系统重构的网格算法。在重新配置问题中，最终目标是建立一个可优化某些功能（例如网络损耗）的放射状网络。许多算法都是从径向网络开始的，在径向网络中，通过闭合另一个交换机来确保径向网络，可以补充交换机的关闭功能。这些径向算法具有固有的不便之处，即最终解决方案取决于所选的初始径向网络。另一组算法最初将配电网络表示为网状网络，然后断开开关，直到获得径向系统。在本文中，为了避免上述径向算法的不便，使用了网格化算法。此外，考虑到将断点节点定义为分支功率流收敛的节点，本文的目的是提供一种解决方法，当使用基于断点节点的方法考虑多个环路时，该问题得以解决。将每个断点节点与其对应的循环关联起来很复杂。另一方面，重新配置问题的缺点之一是需要解决大量的潮流计算以计算算法各阶段的损耗。所提出的算法具有减少功率流数量的特性。通过这种方式，改进了算法的执行时间。此外，无需在该过程的每个步骤中检查网络连接。为了证明所提算法的有效性，已经使用了多个测试系统，取得了良好的效果。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱：kefu@zhangqiaokeyan.com

京公网安备：11010802029741号 ICP备案号：京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有

  • 客服微信

  • 服务号