冯 利, 黄 伟, 王 颖, 王 涛. 基于Pareto多目标遗传算法的输电网扩展规划[J]. 现代电力, 2011, 28(1): 1-4.
引用本文: 冯 利, 黄 伟, 王 颖, 王 涛. 基于Pareto多目标遗传算法的输电网扩展规划[J]. 现代电力, 2011, 28(1): 1-4.
Feng Li, Huang Wei, Wang Ying, Wang Tao. Expansion Planning of Transmission Network Based on Pareto Multi\|objective Genetic Algorithm[J]. Modern Electric Power, 2011, 28(1): 1-4.
Citation: Feng Li, Huang Wei, Wang Ying, Wang Tao. Expansion Planning of Transmission Network Based on Pareto Multi\|objective Genetic Algorithm[J]. Modern Electric Power, 2011, 28(1): 1-4.

基于Pareto多目标遗传算法的输电网扩展规划

Expansion Planning of Transmission Network Based on Pareto Multi\|objective Genetic Algorithm

  • 摘要: 提出将多目标遗传算法应用到输电网扩展规划, 进而将N-1安全准则以罚函数的形式作为算法中多目标的一个目标, 满足输电网规划对安全性的较高要求。本文多目标遗传算法引入最优个体保留策略, 避免优秀个体丢失, 加快收敛速度;N-1安全校验采用故障排序法提高计算效率。最后对一个标准算例进行仿真计算, 结果表明将N-1校验作为多目标的一个目标, 能一步优化出满足输电网N-1安全性要求的解;与传统的单目标遗传算法相比, 本文多目标遗传算法能提供均衡多个目标的最优解。

     

    Abstract: In this paper, the multi\|objective genetic algorithm is applied to expansion planning of transmission network, then N-1 security criteria is taken as one of multiple objectives in the form of the penalty function, which can meet the higher requirement of safety of power grid planning. The optimal elites\|saving strategy is introduced into the multi\|objective genetic algorithm in this paper to avoid the loss of outstanding individuals and accelerate the convergence speed. In addition, fault ordering method is adopted as N-1 security criteria to improve computation efficiency. In the end, a standard example is simulated and the results show that taking N-1 security index as one of multiple objectives can obtain optimal solution that meet the requirement of N-1 security of power grid. In addition, the multi\|objective genetic algorithm will obtain optimal solution through comparing with traditional algorithm.

     

/

返回文章
返回