REACTIVE POWER OPTIMIZATION BY GENETIC ALGORITHM
REACTIVE POWER OPTIMIZATION BY GENETIC ALGORITHM
复制标题
DOI：
10.1109/59.317674
复制
发表时间：
1994-05-01
影响因子：
6.6
通讯作者：
IBA, K
中科院分区：
文献类型：
--
作者：
IBA, K
本文提出了一种基于遗传算法的最佳反应能力计划的新方法。过去提出了许多解决此问题的杰出方法。但是，大多数这些方法都有被捕获到局部最低解决方案的常见缺陷。为离散控制器/银行提供整数值解决方案的整数问题仍然是困难的问题。遗传算法是一种基于自然选择和遗传学的机制的搜索算法。该算法可以使用多个路径搜索全局解决方案，并自然处理整数问题。该提出的方法应用于实用的51个公共汽车和224个总线系统，以显示其可行性和能力。尽管此方法不如复杂的传统方法快，但该概念在即将到来的计算机时代非常有前途且有用。
This paper presents a new approach to optimal reactive power planning based, on a genetic algorithm. Many outstanding methods to this problem have been proposed in the past. However, most these approaches have the common defect of being caught to a local minimum solution. The integer problem which yields integer value solutions for discrete controllers/banks still remain as a difficult one. The genetic algorithm is a kind of search algorithm based on the mechanics of natural selection and genetics. This algorithm can search for a global solution using multiple path and treat integer problem naturally. The proposed method was applied to practical 51-bus and 224-bus systems to show its feasibility and capabilities. Although this method is not as fast as sophisticated traditional methods, the concept is quite promising and useful in the coming computer age.