配电网络重构的递归虚拟流理论和算法

配电网络重构是降损的有效措施。该理论和算法将配电网络重构问题分成与联络刀闸一一对应的一系列重构子问题，每个子问题用虚拟流理论求解。该理论通过建立单环网的非线性规划模型，在优化过程中考虑了负荷的电压静特性对优化结果的影响，且证明了打开流过虚拟流最小的网环刀闸，所得辐射网络结构最优的结论。重构总问题采用递归算法求解。该算法根据启发式指标大小确定子问题的预过滤、刀闸的开合顺序和开后重合问题，从而保证合理的操作顺序和最优的网络结构，便于实时环境应用

Recursive fictitious flow theory and algorithm for distribution network reconfiguration

? The theory and algorithm divide the reconfiguration problem into a series of sub problems corresponding to the tie switches. Each sub problem is a nonlinear planning model in which the static voltage characteristic of load is considered. The optimal current in this model is called the fictitious flow. It is proved that opening the switch through minimum fictitious flow will get the optimal solution of a sub problem. Loss reduction resulted from closing and opening switches can be easily estimated with a formula look like Ri 2 . A performance index of tie switch has been derived. The tie switches are closed in the descend order of the index. If the maximum index is small enough, the relevent tie switch will not be closed. With the help of this performance and a recursive algorithm, an optimal solution can be obtained. The test results show that the recursive fictitious flow algorithm is fast and efficient. It can be applied in a real time environment.