期刊文献+

Transmission Network Expansion Planning Considering Uncertainties in Loads and Renewable Energy Resources 被引量:17

原文传递
导出
摘要 This paper proposes a novel method for transmission network expansion planning(TNEP)that take into account uncertainties in loads and renewable energy resources.The goal of TNEP is to minimize the expansion cost of candidate lines without any load curtailment.A robust linear optimization algorithm is adopted to minimize the load curtailment with uncertainties considered under feasible expansion costs.Hence,the optimal planning scheme obtained through an iterative process would be to serve loads and provide a sufficient margin for renewable energy integration.In this paper,two uncertainty budget parameters are introduced in the optimization process to limit the considered variation ranges for both the load and the renewable generation.Simulation results obtained from two test systems indicate that the uncertainty budget parameters used to describe uncertainties are essential to arrive at a compromise for the robustness and optimality,and hence,offer a range of preferences to power system planners and decision makers.
出处 《CSEE Journal of Power and Energy Systems》 SCIE 2015年第1期78-85,共8页 中国电机工程学会电力与能源系统学报(英文)
基金 supported by the National Basic Research Program of China(2012CB215106).
  • 相关文献

参考文献1

二级参考文献10

  • 1Romero R,Gallego R A,Monticelli A.Transmission system expansion planning by simulated annealing[J].IEEE Transactions on Power Systems,1996,11(1):364-369.
  • 2Edson L S,Hugo A G,Jorge M A.Transmission network expansion planning under an improved genetic algorithm[J].IEEE Transactions on Power Systems,2000,15(3):1168-1175.
  • 3Wen Fushuan,Chang C S.Transmission network optimal planning using the tabu search method[J].Electric Power Systems Research,1997,47 (2):153-163.
  • 4Feo T A,Resende M G C.Greedy randomized adaptive search procedure[J].Journal of Global Optimization,1995,6:109-133.
  • 5Feo T A,Resende M G C,Smith S H.A greedy randomized adaptive search procedure for maximum independent set[J].Operation Research,1994,42(5):860-878.
  • 6Resende M G C.Computing approximate solutions of the maximum covering problem with GRASP[J].Journal of Heuristics,1998,(4):161-177.
  • 7Marti R.Arc crossing minimization in graphs with GRASP[J].IIE Transactions,2001,33:913-919.
  • 8Binato S,de Oliveira G C,de Araujo J L.A greedy randomized adaptive search procedure for transmission expansion planning[J].IEEE Transaction on Power System,2001,16(2):247-253.
  • 9Romero R,Monticelli A,Garcia A,et al.Test systems and mathematical models for transmission network expansion planning[J].IEE Proceedings:Generation,Transmission and Distribution,2002,149 (1):27-36.
  • 10翟海保,程浩忠,陈春霖,江峰青,房领峰.基于改进蚁群算法的输电网络扩展规划[J].中国电力,2003,36(12):49-52. 被引量:15

共引文献5

同被引文献156

引证文献17

二级引证文献162

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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