期刊文献+

市场环境下考虑电价的机组组合问题比较 被引量:1

Comparison of Unit Commitment Problem Considering Price in Markets
下载PDF
导出
摘要 为了比较市场环境下基于电价的确定性机组组合问题与考虑电价不确定性的随机机组组合问题模型的优劣,该文定义了两种风险指标,并采用改进粒子群算法求解这两种机组组合问题。在求解过程中,将机组组合问题分解为确定机组开停机表和确定机组出力的两阶段优化问题,并引入最小开停机修复策略。算例表明,在不同风险态度下,发电商应采取不同的机组组合问题数学模型并进行求解和决策。 To compare the model of price-based unit commitment problem and the model of stochastic price based unit commitment problem in electric power markets, this paper introduces two risk indicators, and adopts an improved par- ticle swarm optimization to solve these two kinds of unit commitment problem. During the solution, the unit commit- ment problem is decomposed into a two-stage optimization problem. A unit on/off status schedule is determined in the first stage, and the generation output of each unit is determined in the second stage. Also, a kind of minimum up/down repair strategy is introduced. Numerical results indicate that, with different risk attitudes, decision makers should adopt different mathematical model and make decision accordingly.
出处 《电力系统及其自动化学报》 CSCD 北大核心 2015年第4期61-66,共6页 Proceedings of the CSU-EPSA
关键词 基于电价的确定性机组组合问题 考虑电价不确定性的随机机组组合问题 风险指标 改进粒子群优化 price-based unit commitment (PBUC) stochastic price based unit commitment (SPBUC) risk indica-tors improved particle swarm optimization
  • 相关文献

参考文献19

  • 1Lee F N. Short-term thermal unit commitment-a new method[J]. IEEE Trans on Power Systems, 1988,3 (2) : 421-428.
  • 2Snyder W L Jr, Powell H D, Rayburn J C. Dynamic progra- mming approach to unit commitment[J]. IEEE Trans on Power Systems, 1987,2(2) : 339-350.
  • 3Zhuang F,Galiana F D. Towards a more rigorous and practical unit commitment by Lagrangian relaxation [J]. IEEE Trans on Power Systems, 1988,3 (2):763-773.
  • 4Kazarlis S A, Bakirtzis A G, Petridis V. A genetic algorithm solution to the unit commitment problem[J]. IEEE Trans on Power Systems, 1996, 11 ( 1 ) : 83-92.
  • 5Takriti S, Birge J R, Long E. A stochastic model for the u- nit commitment problem[J]. IEEE Trans on Power Sys- tems, 1996, 11(3) : 1497-1508.
  • 6Shiina T,Birge J R. Stochastic unit commitment problem [J]. International Transactions in Operational Research, 2002, 1252( 11 ) : 117-123.
  • 7熊高峰,聂坤凯,刘喜苹,蔡振华,谢上华.基于遗传算法的随机机组组合问题求解[J].电力系统及其自动化学报,2012,24(5):93-99. 被引量:7
  • 8Padhy N P. Unit commitment-a bibliographical survey[J]. IEEE Trans on Power Systems, 2004, 19(2) : 1196-1205.
  • 9Padhy Narayana Prasad. Unit commitment problem under deregulated environment-a review[C]//IEEE Power Engi- neering Society General Meeting. Toronto, Canada: 2003.
  • 10Baillo A,Ventosa M,Rivier M,et al. Optimal offering strategies for generation companies operating in electricity spot markets[J]. IEEE Trans on Power Systems, 2004, 19 (2) : 745-753.

二级参考文献34

  • 1范宏,韦化.改进遗传算法及其在机组优化组合中的应用[J].电力系统及其自动化学报,2004,16(4):46-49. 被引量:15
  • 2袁晓辉,王乘,袁艳斌,张勇传.一种求解机组组合问题的新型改进粒子群方法[J].电力系统自动化,2005,29(1):34-38. 被引量:39
  • 3肖昌育,万仲平,李继生,樊恒,奚江惠,彭向阳,王淑芬.机组组合随机模型及其算法简介[J].华中电力,2005,18(5):5-8. 被引量:1
  • 4WOOD A J,WOLLENBERG B F.Power Generation,Operation and Control.New York(NY,USA):John Wiley & Sons,1984.
  • 5SENJYO T,SHIMABUKURO K,UEZATO K et al.A Fast Technique for Unit Commitment Problem by Extended Priority List.IEEE Trans on Power Systems,2003,18(2):882 888.
  • 6SNYDER W L,POWELL H D,RAYBURN J C.Dynamic Programming Approach to Unit Commitment.IEEE Trans on Power Systems,1987,2(2):339-350.
  • 7OUYANG Z,SHAHIDEHPOUR S M.An Intelligent Dynamic Programming for Unit Commitment Application.IEEE Trans on Power Systems,1991,6(3):1203-1209.
  • 8ZHUANG F,GALIANA F D.Towards a More Rigorous and Practical Unit Commitment by Lagrangian Relaxation.IEEE Trans on Power Systems,1988,3(2):763-773.
  • 9CHENG C P,LIU C W,LIU C C.Unit Commitment by Lagrangian Relaxation and Genetic Algorithms.IEEE Trans on Power Systems,2000,15(2):707-714.
  • 10KAZARLIS S A,BAKIRTZIS A G,PETRIDIS V.A Genetic Algorithm Solution to the Unit Commitment Problem.IEEE Trans on Power Systems,1996,11(1):83-92.

共引文献58

同被引文献17

引证文献1

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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