基于支路交换和模拟退火的配电网重构算法  

Algorithm for distribution network reconfiguration based on branch-exchange and simulated annealing

作　　者：林海源[1] 李晓明[1] 余平[1] 

机构地区：[1]武汉大学电气学院,湖北武汉430072

出　　处：《华东电力》2004年第11期3-7,共5页East China Electric Power

摘　　要：支路交换算法可以快速实现配电网重构,但不能保证得到全局最优解,而模拟退火算法可以以较大概率搜索到全局最优或近全局最优解,但计算速度慢。介绍了结合两者优点提出的以模拟退火算法帮助支路交换算法避开局部最优、同时减少模拟退火算法的降温次数和每个控制温度下开关变换次数的算法,从而从根本上提高计算速度,算例结果证明了该算法的可行性。The branch-exchange algorithm can be used to realize the distribution network reconfiguration very quickly, but can not ensure overall optima. The simulated annealing algorithm can generally realize overall optima or close to it while the computing speed is low. Combing the merits of the two algorithms, a new algorithm was put forward using the simulated annealing algorithm to help the branch-exchange algorithm to prevent local optima and at the same time the simulated annealing algorithm can be helped to reduce the temperature-lowing times and switching times under every control temperature and thus fundamentally increase the computation speed. Computation example justifies the feasibility of the new algorithm.

关 键 词：配电网重构 目标函数 罚函数 扰动机制 

分 类 号：TM715[电气工程—电力系统及自动化]