Optimizing performance attributes of electric power systems using chaotic salp swarm optimizer

被引:20
作者
Bentouati, Bachir [1 ]
Javaid, M. S. [2 ]
Bouchekara, H. R. E. H. [2 ]
El-Fergany, Attia A. [3 ]
机构
[1] Amar Telidji Univ Laghouat, Dept Elect Engn, Laghouat, Algeria
[2] Univ Hafr Al Batin, Dept Elect Engn, Hafar al Batin, Saudi Arabia
[3] Zagazig Univ, Fac Engn, Dept Elect Power & Machines, Zagazig, Egypt
关键词
Optimal power flow; economic operation; emission minimization; voltage profile enhancements; chaotic salp swarm optimization algorithm; logistic maps; BIOGEOGRAPHY-BASED OPTIMIZATION; FLOW PROBLEM; ALGORITHM; EMISSION; COST;
D O I
10.1080/17509653.2019.1677197
中图分类号
C93 [管理学]; O22 [运筹学];
学科分类号
070105 ; 12 ; 1201 ; 1202 ; 120202 ;
摘要
This paper investigates the performance of a chaotic salp swarm optimization (CSSO) algorithm for solving optimal power flow (OPF) problems. The proposed CSSO-based method is applied on five different types of objective functions (OFs) which include generation costs minimization, environmental pollution/emission reduction, minimizing the transmission active power losses, enhancing the voltage profile, and upgrading system stability. Single and multi-objective frameworks are considered to attain various operational, economic, environmental and technical benefits. Initially, single OFs are used to formulate the optimization problem, and at later stage, simultaneous multiple objectives are optimized subject to a set of equality and inequality constraints. To prove the viability of the proposed CSSO-based OPF, standard IEEE 30-bus and 57-bus test systems via 16 studied cases are investigated. In addition, the subsequent cropped results are compared with other competing recent optimization methods in the literature. It can be reported that the cropped best fuel costs when they are optimized using the CSSO are 798.93 $/h and 41,666.66 $/h for the IEEE 30-bus and 57-bus test cases, respectively. The numerical results and performance tests along with comprehensive comparisons clearly indicate the superiority of the CSSO in achieving the given objectives.
引用
收藏
页码:165 / 175
页数:11
相关论文
共 50 条
[1]   Solving Non-Smooth Optimal Power Flow Problems Using a Developed Grey Wolf Optimizer [J].
Abdo, Mostafa ;
Kamel, Salah ;
Ebeed, Mohamed ;
Yu, Juan ;
Jurado, Francisco .
ENERGIES, 2018, 11 (07)
[2]   Economic dispatch using chaotic bat algorithm [J].
Adarsh, B. R. ;
Raghunathan, T. ;
Jayabarathi, T. ;
Yang, Xin-She .
ENERGY, 2016, 96 :666-675
[3]   Optimal power flow solution in power systems using a novel Sine-Cosine algorithm [J].
Attia, Abdel-Fattah ;
El Sehiemy, Ragab A. ;
Hasanien, Hany M. .
INTERNATIONAL JOURNAL OF ELECTRICAL POWER & ENERGY SYSTEMS, 2018, 99 :331-343
[4]   A chaotic krill herd algorithm for optimal solution of the economic dispatch problem [J].
Bentouati B. ;
Chettih S. ;
El-Sehiemy R.A. .
International Journal of Engineering Research in Africa, 2017, 31 :155-168
[5]   Application of biogeography-based optimisation to solve different optimal power flow problems [J].
Bhattacharya, A. ;
Chattopadhyay, P. K. .
IET GENERATION TRANSMISSION & DISTRIBUTION, 2011, 5 (01) :70-80
[6]   Optimal power flow using black-hole-based optimization approach [J].
Bouchekara, H. R. E. H. .
APPLIED SOFT COMPUTING, 2014, 24 :879-888
[7]   Optimal Power Flow Using Differential Search Algorithm [J].
Bouchekara, Houssem Rafik El-Hana ;
Abido, Mohamed Ali .
ELECTRIC POWER COMPONENTS AND SYSTEMS, 2014, 42 (15) :1683-1699
[8]   Optimal power flow using gravitational search algorithm [J].
Duman, Serhat ;
Guvenc, Ugur ;
Sonmez, Yusuf ;
Yorukeren, Nuran .
ENERGY CONVERSION AND MANAGEMENT, 2012, 59 :86-95
[9]   Salp swarm optimizer to solve optimal power flow comprising voltage stability analysis [J].
El-Fergany, Attia A. ;
Hasanien, Hany M. .
NEURAL COMPUTING & APPLICATIONS, 2020, 32 (09) :5267-5283
[10]   Tree-seed algorithm for solving optimal power flow problem in large-scale power systems incorporating validations and comparisons [J].
El-Fergany, Attia A. ;
Hasanien, Hany M. .
APPLIED SOFT COMPUTING, 2018, 64 :307-316