In electrical engineering problems, bio- and nature-inspired optimization techniques are valuable ways to minimize or maximize an objective function. We use the root tree algorithm (RTO), inspired by the random movement of roots, to search for the global optimum, in order to best solve the problem of overcurrent relays (OCRs). It is a complex and highly linear constrained optimization problem. In this problem, we have one type of design variable, time multiplier settings (TMSs), for each relay in the circuit. The objective function is to minimize the total operating time of all the primary relays to avoid excessive interruptions. In this paper, three case studies have been considered. From the simulation results, it has been observed that the RTO with certain parameter settings operates better compared to the other up-to-date algorithms.

The model of directional over current relays (DOCRs) coordination is considered as an optimization problem. It is generally formulated as linear programming (LP), non-linear programming (NLP) and mixed integer non-linear programming (MINLP), according to the nature of the design variables. For each kind of formulation, the main goal is to minimize the summation of operating times of primary relays, by setting optimal values for decision variables as time dial setting (TDS) and pickup current setting (IP) or plug setting (PS). In this paper, we proposed an oppositional Jaya (OJaya) algorithm with distance-adaptive coefficient (DAC), to effectively solve the DOCRs coordination problem. Firstly, by oppositional learning (OL), the searching space of Jaya is expanded and the diversity of its population is strengthened; secondly, by DAC, the population’s trends of running towards the best position and escaping from the worst position is accelerated. The performance of OJaya is evaluated by 3-bus, 8-bus, 9-bus and 15-bus testing systems, in aspects of convergence rate, objective function value, robustness and computation efficiency. The results indicate the effectiveness and superiority of OJaya in solving DOCRs coordination problems compared with standard Jaya.

The economic load dispatch (ELD) problem is an optimization problem of minimizing the total fuel cost of generators while satisfying power balance constraints, operating capacity limits, ramp-rate limits and prohibited operating zones. In this paper, a novel multi-population based chaotic JAYA algorithm (MP-CJAYA) is proposed to solve the ELD problem by applying the multi-population method (MP) and chaotic optimization algorithm (COA) on the original JAYA algorithm to guarantee the best solution of the problem. MP-CJAYA is a modified version where the total population is divided into a certain number of sub-populations to control the exploration and exploitation rates, at the same time a chaos perturbation is implemented on each sub-population during every iteration to keep on searching for the global optima. The proposed MP-CJAYA has been adopted to ELD cases and the results obtained have been compared with other well-known algorithms reported in the literature. The comparisons have indicated that MP-CJAYA outperforms all the other algorithms, achieving the best performance in all the cases, which indicates that MP-CJAYA is a promising alternative approach for solving ELD problems.

In power systems protection, the optimal coordination of directional overcurrent relays (DOCRs) is of paramount importance. The coordination of DOCRs in a multi-loop power system is formulated as an optimization problem. The main objective of this paper is to develop the whale optimization algorithm (WOA) for the optimal coordination of DOCRs and minimize the sum of the operating times of all primary relays. The WOA is inspired by the bubble-net hunting strategy of humpback whales which leads toward global minima. The proposed algorithm has been applied to six IEEE test systems including the IEEE three-bus, eight-bus, nine-bus, 14-bus, 15-bus, and 30-bus test systems. Furthermore, the results obtained using the proposed WOA are compared with those obtained by other up-to-date algorithms. The obtained results show the effectiveness of the proposed WOA to minimize the relay operating time for the optimal coordination of DOCRs.

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.