配电网重构的组合算法

Combination algorithm for Distribution Networks Reconfiguration

支路交换算法可快速重构配电网但不能保证得到全局最优解,模拟退火算法能以较大概率搜索到全局最优或近全局最优解,但计算速度慢。结合两者优点,以模拟退火算法帮助支路交换算法避开局部最优并减少模拟退火算法降温次数和每个控制温度下开关变换次数,可从根本上提高计算速度。算例结果证明了该法的可行性。

Branch-exchange can solve networks reconfiguration very fast, but its result may be local optima; using simulated annealing optimize or approximately optimize solution can be gotten, but it needs a great deal of computing time. This paper combines the strongpoint of the two methods, local optima can be avoided by using simulated annealing to help branch-exchange. At the same time, it greatly enhances the efficiency of algorithm through decreasing the times of lowing control temperature and the times of branch-exchange in every control temperature. The result of computation shows the feasibility of the proposed algorithm.