摘要
当配电网中某运行设备发生故障并切除后,会引起一些负荷失去供电,此时需要快速有效地寻找恢复供电路径.文中介绍的算法根据配电网的辐射状结构特征,把电源点和失去供电的负荷点看作“兴趣点”,把寻找供电路径转化为求解给定图的“兴趣树”,从而简化了问题.计算结果表明,经多方面的改进后,算法更加快速有效,在配电系统自动化高层软件开发中,有在线应用前景.本算法适用于负荷集中的10kV以上配电网.
When a fault occurs in a device of distribution network, some loads may be unsupplied after isolating the fault. It is necessary to find out a service restorative procedure to these affected loads as quickly and efficiently as possible. In this paper a new service restoration algorithm is recommended, which regards source and unsupplied loads as an interested point, and simplifies the problem by finding interested trees of a given graph according to the radial character of distribution system. An example shows that the improved algorithm is more quick and efficient. The algorithm can be applied in high level on line software development of DMS. It should be noted that the algorithm is only constricted to the distribution system above 10 kV and more studies are required in the low voltage distribution system.
出处
《上海交通大学学报》
EI
CAS
CSCD
北大核心
1998年第6期134-136,152,共4页
Journal of Shanghai Jiaotong University
关键词
配电系统
重构
故障恢复
兴趣树
配电网
distribution systems
reconstitution
service restoration
interested trees