An improved optimal flow pattern algorithm for the network reconfiguration to minimize line losses is presented.
利用补偿原理对配电网网络重构的最优流模式算法进行改进，以减少潮流计算次数，降低计算量。
The algorithms are based on the optimal flow pattern and the objective function is the minimum of energy loss during a period of time.
算法以最优流法为基础，以一段时间内的能量损耗最小为目标函数。
The system marginal price can be obtained without the optimal flow calculation, so there is no convergence problem and the cost revision is not necessary.
不必求解系统最优潮流就可以得到系统边际电价，因而不存在收敛性问题，也不必进行费用修正。
This article reports an improved optimal flow pattern algorithm based on compensation principle for distribution network reconfiguration for loss minimization.
利用补偿原理对配电网网络重构的最优流模式算法进行改进，以减少潮流计算次数，降低计算量。
Optimal flow pattern and branch changing cannot assure the global optimization result, but it can get the result in short time if it combines with the elicitation method.
最优流模式和基于支路的交换方法不能保证得到全局最优解，但与启发式规则结合后，可以在较短的时间得到结果。
Optimal flow pattern and branch changing can't assure the global optimization result , but it can get the result in short time if it combined with the elicitation method .
最优流模式和基于支路的交换方法不能保证得到全局最优解，但与启发式规则结合后，可以在较短的时间得到结果。
Optimal flow pattern and branch changing can't assure the global optimization result , but it can get the result in short time if it combined with the elicitation method .
最优流模式和基于支路的交换方法不能保证得到全局最优解，但与启发式规则结合后，可以在较短的时间得到结果。
应用推荐