摘要
支路交换算法可以快速实现配电网重构,但不能保证得到全局最优解,而模拟退火算法可以以较大概率搜索到全局最优或近全局最优解,但计算速度慢。介绍了结合两者优点提出的以模拟退火算法帮助支路交换算法避开局部最优、同时减少模拟退火算法的降温次数和每个控制温度下开关变换次数的算法,从而从根本上提高计算速度,算例结果证明了该算法的可行性。
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.
出处
《华东电力》
北大核心
2004年第11期3-7,共5页
East China Electric Power
关键词
配电网重构
目标函数
罚函数
扰动机制
distribution network reconfiguration
objective function
penalty function
disturbance mechanism
