期刊文献+

基于最优场景生成算法的主动配电网无功优化 被引量:32

Reactive power optimization of active distribution network based on optimal scenario generation algorithm
下载PDF
导出
摘要 针对间歇性分布式电源输出功率的不确定性和随机性,提出采用Wasserstein距离指标和K-means聚类场景削减技术生成最优场景,将随机优化问题转换为确定性优化问题。建立了风—光—荷多场景树模型,并以有功网损最小、电压偏差最小作为目标函数,考虑储能荷电状态约束影响,建立含间歇性分布式电源的主动配电网无功优化数学模型,并采用人工蜂群算法对模型进行求解。仿真分析得出基于Wasserstein距离指标和K-means聚类场景削减技术生成的最优场景能较精确地体现分布式电源有功出力的随机特性。最后,以IEEE-33节点配电系统为例进行仿真分析,验证了所提方法的有效性和可行性。 Considering the uncertainty and stochasticity of intermittent distributed generations (DGs), a scenario method using Wasserstein distance metric and K-means cluster scenes reduction technique to generate optimal scene is proposed in this paper. So the stochastic optimization problem is transformed into a deterministic optimization problem. The multi-scenario tree models of wind-photovoltaic-load are established. A multi-objective reactive power optimization mathematical model of active distribution network containing intermittent DGS is built, which includes objectives that are the total active power losses and the voltage deviations of the bus, and considering energy storage states of charge characteristic constraints. Also, the artificial bee colony algorithm is used to solve the optimization problems. Simulation results show that the optimal scenes based on the Wasserstein distance indicators and K-means cluster technology reflect the random feature of distributed generation active power output more accurately. Finally, the simulation analysis of IEEE-33 bus distribution test system is carded out to verify the effectiveness and feasibility of the proposed method.
出处 《电力系统保护与控制》 EI CSCD 北大核心 2017年第15期152-159,共8页 Power System Protection and Control
基金 国家自然科学基金项目(51467009) 兰州市科技计划项目(2016-3-67)~~
关键词 主动配电网 场景分析 Wasserstein距离 K—means聚类 人工蜂群算法 active distribution network scenario analysis Wasserstein distance K-means cluster artificial bee colonalgorithm (ABC)
  • 相关文献

参考文献12

二级参考文献177

共引文献443

同被引文献431

引证文献32

二级引证文献373

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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