摘要
传统的遗传算法解无功优化问题,存在着随机性大、过早收敛而陷入局部最优、计算复杂等缺点。本文在原有的遗传算法基础上提出了基因库和基因重组两个新的概念,对算法进行了改进。在每一次进化过程中不是优化某个个体而是对基因库进行优化,进化一次之后重新进行基因重组生成新的父代。本文对IEEE-14标准网络进行算例分析,结果优于传统遗传算法,真实有效。
Using traditional genetic algonthm（GA） to salve VAR optimization, the result is usually random, and may not get the best result of overall for too early ending, and the process of calculation is also very complex. To bridge the problems, the document refers two new ideas, the gene pool and the gene reorganization, and improves the old algorithm. The new algorithm does not optimize one individual, but the gene pool in every process of evolution. The gene reorganization is necessary for forming the senior generation individual after the last time evolution. The calculation for IEEE-14 system shows that the new algorithm is better than old, the result is real and valid.
出处
《现代机械》
2005年第4期70-72,80,共4页
Modern Machinery
