【摘要】 在对遗传算法深入研究的基础上 ,针对其求解时间过长的问题 ,引入优化搜索路径的思路 ,提出无功功率分层分块优化控制和进化灵敏度分析的方法 ,对常规遗传算法搜索路径的随机性和变异、交叉这两种遗传操作进行本质上的改善。另外 ,在常规无功优化目标函数的基础上 ,提出了包含“调节代价”的目标函数。通过对算例的优化计算结果可以看出 ,文中介绍的无功优化算法比常规算法优越 ,计算速度快 ,实用性强更多还原

【Abstract】 In order to decrease the searching time of genetic algorithm GA ,the concept of optimizing the searching path is introduced. The hierarchical reactive power optimal control and the evolutionary sensitivity analysis methods are proposed to radically overcome the randomness of the searching and improve the mutation,crossover operations of conventional genetic algorithms.Moreover,based on the objective function of conventional reactive power optimization,the objective function including accommodative price is proposed.The computation results indicate this refined GA can increase the searching speed remarkably,and it is more practical.更多还原