Single and Multi-Objective Optimal Power Flow Based on Hunger Games Search with Pareto Concept Optimization

被引:17
作者
Al-Kaabi, Murtadha [1 ]
Dumbrava, Virgil [1 ]
Eremia, Mircea [1 ]
机构
[1] Univ Politehn Bucuresti, Fac Energy, Dept Power Syst, Bucharest 060029, Romania
关键词
multi-objective optimal power flow (MOOPF); hunger games search (HGS); multi-objective hunger games search (MOHGS); Pareto concept; fuzzy set theory; fuel cost; active power losses; emission; voltage deviation; voltage stability index; PARTICLE SWARM OPTIMIZATION; BEE COLONY ALGORITHM; DIFFERENTIAL EVOLUTION ALGORITHM; LEARNING-BASED OPTIMIZATION; COST; EMISSION; SOLVE;
D O I
10.3390/en15228328
中图分类号
TE [石油、天然气工业]; TK [能源与动力工程];
学科分类号
0807 ; 0820 ;
摘要
In this study, a new meta-heuristic optimization method inspired by the behavioral choices of animals and hunger-driven activities, called hunger games search (HGS), is suggested to solve and formulate the single- and multi-objective optimal power flow problem in power systems. The main aim of this study is to optimize the objective functions, which are total fuel cost of generator, active power losses in transmission lines, total emission issued by fossil-fueled thermal units, voltage deviation at PQ bus, and voltage stability index. The proposed HGS approach is optimal and easy, avoids stagnation in local optima, and can solve multi-constrained objectives. Various single-and multi-objective (conflicting) functions were proposed simultaneously to solve OPF problems. The proposed algorithm (HGS) was developed to solve the multi-objective function, called the multi-objective hunger game search (MOHGS), by incorporating the proposed optimization (HGS) with Pareto optimization. The fuzzy membership theory is the function responsible to extract the best compromise solution from non-dominated solutions. The crowding distance is the strategies carried out to determine and ordering the Pareto non-dominated set. Two standard tests (IEEE 30 bus and IEEE 57 bus systems) are the power systems that were applied to investigate the performance of the proposed approaches (HGS and MOHGS) for solving single and multiple objective functions with 25 studied cases using MATLAB software. The numerical results obtained by the proposed approaches (HGS and MOHGS) were compared to other optimization algorithms in the literature. The numerical results confirmed the efficiency and superiority of the proposed approaches by achieving an optimal solution and giving the faster convergence characteristics in single objective functions and extracting the best compromise solution and well-distributed Pareto front solutions in multi-objective functions.
引用
收藏
页数:31
相关论文
共 68 条
[1]   Differential search algorithm for solving multi-objective optimal power flow problem [J].
Abaci, Kadir ;
Yamacli, Volkan .
INTERNATIONAL JOURNAL OF ELECTRICAL POWER & ENERGY SYSTEMS, 2016, 79 :1-10
[2]   An improved version of salp swarm algorithm for solving optimal power flow problem [J].
Abd El-sattar, Salma ;
Kamel, Salah ;
Ebeed, Mohamed ;
Jurado, Francisco .
SOFT COMPUTING, 2021, 25 (05) :4027-4052
[3]   Single- and multi-objective optimal power flow frameworks using Jaya optimization technique [J].
Abd El-Sattar, Salma ;
Kamel, Salah ;
El Sehiemy, Ragab A. ;
Jurado, Francisco ;
Yu, Juan .
NEURAL COMPUTING & APPLICATIONS, 2019, 31 (12) :8787-8806
[4]  
Abde-Rahim A-MM., 2019, 2019 INNOVATIONS POW, V1, P1
[5]   Multi-Objective Differential Evolution for Optimal Power Flow [J].
Abido, M. A. ;
Al-Ali, N. A. .
2009 INTERNATIONAL CONFERENCE ON POWER ENGINEERING, ENERGY AND ELECTRICAL DRIVES, 2009, :101-+
[6]  
Abido M.A., 2004, Universities Power Engineering Conference, V1, P457
[7]   Artificial bee colony algorithm for solving multi-objective optimal power flow problem [J].
Adaryani, M. Rezaei ;
Karami, A. .
INTERNATIONAL JOURNAL OF ELECTRICAL POWER & ENERGY SYSTEMS, 2013, 53 :219-230
[8]  
Al-Bahrani L., 2022, Int. J. Electr. Electron. Eng. Telecommun., V11, P146
[9]  
Al-Bahrani L, 2020, UNIV POLIT BUCHAR S, V82, P247
[10]  
Al-Kaabi M, 2022, 2022 14 INT C EL COM, P1, DOI [10.1109/ECAI54874.2022.9847456, DOI 10.1109/ECAI54874.2022.9847456]