期刊文献+

基于网损因子迭代的安全约束机组组合算法 被引量:12

Security Constrained Unit Commitment Algorithm Considering Network Losses Based on an Iterative Loss Factor Calculation
下载PDF
导出
摘要 针对考虑安全约束的机组组合(security constrained unit commitment,SCUC)问题,在传统SCUC模型的基础上,建立考虑有功网损及其在电网中分布的SCUC模型,提出一种基于网损因子迭代的SCUC算法。此算法每次迭代先解固定网损因子的SCUC问题,求得机组的运行状态,然后进行交流潮流计算,更新网损因子,进入下一次迭代。针对可能出现的网损因子振荡问题,提出SCUC和经济调度相结合的方法,选择对应发电成本较小的机组启停状态,进行经济调度优化和网损因子迭代计算,直至算法收敛。对IEEE 30和IEEE 118节点系统进行的仿真计算验证了所提算法的正确性和有效性。 Active power loss factor and loss distribution factor were introduced to the security constrained unit commitment (SCUC) model, and an algorithm which based on linear mixed integer programming was proposed to solve the model iteratively. At each iteration, the SCUC problem was solved first with fixed loss factors. Then, AC power flow was calculated according to the obtained SCUC results and loss factors along with loss distribution factors were updated using the power flow results if oscillation of loss factors occurs during the iteration process, the unit commitment scheme with less production cost was chosen, and a loss factor iteration procedure was then executed to dispatch the output of each unit economically. The effectiveness and validity of proposed algorithm are illustrated by IEEE 30-bus and IEEE llS-bus system.
出处 《中国电机工程学报》 EI CSCD 北大核心 2012年第7期76-82,194,共7页 Proceedings of the CSEE
基金 国家自然科学基金项目(51107060) 国家教育部博士点新教师基金项目(200802481009) Project Supported by National Natural Science Foundation of China(51107060) Doctoral Fund for the New Teacher of Ministry of Education of China(200802481009)
关键词 机组组合 安全约束 网损 分段线性化 混合整 数规划 network losses programmingunit commitment security constraints piecewise linearization mixed-integer
  • 相关文献

参考文献32

  • 1Mohammad S, Hatim Y, Zuyi L. Market operation in electric power systems: forecasting, scheduling, and risk management[M] Translated by Du Songhuai, Wen Fushuang, Li Yang, et al. Beijing: China Electric Power Press, 2005: 179-202(inChinese).
  • 2Fan J Y, Zhang L, Mcdonald J D. Enhanced techniques on sequential unit commitment with interchange transactions[J]. IEEE Trans. on Power Systems, 1996, 11(1): 1131-1138.
  • 3Peterson W L, Brammer S R. A capacity based Lagrangian relaxation unit commitment with ramp rate constraints [J]. IEEE Trans. on Power Systems, 1995, 10(2): 1077-1084.
  • 4Cohen A I, Yoshimura M. A branch-and-bound algorithm for unit commitment[J]. IEEE Trans. on Power Apparatus and Systems, 1983, PAS-104(2): 444-451.
  • 5Kazarlis S A, Bakirtzis A G, Petridis V. A genetic algorithm solution to the unit commitment problem [J]. IEEETrans. on Power Systems, 1996, 11(1): 83-92.
  • 6Sasaki H, Watanabe M, Yokoyama R. A solution method of unit commitment by artificial neural networks[J]. IEEE Trans. on PowerSystems, 1992, 7(3): 974-981.
  • 7耿建,徐帆,姚建国,高宗和,丁恰,杨争林,程芸,陈刚.求解安全约束机组组合问题的混合整数规划算法性能分析[J].电力系统自动化,2009,33(21):24-27. 被引量:32
  • 8苏济归,舒隽,谢国辉,张粒子.大规模机组组合问题计及网络约束的线性化求解方法[J].电力系统保护与控制,2010,38(18):135-139. 被引量:22
  • 9Migeul C, Jose M A. A computationally efficient mixed-integer linear formulation for the thermal unit commitment problem[J]. IEEE Trans. on Power Systems, 2006, 21(3): 1371-1378.
  • 10IBM. CPLEX 12.2[EB/OL]. (2010)[2011-04-03]. https:// www. ibm. com/developerworks/university/software/get so ftware.html.

二级参考文献143

共引文献403

同被引文献130

引证文献12

二级引证文献152

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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