A Two-Archive Harris Hawk Optimization for Solving Many-Objective Optimal Power Flow Problems

被引:11
|
作者
Khunkitti, Sirote [1 ]
Premrudeepreechacharn, Suttichai [1 ]
Siritaratiwat, Apirat [2 ]
机构
[1] Chiang Mai Univ, Fac Engn, Dept Elect Engn, Chiang Mai 50200, Thailand
[2] Khon Kaen Univ, Fac Engn, Dept Elect Engn, Khon Kaen 40002, Thailand
关键词
Harris Hawk optimization; metaheuristic algorithms; many-objective optimal power flow; two-archive algorithm; ALGORITHM; EMISSION; COST; DISPATCH; LOSSES;
D O I
10.1109/ACCESS.2023.3337535
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
To improve power system operation and management and accomplish modern power system requirements, a new algorithm named two-archive harris hawk optimization (TwoArchHHO) is proposed to solve many-objective optimal power flow (MaOOPF) problems in this work. For modern power systems, only single-objective and multiobjective (2-3 objectives) optimal power flow problems (MOOPF) are inadequate. So, the problems become many-objective (more than 3 objectives) optimal power flow problem which is more complicated to be solved. Although several metaheuristic algorithms have been proposed to solve MOOPF problems, very few algorithms have been introduced to solve MaOOPF problems and high-performance algorithms are still required to solve MaOOPF problems which are more complicated. To solve the complicated MaOOPF problems, TwoArchHHO is proposed by adding the two-archive concepts of the improved two-archive algorithm into the harris hawk optimization (HHO) in order to enhance the searchability and eventually provide superior solutions. The objective functions considered to be minimized include fuel cost, emission, transmission line loss, and voltage deviation to improve power systems in the economic, environmental, and secure aspects. Several sizes of IEEE standard systems, which are IEEE 30-, 57-, and 118-bus systems, are tested to evaluate the performance of the proposed TwoArchHHO. The simulation results comprise Pareto fronts, best-compromised solutions, and hypervolume analysis are generated and compared with results from several algorithms in the literature. The data provided by the experimental trials and the hypervolume performance metric were examined using statistical testing methods. The results indicate that the TwoArchHHO obtained better optimal solutions than those of the compared algorithms including its traditional algorithms, especially in large systems. Based on the best-compromised solutions, the TwoArchHHO provided one best objective aspect among the compared algorithm for most cases. Based on the hypervolume, the TwoArchHHO generated better hypervolume values than those of the compared algorithms around 33.96% to 99.59% in the tested systems.
引用
收藏
页码:134557 / 134574
页数:18
相关论文
共 50 条
  • [1] A Two-Archive Algorithm with Interactive Mechanism for Many-Objective Optimization
    Liu S.
    Li S.
    Li C.
    Cai C.
    Cheng G.
    Mathematical Problems in Engineering, 2023, 2023
  • [2] An improved indicator-based two-archive algorithm for many-objective optimization problems
    Song, Weida
    Zhang, Shanxin
    Ge, Wenlong
    Wang, Wei
    COMPUTING, 2024, 106 (05) : 1395 - 1429
  • [3] An improved indicator-based two-archive algorithm for many-objective optimization problems
    Weida Song
    Shanxin Zhang
    Wenlong Ge
    Wei Wang
    Computing, 2024, 106 : 1395 - 1429
  • [4] Two-archive method for aggregation-based many-objective optimization
    Cai, Lei
    Qu, Shiru
    Cheng, Guojian
    INFORMATION SCIENCES, 2018, 422 : 305 - 317
  • [5] An ε-domination based two-archive 2 algorithm for many-objective optimization
    WU Tianwei
    AN Siguang
    HAN Jianqiang
    SHENTU Nanying
    Journal of Systems Engineering and Electronics, 2022, 33 (01) : 156 - 169
  • [6] An ε-domination based two-archive 2 algorithm for many-objective optimization
    Wu Tianwei
    An Siguang
    Han Jianqiang
    Shentu Nanying
    JOURNAL OF SYSTEMS ENGINEERING AND ELECTRONICS, 2022, 33 (01) : 156 - 169
  • [7] An improved two-archive artificial bee colony algorithm for many-objective optimization
    Ye, Tingyu
    Wang, Hui
    Zeng, Tao
    Omran, Mahamed G. H.
    Wang, Feng
    Cui, Zhihua
    Zhao, Jia
    EXPERT SYSTEMS WITH APPLICATIONS, 2024, 236
  • [8] Two_Arch2: An Improved Two-Archive Algorithm for Many-Objective Optimization
    Wang, Handing
    Jiao, Licheng
    Yao, Xin
    IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION, 2015, 19 (04) : 524 - 541
  • [9] A Two-Archive Many-Objective Optimization Algorithm Based on D-Domination and Decomposition
    Ye, Na
    Dai, Cai
    Xue, Xingsi
    ALGORITHMS, 2022, 15 (11)
  • [10] A Kriging-Assisted Two-Archive Evolutionary Algorithm for Expensive Many-Objective Optimization
    Song, Zhenshou
    Wang, Handing
    He, Cheng
    Jin, Yaochu
    IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION, 2021, 25 (06) : 1013 - 1027