摘要
针对寻优搜索节点较多、线路较多的复杂大电力系统时计算维数过大的问题,提出了一种基于降维与搜索的网架重构方案。该方案结合优化蚁群算法与离散粒子群算法(DPSO)以搜索目标网架。首先,采用优化蚁群算法搜索一条主干线路,降低后续寻优的维数。然后,基于已经得到的主干线路,采用离散粒子群算法对电网的剩余部分进行搜索。利用已并网发电机组提供的发电功率,以考虑重要负荷的综合负荷恢复量最大为目标函数进行寻优,得到满足拓扑连通性和安全、稳定运行约束的目标网架。最后,以IEEE118节点系统和湖北电网部分地区为算例,验证了所提方法的正确性和有效性。
A kind of network-reconfiguration scheme based on dimension reduction and search is proposed to solve the oversize dimensions of optimal searching problem for large system that contains too many nodes and lines when using discrete particle swarm optimization. An improved ant colony and discrete particle swarm optimization （DPSO） are combined in the scheme to form skeleton networks. Firstly, an improved ant colony is used to obtain a trunk line, which could reduce the dimensions of the subsequent optimal searching. Secondly, based on the trunk line, discrete particle swarm optimization is employed in forming skeleton networks. The maximum quantity of the comprehensive recovered load, which makes important load into account, is defined as the optimization objective. The optimization must meet the constraint conditions, namely topological connectivity, safe and stable operation constrains. At last, the correctness and validity of the proposed scheme are verified by IEEE 118-bus system and part of Hubei Power Grid.
出处
《电力系统保护与控制》
EI
CSCD
北大核心
2017年第22期34-39,共6页
Power System Protection and Control
基金
国家自然科学基金项目(51677137)
南方电网公司科技项目(090000KK52160024)~~
关键词
电力系统恢复
网架重构
蚁群算法
离散粒子群算法
网络连通性
power system restoration
network reconfiguration
ant colony algorithm
discrete particle swarm optimization
network connectivity
