摘要
提出一种改进的和声搜索算法,并将其应用在求解配电网络重构的复杂问题中。在初始化和声库时,引入混沌序列;同时在产生新的和声时,有效利用和声库中最优解的信息,在最优解的基础上进行扰动生成额外两个新解,以加快算法的收敛速度;最后,当算法陷入到某个局部最优解时,随机产生一组和声,再引入整体分布优化算法对其进行简单寻优,使算法迅速跃出局部最优。对IEEE33节点测试系统进行了仿真分析计算,结果说明该算法是可行的,并且该改进算法的寻优效率和收敛性都较好。
This paper presents an improved harmony search algorithm and uses it to solve the complex problems of distribution network reconfiguration. The paper introduces the chaotic sequence at initializing the harmony memory;and takes full advantage of the optimal solution in harmony memory in generating new harmonies at the same time. Based on the optimal solution two additional new solutions are generated by perturbing to increase the convergence speed. Finally,when the algorithm falls into a local optimum, a set of harmonies is generated randomly and an entire distribution optimization algorithm is then introduced for a simple optimization so that the algorithm can jump out of the local optimal algorithm quickly. The calculation results of the IEEE33 node test system show that the algorithm is feasible,and the method performs better in optimization efficiency and convergence.
出处
《电网与清洁能源》
北大核心
2015年第10期94-98,共5页
Power System and Clean Energy
关键词
和声搜索算法
配网重构
节能降损
harmony search algorithm
network reconfiguration
energy saving and loss reduction
