摘要
针对可再生能源出力波动性和不确定性对其电网消纳所带来的制约问题,提出了一种基于潮流路由器(power flow router,PFR)技术的多时间尺度可再生能源消纳方法。首先介绍了PFR的基本概念和数学模型;其次建立了面向可再生能源消纳的多时间尺度优化调度模型,并建立了PFR选址定容、日前优化调度和实时优化调度模型;针对模型的非凸和非线性问题,提出了基于双层迭代和半正定规划的面向可再生能源消纳的PFR选址定容求解算法,该算法的内层算法同时实现了日前优化调度和实时优化调度模型求解;最后,以IEEE 30节点系统为例进行多时间尺度的PFR可再生能源消纳优化计算,验证了所提方法的正确性和有效性。
Considering constraints caused by volatility and uncertainty of renewable energy to absorption of the power grid,a multi-time scale renewable energy absorption method based on power flow router technology(PFR)technology is proposed.The basic concept and mathematical models of PFR is first introduced,and then a multi-time scale optimal scheduling model for renewable energy absorption is established.Meanwhile,the site selection and constant volume model,the day-ahead forecast model and the real-time optimization model for PFR are built.To solve the non-convex and nonlinear problems of the models,a calculation algorithm for site selection and capacity planning of PFR for renewable energy absorption based on bi-level iteration and semi-definite programming is proposed.The inner layer algorithm of the proposed algorithm can solve the optimal scheduling model and the real-time model.Finally,the IEEE 30-bus system is taken as an example to verify the accuracy and effectiveness of the proposed method by calculating renewable energy absorption optimization with PFR based the multi-time scale method.
作者
杨汾艳
刘正富
李海波
熊锋俊
YANG Fenyan;LIU Zhengfu;LI Haibo;XIONG Fengjun(Electric Power Research Institute of Guangdong Power Grid Co.,Ltd.,Guangzhou,Guangdong 510080,China;Tsinghua Sichuan Energy Internet Research Institute,Chengdu,Sichuan 610213,China;Guangdong University of Technology,Guangzhou,Guangdong 510006,China)
出处
《广东电力》
2019年第11期1-11,共11页
Guangdong Electric Power
基金
中国南方电网有限责任公司科技项目(GDKJQQ20161200)
国家重点研发计划资助项目(2018YFB0905200)
关键词
潮流路由器
可再生能源
多时间尺度
选址定容
日前调度
实时调度
半正定规划
双层迭代算法
power flow router
renewable energy
multi-time scale
site location and capacity planning
day-ahead scheduling
real-time scheduling
semi-definite programming
bi-level algorithm