摘要
为了提高配电网运行的经济性,提出一种基于图解蚂蚁系统的配电网动态重构问题的求解方法。求解过程分为离线和在线两个阶段。离线阶段完成拓扑分析,形成同时包含配电网拓扑结构和时段长度两部分的可行解解集,用构造图表示。在线阶段通过模拟蚁群在构造图中的行走过程完成搜索寻优。离线阶段仅需完成一次拓扑分析即可支持在线阶段各时段拓扑结构的求解。在线阶段通过时段延伸方法将搜索空间由可行解解集缩小为较优解解集。仿真算例验证了提出的算法可以有效缩小搜索范围,找到最优解。
A new method based on graph ant system is proposed for solving dynamic distribution network reconfiguration problem to improve the economy of distribution network. This method divides the solving process into an off-line stage and an on-line stage. The off-line stage analyzes the distribution network’s topology and forms the feasible solution set. The feasible solution set is expressed in structure map and contains both topological structure of the distribution network and the length of time interval. The on-line stage searches the best solution in the way of simulating the behavior that ants search for food in the structure map. Topological analysis is implemented only once during the off-line stage. During the on-line stage, a time extension method is used to reduce the feasible solution set to a much smaller set that contains better solutions. Simulation results of an example show that the proposed method can effectively reduce the searching scope to find the best solution.
出处
《电力系统保护与控制》
EI
CSCD
北大核心
2015年第12期73-78,共6页
Power System Protection and Control
基金
高等学校博士学科点专项科研基金项目(20110141110032)~~
关键词
配电网
动态重构
蚁群算法
图解蚁群系统
拓扑分析
distribution network
dynamic reconfiguration
ant colony algorithm
graph ant system
topology analysis