检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:崔伟 柴龙越 王聪 王炜 汪莹 杨仑 CUI Wei;CHAI Longyue;WANG Cong;WANG Wei;WANG Ying;YANG Lun(Northwest Branch of State Grid Corporation of China,Xi'an 710000;School of Automation Science and Engineering,Xi'an Jiaotong University,Xi'an 710049)
机构地区:[1]国网电网有限公司西北分部,陕西西安710000 [2]西安交通大学自动化科学与工程学院,陕西西安710049
出 处:《中国电力》2024年第10期166-171,共6页Electric Power
基 金:国家电网公司西北分部科技项目(SGTYHT/21-JS-226);国家重点研发计划资助项目(2022YFA1004600)。
摘 要:现有概率最优潮流计算侧重于概率计算方法的设计和改进,难以从本质上提高概率最优潮流的计算效率。为此,以交直流新能源电网为研究对象,考虑风电、光伏发电的不确定性,建立交直流互联新能源电网概率最优潮流模型。首先,提出一种改进凸松弛技术处理非线性非凸潮流方法,将其转化为凸规划形式下的概率最优潮流模型;其次,利用Nataf变换处理非正态分布随机变量间的相关性,进而采用结合拉丁超立方采样技术的蒙特卡罗模拟法(monte carlo simulation,MCS)进行求解以降低MCS的计算量;最后,通过改进的IEEE 39节点、118节点以及500节点系统验证所提方法的有效性。The existing probabilistic optimal power flow(POPF)studies mainly focus on the design and improvement on probabilistic calculation methods,which may be difficult to improve the computational efficiency of POPF as POPF is a nonconvex and nonlinear programming problem under uncertainty.Therefore,this paper centers on renewable-dominated AC-DC power grid and proposes a POPF model considering uncertainties associated with wind and solar power.To efficiently solve the POPF model,an improved convex relaxation is proposed to address the nonconvex and nonlinear power flow equations and reformulate the nonlinear POPF model as convex one.Furthermore,the Nataf transformation is adopted to address the correlations of non-normal distribution and then a Monte Carlo Simulation based Latin Hypercube sampling technique is developed to solve the convex POPF model.Finally,the effectiveness of the proposed improved convex relaxation based POPF method is demonstrated by a set of case results tested on the modified IEEE 39-bus,118-bus,and 500-bus systems.
分 类 号:TM744[电气工程—电力系统及自动化]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.130