基于基本环矩阵与改进和声搜索算法的配电网重构

Network Reconfiguration Based on Basic Ring Matrix and Improved Harmony Search Algorithm

配电网快速重构的关键之一是避免不可行解的产生。文中提出一种基本环矩阵自动生成算法与无不可行解的编码方法,并利用改进和声搜索算法对网络重构模型进行求解。为充分利用和声记忆库信息,该算法采纳模糊聚类的思想,对和声记忆库考虑概率以及微调概率的确定方法进行了改进,使得二者能随着记忆库粒子信息的变化而自适应变化。对33节点与119节点系统的算例进行了仿真,结果表明改进和声搜索算法较其他算法具有更好的寻优快速性与收敛性,同时也验证了所提出重构模型的有效性。

Avoiding infeasible solutions is essential for fast reconstruction of a distribution network. A coding method without infeasible solutions is put forward by automatically generating the basic ring matrix, and an improved harmony search algorithm is used for solving the networks reconfiguration mathematical model. In order to make full use of the information in the harmony memory bank, the considering probability and trimming probability of the harmony memory bank are improved by imitating the fuzzy clustering method, so both probabilities can adaptively vary with the variation of particle information of the memory bank. Results of simulation on 33 node and 119 node networks show that the improved harmony algorithm has a faster optimization and a better convergence. The validity of this algorithm is also proved by the results.