Solving optimal power flow problems via a constrained many-objective co-evolutionary algorithm

被引:6
|
作者
Tian, Ye [1 ,2 ]
Shi, Zhangxiang [2 ]
Zhang, Yajie [3 ]
Zhang, Limiao [1 ]
Zhang, Haifeng [4 ]
Zhang, Xingyi [3 ]
机构
[1] Anhui Univ, Informat Mat & Intelligent Sensing Lab Anhui Prov, Hefei, Peoples R China
[2] Anhui Univ, Inst Phys Sci & Informat Technol, Hefei, Peoples R China
[3] Anhui Univ, Sch Comp Sci & Technol, Hefei, Peoples R China
[4] Anhui Univ, Sch Math Sci, Hefei, Peoples R China
基金
中国国家自然科学基金;
关键词
optimal power flow; constrained optimization; many-objective optimization; co-evolutionary algorithms; metaheuristics; MOEA/D; STRATEGY;
D O I
10.3389/fenrg.2023.1293193
中图分类号
TE [石油、天然气工业]; TK [能源与动力工程];
学科分类号
0807 ; 0820 ;
摘要
The optimal power flow problem in power systems is characterized by a number of complex objectives and constraints, which aim to optimize the total fuel cost, emissions, active power loss, voltage magnitude deviation, and other metrics simultaneously. These conflicting objectives and strict constraints challenge existing optimizers in balancing between active power and reactive power, along with good trade-offs among many metrics. To address these difficulties, this paper develops a co-evolutionary algorithm to solve the constrained many-objective optimization problem of optimal power flow, which evolves three populations with different selection strategies. These populations are evolved towards different parts of the huge objective space divided by large infeasible regions, and the cooperation between them renders assistance to the search for feasible and Pareto-optimal solutions. According to the experimental results on benchmark problems and the IEEE 30-bus, IEEE 57-bus, and IEEE 118-bus systems, the proposed algorithm is superior over peer algorithms in solving constrained many-objective optimization problems, especially the optimal power flow problems.
引用
收藏
页数:13
相关论文
共 50 条
  • [21] A new evolutionary algorithm based on contraction method for many-objective optimization problems
    Dai Cai
    Wang Yuping
    Ye Miao
    APPLIED MATHEMATICS AND COMPUTATION, 2014, 245 : 191 - 205
  • [22] Optimal Foraging Algorithm That Incorporates Fuzzy Relative Entropy for Solving Many-Objective Permutation Flow Shop Scheduling Problems
    Zhu, Guang-Yu
    Ding, Chen
    Zhang, Wei-Bo
    IEEE TRANSACTIONS ON FUZZY SYSTEMS, 2020, 28 (11) : 2738 - 2746
  • [23] A Hybrid Co-evolutionary Particle Swarm Optimization Algorithm for Solving Constrained Engineering Design Problems
    Zhou, Yongquan
    Pei, Shengyu
    JOURNAL OF COMPUTERS, 2010, 5 (06) : 965 - 972
  • [24] Many-objective optimization with dynamic constraint handling for constrained optimization problems
    Li, Xi
    Zeng, Sanyou
    Li, Changhe
    Ma, Jiantao
    SOFT COMPUTING, 2017, 21 (24) : 7435 - 7445
  • [25] A Many-Objective Evolutionary Algorithm Based on Indicator and Decomposition
    Xia, Yizhang
    Huang, Jianzun
    Li, Xijun
    Liu, Yuan
    Zheng, Jinhua
    Zou, Juan
    MATHEMATICS, 2023, 11 (02)
  • [26] Objective Extraction for Many-Objective Optimization Problems: Algorithm and Test Problems
    Cheung, Yiu-ming
    Gu, Fangqing
    Liu, Hai-Lin
    IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION, 2016, 20 (05) : 755 - 772
  • [27] Two-Step Many-Objective Optimal Power Flow Based on Knee Point-Driven Evolutionary Algorithm
    Li, Yahui
    Li, Yang
    PROCESSES, 2018, 6 (12)
  • [28] Indicator and reference points co-guided evolutionary algorithm for many-objective optimization problems
    Dai, Guangming
    Zhou, Chong
    Wang, Maocai
    Li, Xiangping
    KNOWLEDGE-BASED SYSTEMS, 2018, 140 : 50 - 63
  • [29] An adaptive convergence enhanced evolutionary algorithm for many-objective optimization problems
    Xu, Ying
    Zhang, Huan
    Zeng, Xiangxiang
    Nojima, Yusuke
    SWARM AND EVOLUTIONARY COMPUTATION, 2022, 75
  • [30] Solving Many-Objective Optimization Problems by a Pareto-Based Evolutionary Algorithm With Preprocessing and a Penalty Mechanism
    Liu, Yuan
    Zhu, Ningbo
    Li, Miqing
    IEEE TRANSACTIONS ON CYBERNETICS, 2021, 51 (11) : 5585 - 5594