Hybridized Symbiotic Organism Search Algorithm for the Optimal Operation of Directional Overcurrent Relays

Sulaiman, Muhammad; Ahmad, Ashfaq; Khan, Akhtar Naeem; Muhammad, Shakoor

doi:10.1155/2018/4605769

Cited by 26 publications

(13 citation statements)

References 47 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Biogeography-based optimization (BBO) along with a new hybrid BBO with linear programming (BBO-LP) was used in [14]. Furthermore, Jaya algorithm [15], seeker optimization algorithm (SOA), simulated annealing-based symbiotic organism search (SASOS), and improved group search optimization (IGSO) were used in [16][17][18].…”

Section: Introductionmentioning

confidence: 99%

The Comparison of Lately Proposed Harris Hawks Optimization and Jaya Optimization in Solving Directional Overcurrent Relays Coordination Problem

Kim

2020

Complexity

View full text Add to dashboard Cite

In this paper, a lately proposed Harris Hawks Optimizer (HHO) is used to solve the directional overcurrent relays (DOCRs) coordination problem. To the best of the authors’ knowledge, this is the first time HHO is being used in the DOCRs coordination problem. The main inspiration of HHO is the cooperative behavior and chasing style of Harris’ hawks from different directions, based on the dynamic nature of scenarios and escaping patterns of the prey. To test its performances in solving the DOCRs coordination problem, it is adopted in 3-bus, 4-bus, 8-bus, and 9-bus systems, which are formulated by three kinds of optimization models as linear programming (LP), nonlinear programming (NLP), and mixed integer nonlinear programming (MINLP), according to the nature of the design variables. Meanwhile, another lately proposed optimization algorithm named Jaya is also adopted to solve the same problem, and the results are compared with HHO in aspects of objective function value, convergence rate, robustness, and computation efficiency. The comparisons show that the robustness and consistency of HHO is relatively better than Jaya, while Jaya provides faster convergence rate with less CPU time and occasionally more competitive objective function value than HHO.

show abstract

Section: Introductionmentioning

confidence: 99%

The Comparison of Lately Proposed Harris Hawks Optimization and Jaya Optimization in Solving Directional Overcurrent Relays Coordination Problem

Kim

2020

Complexity

View full text Add to dashboard Cite

show abstract

“…In [29], the CFA was proposed to assess the coordination issues. In [30], a hybrid symbiotic organism optimizer was proposed to resolve OCR issue. In [31], comparative study was done using di erent metaheuristic algorithms.…”

Section: Introductionmentioning

confidence: 99%

Application of the JAYA Algorithm in Solving the Problem of the Optimal Coordination of Overcurrent Relays in Single‐ and Multi‐Loop Distribution Systems

et al. 2019

View full text Add to dashboard Cite

To ensure a safe and trustworthy pattern in contradiction to the possible faults, a precise, reliable, and fast relaying strategy is of high importance in an electrical power system. These challenges give the impression of being more refined in multi-loop distribution systems. More recently, overcurrent relays (OCRs) have evolved as proficient counteragents for such cases. In this way, inaugurating an optimal protection coordination strategy is accepted as the primary precondition in guaranteeing the safe protection of the coordination strategy. This study is aimed at lessening the overall operational time of the main relays in order to reduce the power outages. The coordination problem is conducted by adjusting only one parameter, namely the time multiplier setting (TMS). In electrical power relaying coordination, the objective function to be minimized is the sum of the overall operational time of the main relays. In the prescribed work, the coordination of the OCRs in the single- and multi-loop distribution network is realized as an optimization issue. The optimization is accomplished by means of JAYA algorithm. The suggested technique depends on the idea that the result acquired for a certain issue ought to pass near the finest result and avert the worst result. This technique involves only the common control factors and does not involve specific control factors. JAYA is adopted to OCR problem and run 20 times with the same initial condition for each case study, and it has been realized that for every run, the JAYA algorithm converges to the global optimum values requiring less number of iterations and computational time. The results obtained from JAYA algorithm are compared with other evolutionary and up-to-date algorithms, and it was determined that JAYA outperforms the other techniques.

show abstract

“…Reference [26] suggests that the coordination of the overcurrent relay is formulated as a nonlinear program by employing a group search optimization algorithm. In the paper by [27], the hybridized symbiotic organism search method is used to deal with the directional overcurrent relay problem. The authors found the optimal coordination of directional overcurrent relays by using a firefly algorithm [28].…”

Section: Introductionmentioning

confidence: 99%

Application of a Continuous Particle Swarm Optimization (CPSO) for the Optimal Coordination of Overcurrent Relays Considering a Penalty Method

et al. 2018

View full text Add to dashboard Cite

Abstract:In an electrical power system, the coordination of the overcurrent relays plays an important role in protecting the electrical system by providing primary as well as backup protection. To reduce power outages, the coordination between these relays should be kept at the optimum value to minimize the total operating time and ensure that the least damage occurs under fault conditions. It is also imperative to ensure that the relay setting does not create an unintentional operation and consecutive sympathy trips. In a power system protection coordination problem, the objective function to be optimized is the sum of the total operating time of all main relays. In this paper, the coordination of overcurrent relays in a ring fed distribution system is formulated as an optimization problem. Coordination is performed using proposed continuous particle swarm optimization. In order to enhance and improve the quality of this solution a local search algorithm (LSA) is implanted into the original particle swarm algorithm (PSO) and, in addition to the constraints, these are amalgamated into the fitness function via the penalty method. The results achieved from the continuous particle swarm optimization algorithm (CPSO) are compared with other evolutionary optimization algorithms (EA) and this comparison showed that the proposed scheme is competent in dealing with the relevant problems. From further analyzing the obtained results, it was found that the continuous particle swarm approach provides the most globally optimum solution.

show abstract

Hybridized Symbiotic Organism Search Algorithm for the Optimal Operation of Directional Overcurrent Relays

Cited by 26 publications

References 47 publications

The Comparison of Lately Proposed Harris Hawks Optimization and Jaya Optimization in Solving Directional Overcurrent Relays Coordination Problem

The Comparison of Lately Proposed Harris Hawks Optimization and Jaya Optimization in Solving Directional Overcurrent Relays Coordination Problem

Application of the JAYA Algorithm in Solving the Problem of the Optimal Coordination of Overcurrent Relays in Single‐ and Multi‐Loop Distribution Systems

Application of a Continuous Particle Swarm Optimization (CPSO) for the Optimal Coordination of Overcurrent Relays Considering a Penalty Method

Contact Info

Product

Resources

About