提出了一种基于改进二进制粒子群优化算法的网络重构方法,该算法在二进制粒子群优化算法的基础上,通过结合破圈法理论以控制粒子的更新过程,使更新后的粒子100％符合网络的辐射状要求,从而减少了以往网络重构中辐射网判断的环节.此外算法还引入了禁忌搜索算法的思想,克服了粒子群算法易陷入局部最优的缺陷.最后对IEEE 单馈线33节点系统进行计算,证实了算法的有效性,并与相关文献中的算法进行比较,表明算法具有较高的搜索效率和较强的全局寻优能力.%The paper reports a new method for network reconfiguration based on improved binary particle swarm optimization. On the basis of the binary particle swarm optimization and in combination with the breaking circle method, the process of the particle's update is controlled, and the updated particles are made to meet the requirement of the radial network by 100 percent, so that the judgment for the radial network in the previous network reconfiguration is removed. In addition, the taboo search idea is introduced into this method and the defect of PSO, I.e. The tendency of falling into the local optimum, is therefore overcome. Finally, calculations based on the example of IEEE 33-node unit feeder power system are conducted to verify effective eness of the algorithm. Compared with those in other literatures, the algorithm described in this paper has higher searching efficiency and stronger global optimization ability.
展开▼
