首页> 外文会议> >A New Optimal Capacitor Placement Algorithm
【24h】

A New Optimal Capacitor Placement Algorithm

机译:一种新的最佳电容器放置算法

获取原文
获取原文并翻译 | 示例

摘要

In this paper a simple optimization scheme for capacitor placement is presented. We prove that this scheme can find the optimal solution under the condition that the capacitor unit placed in each iteration is relatively small. Two algorithms are proposed to compute power flow after a capacitor is added, one of which is the Gaussian Based algorithm, another of which is the tangent-based algorithm. The Gaussian-Based algorithm avoids the computation of admittance matrix inverse by a procedure like back-substitution, which just requires the load equivalence. The convergence is largely fastened by using suitable initialization during the process of optimization. The tangent-based algorithm, which makes use of the concept of Continuation Power Flow, approximates the power flow curve by the tangent line as the predictor, and then chooses the location with the largest power losses reduction to run the AC power flow as the corrector. The proposed algorithms are tested on 30 bus system.
机译:本文提出了一种简单的电容器放置优化方案。我们证明该方案可以在每次迭代中放置的电容器单元相对较小的条件下找到最佳解决方案。提出了两种算法来计算添加电容器后的功率流,其中一种是基于高斯算法,另一种是基于切线算法。基于高斯的算法避免了通过像反置换这样的过程来计算导纳矩阵逆,该过程只需要负载等效。在优化过程中,通过使用适当的初始化在很大程度上加快了收敛速度。基于切线的算法,利用“连续潮流”的概念,以切线近似的潮流曲线作为预测因子,然后选择功率损耗减少最大的位置作为交流潮流进行校正。 。所提出的算法在30总线系统上进行了测试。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号