期刊文献+

考虑输电网络影响的火电机组优化组合的一种实用算法

A practical algorithm for unit commitment taking into account transmission network
下载PDF
导出
摘要 提出一种考虑输电网络损耗及线路过负荷的火电机组优化组合的实用算法。用动态规划法建立一个初始解,运用启发式手法对初始解进行修正,使之逐个满足各约束条件,得到运行可能解,并通过更新发电机起动优先顺序使此过程反复进行直至得到(准)最佳解。在求解过程中引入最优潮流计算,使考虑输电网络损耗及线路过负荷等网络因素对发电机组优化组合的影响成为可能,并提出一种调节发电机出力和改变发电机组合相结合的消除线路过负荷的方法。在IEEE-118母线(36机)系统上对所提出的算法进行了各种条件下的仿真计算,考察了网络损耗及线路过负荷对发电机组优化组合的影响,验证了所提算法对解决考虑输电网络因素影响的发电机组优化组合问题的有效性。 A practical algorithm was proposed for unit commitment problem considering transmission network. A n initial unit commitment solution was created by using dynamic programming technique in advance. The initial solution was revised by applying a heuristic approach to successively satisfy various constraints to obtain an operational unit commitment solution, the process was iteratively performed through updating units' priority orders, until it obtains a sub-optimum solution. An optimal power flow method was incorporated into the heuristic solution process to make it possible to consider affects of network factors such as transmission losses and line overload to unit commitment. In addition, an algorithm for getting rid of line overload was presented, which was composed of adjusting commitment units' output and modifying unit commitment schedule. Various simulations on the IEEE-118 bus system with 36-unit for the proposed algorithm were carried out, the simulation results show the effectiveness of the proposed algorithm in solving unit commitment problem considering affects of network factors.
作者 高毅 赵国梁
出处 《中国电力》 CSCD 北大核心 2007年第12期63-67,共5页 Electric Power
关键词 发电机组优化组合 网络损耗 线路过负荷 动态规划法 最优潮流计算 unit commitment transmission losses line overload dynamic programming OPF
  • 相关文献

参考文献11

  • 1ZHUANG F, GALIANA F D. Towards a more rigorous: an practical unit commitment by Lagrangain [J]. IEEE Trans. on Power Systems, 1988,3(2):763-773.
  • 2SNYDER WL POWELL H D, RAYBURN J C. Dynamic programming approach to unit commitment [J ].IEEE Trans. on PAS, 1987, 102 ( 2 ): 339-350.
  • 3COHEN A I, YOSHIMURA M A. Branch-and-bound algorithm for unit commitment [ J ]. IEEE Trans. on PAS. 1987,102 (2):444-451.
  • 4SASAKI H, WATANABE M. A solution method of unit commitment by artificial neural networks [J]. IEEE Trans. on Power Systems, 1996,11 ( 1 ):83-92.
  • 5KAZARLIS S A, BAKIRTZIS A G, PETIDIS V A. Genetic algorithm solution to the unit commitment problem [J ]. IEEE Trans. on Power Systems, 1996,11 ( 1 ):83-92.
  • 6MA H, SHAHIDEHPOUR S M. Unit commitment with transmission security and voltage constraints [J ]. IEEE Trans. on Power Systems, 1999,14(2):757-764.
  • 7YAMASHIRO S. A method for weekly thermal unit commitment scheduling (Japanese) [J ]. Trans. of IEE of Japan, 1994, 114-B ( 12): 1236-1242.
  • 8ZHAO G, YAMASHIRO S. Methods for thermal unit commitment scheduling problem taking into account transmission losses (Japanese) [ C ]//Proceedings of Research Conference of IEE of Japan, 1999.Tokyo: PE-99-88.
  • 9ZHAO G, YAMASHIRO S. A method for thermal unit commitment scheduling taking into account transmission network [C ]//Proceedings of ICEE'2k, 2000. Kitakyushu: 878-881.
  • 10YAMASHIRO S. Optimization of power flow by DC method (Japanese) [J]. Trans. of IEE of Japan, 1977, 97-B( 11 ): 31-36.

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部