首页> 外文会议>Power systems computation conference;PSCC 2011 Stockholm >GLOBALLY CONVERGENT OPTIMAL POWER FLOW USING COMPLEMENTARITY FUNCTIONS AND TRUST REGION METHODS
【24h】

GLOBALLY CONVERGENT OPTIMAL POWER FLOW USING COMPLEMENTARITY FUNCTIONS AND TRUST REGION METHODS

机译:使用互补函数和信赖域方法的全局收敛最优潮流

获取原文

摘要

As power systems become heavily loaded there is an increasing need for globally convergent optimal power flow (OPF) algorithms. An algorithm is said to be globally convergent if it is able to obtain a solution, if one exists, for any choice of initial point. Such an algorithm is developed here by combining three approaches: (i) reformulation of the OPF problem as a nonlinear equations system by means of complementarity functions, (ii) reformulation of the equations system as an unconstrained minimization problem, and (iii) solution of the unconstrained minimization problem by a globally convergent trust region algorithm. The proposed algorithm is implemented in MATLAB, and its performance is tested on the IEEE 30-, 57-, 118- and 300-bus systems.
机译:随着电力系统的负担越来越重,对全球收敛的最佳潮流(OPF)算法的需求日益增长。如果算法能够针对任何初始点选择获得解决方案(如果存在),则称该算法是全局收敛的。这种算法是通过结合以下三种方法开发的:(i)通过互补函数将OPF问题重构为非线性方程组,(ii)将方程组重构为无约束最小化问题,以及(iii)求解全局收敛信任域算法求解无约束最小化问题所提出的算法在MATLAB中实现,其性能在IEEE 30总线,57总线,118总线和300总线系统上进行了测试。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号