摘要
采用细菌群体趋药性算法求解电力系统无功优化问题。针对n维变量寻优问题,提出将n维空间的求解问题化简为(n-1)个二维空间求解,并给出了新的求解此二维空间的表达式;针对细菌个体与群体的搜索特点,引入自适应步长,对细菌每次移动过程中的移动步长和方向进行自适应调整;针对细菌迭代过程中寻找到的最优值,引入最优状态板,使最优值不被随机抛弃。这些策略提高了算法运算速度,同时保证算法全局搜索的能力。对IEEE30节点测试,证实该法在无功优化计算中的有效性。
The BCC algorithm is employed to solve the problems of reactive power optimization. The optimization of n-dimensional problem was simplified as the optimization of n - 1 sub-problems of 2-dimension by presenting the new formulation. As for the searching characteristic of a cell and colony, the author introduces self-adaptive step strategy,which automatically adjusts the step length and the direction of bacterium. The bullitn can remain the best direction of bacter which may be abandened at randen. These strategies can also improve the convergence speed and the capability of searching the global minimum. A case study of IEEE 30-bus test system demohstrats the validity of this proposed algorithm.
出处
《东北电力大学学报》
2009年第4期1-6,共6页
Journal of Northeast Electric Power University
关键词
无功优化
细菌群体趋药性算法
自适应步长
reactive power optimization
bacter colony Chemotaxis
self-adaptive step