基于树木生长算法的含UPFC的最优潮流计算
作者:
作者单位:

作者简介:

通讯作者:

中图分类号:

TM732

基金项目:

国家重点研发计划资助项目(2018YFB0904500)


Optimal power flow with UPFC based on tree growth algorithm
Author:
Affiliation:

Fund Project:

National Key Research and Development Program of China,

  • 摘要
  • |
  • 图/表
  • |
  • 访问统计
  • |
  • 参考文献
  • |
  • 相似文献
  • |
  • 引证文献
  • |
  • 资源附件
  • |
  • 文章评论
    摘要:

    最优潮流(OPF)计算是一个非凸优化问题,统一潮流控制器(UPFC)的引入增加了OPF问题的非凸程度,使得基于内点法的传统优化算法难以获取全局最优解。文中提出基于树木生长算法(TGA)的计及UPFC的最优潮流计算方法,将发电成本与有功网损、电压偏移加权作为目标函数,并考虑网络与UPFC设备的安全运行约束,优化了OPF模型。最后基于IEEE 30节点系统以及南京西环网116节点实际系统进行算例测试,对比TGA、粒子群与内点法的结果,并使用蒙特卡洛方法对不同的启发式算法分别进行50次计算,验证了TGA具有更好的求解精度与鲁棒性。

    Abstract:

    Optimal power flow (OPF) is generally a non-convex optimization problem. The integration of unified power flow controller(UPFC) increases the nonlinearity of the original OPF problem. As a result, it is hard to obtain a global optimal solution using the traditional interior point method. Tree growth algorithm (TGA) is proved to be efficient and robust in solving complex engineering problems. TGA can globally search for optimal solutions to solve the OPF model that considers UPFC. In this model, the power generation cost, active power loss, and voltage deviation are included in the objective function, while the secure operation constraints of the power system integrated with UPFC are considered. Finally, numerical results on the IEEE 30-bus system and an actual system of Nanjing west ring network are carried out. The optimal solutions obtained from TGA, particle swarm optimization and interior point method are compared. At the same time, different heuristic algorithms are calculated 50 times using Monte Carlo method. These results verify the effectiveness of proposed approach and better accuracy and robustness of TGA.

    参考文献
    相似文献
    引证文献
引用本文

欧阳晨,卫志农,孙国强.基于树木生长算法的含UPFC的最优潮流计算[J].电力工程技术,2020,39(3):84-91

复制
分享
文章指标
  • 点击次数:
  • 下载次数:
  • HTML阅读次数:
  • 引用次数:
历史
  • 收稿日期:2019-11-01
  • 最后修改日期:2019-12-12
  • 录用日期:2020-03-05
  • 在线发布日期: 2020-06-08
  • 出版日期: 2020-05-28
文章二维码