检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]华北电力大学电气与电子工程学院,北京市昌平区102206
出 处:《电网技术》2012年第1期108-112,共5页Power System Technology
基 金:国家863高技术基金项目(2008AA05Z216)~~
摘 要:针对传统粒子群优化算法"早熟"与后期收敛速度慢的缺点,提出了一种基于并行自适应粒子群优化算法的电力系统无功优化方法。该方法首先将初始种群随机划分成N个子群,然后分别在各子群中以所提方法寻优,从而实现了算法的并行计算。为避免各子群陷入局部最优解,采用二值交叉算子使各子群间的信息共享并更新相关粒子位置,保证了算法的全局搜索能力并维持了种群的多样性。同时,各子群寻优过程中,根据利己、利他及自主3个方向对当前搜索方向自适应更新,提高了算法的收敛速度。将所提出算法在IEEE 30节点系统上进行了仿真验证,结果证明了并行自适应粒子群算法用于无功优化的可行性和有效性。There are defects in traditional particle swarm optimization (PSO) algorithm, i.e., its prematurity and slow convergence speed in the late evolutionary phase. For this reason, a method for power system reactive power optimization based on a parallel adaptive PSO (PAPSO) algorithm is proposed. Firstly, the initial population is divided into N subpopulations stochastically; then the search in each subpopulation is performed individually by the proposed method, thus the parallel calculation of the adaptive PSO algorithm is implemented. To avoid the search in subpopulations falls into local optimal solution, the two-value crossover operator is led in to exchange the information among subpopulations and update the position of related particles, thus the global search ability of the algorithm is ensured and the diversity of population can be kept. During the search process in each subpopulation, current search direction is adaptively updated in accordance with egotistic direction, altruistic direction and pro-activeness direction to improve the convergence speed of the algorithm. Simulation results of IEEE 30-bus system show that as for reactive power optimization the proposed algorithm is feasible and effective.
关 键 词:无功优化 并行自适应粒子群算法 电力系统 搜索方向
分 类 号:TM712[电气工程—电力系统及自动化]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:18.218.108.184