Complexity

Complexity / 2018 / Article

Research Article | Open Access

Volume 2018 |Article ID 7039790 | 15 pages | https://doi.org/10.1155/2018/7039790

Improved Solutions for the Optimal Coordination of DOCRs Using Firefly Algorithm

Academic Editor: Arturo Buscarino
Received09 Oct 2017
Revised24 Dec 2017
Accepted11 Jan 2018
Published11 Feb 2018

Abstract

Nature-inspired optimization techniques are useful tools in electrical engineering problems to minimize or maximize an objective function. In this paper, we use the firefly algorithm to improve the optimal solution for the problem of directional overcurrent relays (DOCRs). It is a complex and highly nonlinear constrained optimization problem. In this problem, we have two types of design variables, which are variables for plug settings (PSs) and the time dial settings (TDSs) for each relay in the circuit. The objective function is to minimize the total operating time of all the basic relays to avoid unnecessary delays. We have considered four models in this paper which are IEEE (3-bus, 4-bus, 6-bus, and 8-bus) models. From the numerical results, it is obvious that the firefly algorithm with certain parameter settings performs better than the other state-of-the-art algorithms.

1. Introduction

Power systems in electrical engineering function at contrary voltage levels ranging from 415 V to 400 KV or even more. Power systems consist of three parts: production, supply, and usage of the power generated. Moreover, supply lines, which transmit the power, are not insulated. These lines undergo irregularities more often than other domains of the system due to several causes like production of overcurrent due to lightening. These irregularities disrupt the provision of power and often result in the impairment of the other equipment attached to the power system. Thus, it is necessary to take protective measures in case this happens. To overcome this difficulty, overcurrent relays (OCRs) are commonly used as a safety strategy in the power system to avoid disruption in power supply and other technical faults. Hence, directional OCRs are easy to use and are an economic option for the safety of the attached subtransmission power systems and secondary layer of backup protection in transmission systems [1].

During the design of a power system, the coordination of these DOCRs is an important aspect to keep in mind. DOCRs are logical elements and are placed at both ends of a line, which helps the breaker in case any fault arises. Moreover, DOCRs are supplied in electrical power systems to disable the faulted portions of the power systems. The problem of DOCRs is to decide which portions of the system are to function during a fault so that the faulty part is detached and does not stop the whole system, with certain constraints like adequate coordination tolerance and without extra disruptions. This procedure is mainly based on the networking of the system, nature of relays, and other protection measures as in [2]. We have two types of design variables: variables for plug settings (PSs) and the time dial settings (TDSs) for each relay in the circuit. After optimizing the design settings, the faulty lines are isolated, thus ensuring continuous supply of power to the remaining parts of the system.

In this article, the problem of DOCRs in a power system is handled with the firefly algorithm (FA) using the standard benchmark IEEE (3-, 4-, 6-, and 8-bus, resp.) systems [1, 35], as presented in Figures 8, 9, 10, and 11. The two types of decision variables are named PS and TDS. The objective of this problem is to minimize the total operating time taken by primary relays. Primary relays are expected to isolate the faulty lines satisfying the constraints on design variables.

The rest of the paper is organized as follows. In Section 2, we briefly recall different algorithms used in the literature to solve the problem of DOCRs. In Section 3, we elaborate the mathematical formulation of the problem. The firefly algorithm (FA) is recalled in Section 4. Parameter settings and statistical and graphical results are discussed in Section 5. Section 6 concludes the present study.

2. Literature Review

Initially, a trial-and-error approach was used by researchers, which consumed a large number of iterations to reach an optimal relay setting. Thus, many scientists and researchers adopted the setting of DOCRs, depending on experience. In particular, although [1] uses linear programming, however, it also uses a change of variables to convert the nonlinear problem to a linear problem, without any approximation. The problem is solved linearly in terms of the TDS and PS variables, and then after the linear solution is reached, the roots of these nonlinear expressions (TDS and PS) must be found to reach the solution for TDS and PS. In [1], the application of optimization techniques was first reported for this problem. A literature review on this problem can be found in [2]. Previously, the problem of DOCRs was handled with different techniques, like curve fitting, graph theoretical approach, and classical optimization techniques. Furthermore, a version of sparse dual revised simplex algorithm was used to solve the problem assuming nonlinear PS settings to optimize the remaining variables as for TDS settings [6]. Other techniques in linear programming, to solve the problem of DOCRs, used by [710] have optimized the TDS and PS settings using the simplex algorithm and the Rosenbrock hill-climbing algorithm to solve the problem.

Nature-inspired algorithms (NIAs) and artificial intelligence (AI) based techniques have been gaining the attention of researchers recently [12, 13]. The NIAs which have been used to tackle the problem of DOCRs include, but are not limited to, particle swarm optimization (PSO) [14, 15], genetic algorithm (GA) [4, 16], modified evolutionary programming, and evolutionary programming. Expert systems [1720] and fuzzy logic [21] are applications of AI algorithms to tackle the problem of DOCRs. A random search algorithm (RST-2) was applied to tackle the problem of DOCRs using IEEE 6-, 4-, and 3-bus models, respectively [2].

Firefly algorithm (FA) is a well-known and reliable nature-inspired algorithm for solving complex and highly nonlinear constrained optimization problems, and as far as the authors know FA is not implemented for optimization of DOCR settings using IEEE 3-, 4-, 6-, and 8-bus systems which are presented in this paper. We have implemented FA to solve the problem of DOCR settings and the outcomes of our simulations are compared with other state-of-the-art algorithms.

3. Problem Formulation

Determining the direction of flow of current in an electrical circuit is the job of a protection system placed in a circuit. In case a fault arises, the protection system passes the signals to the associated switch. DOCRs are useful tools to handle the situation when there are fault currents flowing in both directions. These relays operate when current flow is detected in the opposite direction. Loop systems and parallel feeders include DOCRs, because these feeders have current flowing from both ends.

There are two units of a DOCR; the first unit, which is known as the instantaneous current settings, is activated when the current is above a defined threshold. On the other hand, when the current is below a defined limit, time-delay unit is operated. This unit is activated when a fault happens with a time delay. These are two types of settings associated with the delay unit, which are named as follows:(i)Time dialing settings (TDSs)(ii)Plug settings (PSs) (e.g., tap setting)

The TDS points out the delayed relay, whenever the value of fault current either reaches or exceeds the picking current value. PS represents a value of the picking current for a relay [2].

3.1. Problem Formulation and Explanation

The mathematical formulation of the problem is the same as given in [4]. We have tackled the problem with the firefly algorithm. The relay working time is a nonlinear relation of the dependent variables TDS and PS and the fault current denoted by observed by the corresponding relay. So, the equation for the relay operating time is given byand the variables TDS and PS are to be determined. , , and take the values 0.14, 0.02, and 1.0, respectively, as per [IEEE Std. (1997)]. These constants define the behavior of DOCR in terms of operating time. The value of CT keeps a level of current which is suitable for a relay. And defines the number of windings in a current transformer (CT). Each relay is attached to a “CT,” which makes a known value. The fault current represented by is continuously measured by instruments. The line in the system is directly proportional to the number of constraints. Details of lines involved in different systems are furnished in Table 6. It is worth noting that, in real power systems, several types of relays operate besides DOCRs. The involvement of other types of relays along with DOCRs further complicates the problem by imposing more constraints as shown in Table 6.

3.2. The Objective and Limitations of the Problem

DOCRs need to be coordinated optimally, where optimization techniques, like firefly algorithm, minimize the corresponding objective function according to boundary and coordination limitations. The primary relay is used to clear the fault. The close-in fault is a fault which is close to the relay while a fault occurring at a far end is called a far-bus fault. By convention, the objective function is the summation of the operation time of all initial relays which clears any close-in and far-bus faults. The objective function is given byIn (2), represent close-in fault relays, while denotes the number of far-bus fault relays. Also, shows the working time of the primary close-in fault for the relay. is the working time of the primary far-bus fault for the relay.

The following are the constraints.

(1) Limits on Decision Variables TDSs.where varies from 1 to . The lowest value for is which is 0.05 and the highest value is which is 1.1.

(2) Limits on Decision Variables PSs.where varies from 1 to . is the lowest value which is 1.25 and is the highest value of which is 1.50.

(3) Bounds on Initial Working Times. According to this constraint, each term of the objective is bounded in the interval .

(4) Constraints on the Selection of Pairs of the Relays.where is the working time of backup relay, is the working time of primary relay, and CTI is the coordinating time interval.

3.3. The IEEE 3-Bus System

In this problem, the values of and are taken as 6 which is twice the number of lines involved. There are 12 decision variables, namely, to and to . Figure 8 represents the model for the 3-bus system. The objective (objftn) to be minimized is given inwhere

The rest of the constants , , , and are given in Table 7; see the Appendix.

Descriptions of different constraints for the model are given below.

Limits on Variables TDSs., where starts from 1 and varies to 6 ().

Limits on Variables PSs., where starts from 1 and varies to 6 ().

Bounds on Initial Working Time. According to this constraint, each term of the objective is bounded in the interval .

Constraints on the Selection of Pairs of the Relays.where is the working time of the backup relay and is the working time of the primary relay. The value of CTI is 0.3. Here,Table 8 represents the values of constants , and .

3.4. The IEEE 4-Bus System

In this problem, the values of and are taken as 8 which is twice the number of lines involved. There are 16 decision variables, namely, to and to . Figure 9 represents the model for the 4-bus system. The value of CTI for this system is 0.3. There are 9 selectivity constraints. The mathematical form for this model will be as in (6) with . The rest of the constants , , , and and for the 4-bus system are given in Tables 9 and 10; see the Appendix.

3.5. The IEEE 6-Bus System

This problem of coordination of DOCRs is named the IEEE 6-bus system; both and take a value equal to 14. Basically, this problem is comprised of 28 design variables (two for each relay), that is, to and to . Figure 10 represents the model for the 6-bus system. CTI takes the value 0.2. For the current sample of the 6-bus system, there are 38 selectivity constraints for all faults detected by the corresponding relay. Considering the observations given in [2], 10 constraints are relaxed. The mathematical form for this model will be as in (6). The rest of the constants , , , and and for the 6-bus system are given in Tables 11 and 12; see the Appendix.

3.6. The IEEE 8-Bus System

The last model investigated in this study is the 8-bus system as shown in Figure 11. The mathematical form of this model will be as in (6). It consists of 8 buses, 14 relays, 7 lines, 2 transformers, and 2 generators. The main characteristics of this system are given in Tables 13 and 14. Therefore, this 8-bus system has 28 design variables and 40 constraints [3].

4. Firefly Algorithm

The firefly algorithm was introduced by Yang in [11], and it simulates the flashing phenomena of fireflies. To simulate the idea, the following assumptions are made [9, 11].

All fireflies are of the same gender. Brighter fireflies have greater attraction than others with less brightness. The attraction will decrease with the increase in distance between fireflies. If none of the fireflies is brighter than a specific one, then it will move randomly.

The landscape of the given objective function affects the brightness of a firefly [11]. For a maximization problem, the relation of brightness and the objective function can be represented as . The second assumption can be represented mathematically as in (10) and (11).where is the actual intensity of light and is called the light absorption coefficient. The attractiveness can be related as follows:where represents the distance between two fireflies and is their actual attractiveness at . The distance between two fireflies at positions and can be calculated as follows:where is the th component of the spatial coordinate of the th firefly. The movement of a firefly which is attracted to another more attractive (brighter) firefly is determined byHere, is a random parameter in the interval . And rand is a random number drawn from a uniform Gaussian distribution in . A pseudocode for the firefly algorithm is given in Algorithm 1.

(1) Objective function ,  
(2) Initialize a population of fireflies ,  
(3) Calculate the light intensity at by
(4) Define light absorption coefficient
(5) While (< MaxGeneration)
(6) for : all fireflies
(7) for : all fireflies
(8) Calculate the distance between and using Cartesian distance equation
(9) if  
(10) Attractiveness varies with distance via
(11) Move firefly towards in all dimensions
(12) end if
(14) Evaluate new solutions and update light intensity
(15) end for
(16) end for
(17) Rank the fireflies and find the current best
(18) end while

5. Simulation Settings and Discussion on Results

For a fair comparison, the population size is fixed. We have executed FA a fixed number of times to get better values for the decision variables. Based on the analysis given in [2], the size of the population is fixed as 50, the constant CR is taken as 0.5, and the scaling factor (F) is set as 0.5 for differential evolution. The stopping criterion is either that the algorithm completes 1000 generations or that we get an optimal value which satisfies the following condition: . Here, is the objective value. Constraints are handled using the penalty function approach. All experiments are repeated 30 times and a global optimum solution is recorded for each algorithm.

The best solutions obtained by FA and other versions of DE for the IEEE 3-bus model in terms of best decision features, minimum objective function value, and number of function evaluations taken to complete each simulation are given in Table 1 and Figures 1 and 2. Here, it is evident that, in terms of the objective function value, DE gave the worse objective value (4.8422) and all the other versions of the DE algorithm gave almost similar values. On the other hand, FA gave us an objective value of 4.6557, which is much better than other algorithms. However, if we compare the number of function evaluations (NFE), then the performance of DE and its variants is worse as compared to the FA algorithm as it took only 25200 NFE to complete the simulations. Thus, FA is significantly better than all the other algorithms under consideration.


DE MDE-1MDE-2MDE-3MDE-4MDE-5FA

0.0500 0.0500 0.0500 0.0500 0.0500 0.0500 0.0500
0.2194 0.2178 0.1979 0.1988 0.1976 0.19760.3512
0.05000.0500 0.05000.05000.0500 0.05000.0500
0.21350.2090 0.2094 0.2090 0.20900.20900.3518
0.19498 0.18120.18470.18120.1812 0.18120.1290
0.19530.18070.18270.1807 0.18060.18060.1222
1.250 1.2501.2501.2501.250 1.2501.3583
1.2501.2501.4999 1.48491.4999 1.5001.4107
1.25001.2501.250 1.250 1.2501.2501.3950
1.46051.49991.4999 1.49991.49991.5001.2500
1.250 1.5001.43181.4998 1.4999 1.5001.3109
1.2501.49991.46191.49991.49991.5001.2789
F4.84224.80707 4.7873 4.7822 4.7806 4.78064.6557
NFE 783607235073350 97550692703825025200

The simulation results of the IEEE 4-bus model are given in Table 2 and Figures 3 and 4. It is observed for the IEEE 4-bus model that DE algorithm and all the variants of the DE algorithm performed in a similar manner in terms of objective function values with MDE-4 giving a slightly better value than other variant algorithms of DE. But FA outperformed the algorithms under consideration in terms of the number of function evaluations (NFE). Better performance was shown by FA, which took 35500 NFE to converge to a solution 3.5624.


DE MDE-1MDE-2MDE-3MDE-4MDE-5FA

0.0500 0.0500 0.0500 0.0500 0.0500 0.05000.0500
0.2248 0.2121 0.21230.2121 0.21210.21210.0920
0.0500 0.05000.0500 0.0500 0.0500 0.05000.0500
0.15150.15150.15150.15150.1515 0.15150.0687
0.1264 0.1264 0.1264 0.12640.1262 0.12640.0725
0.05000.05000.0500 0.05000.05000.05000.0500
0.1337 0.1338 0.13710.13380.1337 0.13370.0871
0.05000.05000.05000.0500 0.05000.05000.0500
1.27341.2733 1.27331.27331.2501.27341.3964
1.2501.49981.49591.500 1.5001.49991.3885
1.25001.25001.2500 1.250 1.250 1.25001.3102
1.49971.49961.4997 1.4995 1.5001.49991.4686
1.49971.5001.500 1.4997 1.500 1.5001.4236
1.2501.25001.250 1.250 1.2501.25001.3177
1.5001.49971.42741.4995 1.4998 1.5001.3697
1.2501.2501.250 1.250 1.250 1.2501.3729
F3.67743.66943.67343.66923.66743.66943.5624
NFE95400434006720099700551003533035500

Furthermore, the results for the IEEE 6-bus model as in Table 3 and Figures 5 and 6, in terms of the best objective function value, are again slightly different from each other with MDE-4 and MDE-5 giving slightly improved solutions than other variant algorithms of DE. On the other hand, FA gave us an objective value of 10.3232, which is much better than other results in the table. However, in terms of NFE, the worst convergence rate was shown by DE while FA took 49980 NFE to get the best solution presented in the table.


DE MDE-1MDE-2MDE-3MDE-4MDE-5FA

0.11730.1171 0.1149 0.10340.11440.1024 0.7976
0.2082 0.1866 0.2037 0.1863 0.1864 0.18630.4522
0.09970.09650.09820.09610.09470.09460.1524
0.11250.11190.10367 0.11250.1006 0.1067 0.4740
0.05000.05000.05000.0500 0.0500 0.05000.5339
0.05800.05000.0500 0.0500 0.0500 0.05000.2565
0.05000.05000.05000.05000.05000.05000.08948
0.05000.05000.05000.05000.05000.0500 0.3796
0.05000.05000.05000.05000.05000.05000.3313
0.07190.0706 0.0575 0.0703 0.0701 0.05630.0980
0.06490.06490.06670.06490.06490.06500.3816
0.06170.0617 0.05660.05090.0509 0.05530.5236
0.05000.05000.06350.05000.05000.05000.8287
0.08560.0860 0.0859 0.0857 0.07090.07090.3320
1.25051.25151.26351.49951.26021.49911.3909
1.25001.49591.29931.49991.49871.49991.3483
1.25121.25251.26221.25751.27611.27711.2674
1.25151.26321.43221.25081.49921.36501.4622
1.25001.25001.25001.25001.25001.25001.3329
1.25001.38221.38851.38101.38141.38181.3563
1.25001.25001.25081.25001.25001.25001.4024
1.25001.2501 1.2500 1.2500 1.25051.2500 1.317
1.25021.25001.25141.25001.25001.25001.3291
1.2502 1.2501 1.4970 1.2521 1.2500 1.49961.3830
1.49981.49991.47591.49981.49991.49981.2923
1.25751.25291.4700 1.49971.50001.39311.3817
1.4805 1.4664 1.27281.46471.46151.46131.4035
1.25571.25001.2624 1.25401.4979 1.49741.2921
F10.627210.506710.623810.437010.381210.351410.3232
NFE 212190 72960 1818010158010086010620049980

The last problem in this study is the 8-bus model. The results for the IEEE 8-bus model as in Table 4 and Figure 7, in terms of the best objective function values, are again in favor of FA. It is observed that, according to the quoted results obtained by the electromagnetic field optimization (EFO) algorithm, differential evolution (DE) algorithm, particle swarm optimization (PSO) algorithm, black hole (BH) algorithm, electromagnetism-like mechanism (EM), biogeography-based optimization (BBO), and harmony search (HS) [3] are slightly different from each other with EM, HS, BH, and PSO giving the worst results, while EFO, DE, and BBO gave improved solutions. On the other hand, FA gave us an objective value of 6.6463 which is much better than other results in the table.


RelaysEFODEPSOBHEMBBOHSFA
NumberTDS (A)TDS (A)TDS (A)TDS (A)TDS (A)TDS (A)TDS (A)TDS (A)

10.197 237.11 0.074 480.00 0.077 480.00 0.290 228.31 0.430163.31 0.164 335.22 0.251 241.570.0501480.00
2 0.348293.32 0.248 468.14 0.050 120.00 0.544 240.79 0.635 303.26 0.449 241.13 0.412 385.670.050468.36
30.285190.790.209253.800.271104.360.475173.520.622 209.590.312277.860.434146.580.053104.36
40.212120.01 0.079 480.00 0.110 318.24 0.295 269.15 0.631 149.17 0.311 120.14 0.199 293.480.050 150.64
50.076235.93 0.050 284.540.050 297.610.208 192.64 0.306 147.02 0.200 125.73 0.156 200.000.050125
60.329193.400.154462.12 0.309120.000.420203.050.608216.38 0.386 120.130.371228.300.050230.08
70.273283.04 0.230 318.07 0.320 320.00 0.448 196.24 0.566 209.12 0.430 156.06 0.450 208.130.050156.65
80.303237.31 0.151432.90 0.219 480.000.363288.150.546272.140.286251.25 0.425285.950.0817251.48
90.098207.890.050 320.00 0.050278.300.237 127.96 0.348 116.53 0.22698.89 0.179177.360.050187.36
10 0.174225.250.050480.00 0.050268.710.264257.610.663 146.320.198301.970.246215.11 0.050220.30
110.263250.910.226121.510.200120.000.367 249.57 0.515 363.460.290300.120.348 254.75 0.050255.30
120.343319.590.221472.950.345127.16 0.496 237.60 0.723240.59 0.529 138.33 0.432404.570.0817416.00
130.202 233.390.070480.000.152 451.17 0.278239.78 0.488141.82 0.162334.180.285 206.760.0534230.56
140.311 230.260.217 320.000.309154.820.397 216.330.455 260.14 0.328263.290.428 223.330.058230.34
F7.611 6.654 10.421 11.401 15.9137.54711.7606.6463

Moreover, results obtained by FA are compared to previously quoted results of DE and MDE versions, RST-2, GA, SOMA, SOM-GA, LX-POL, and LX-PM [2, 4, 14]. The experimental outcomes are recorded in Tables 15 in terms of the best objective value and total number of function evaluations. Graphical analyses are presented, for each system, in shape of bar graphs given in Figures 17. Concise data is recorded in Table 5 which compares FA to other state-of-the-art algorithms. All experimental results suggest that FA can tackle all the three problems efficiently and optimally. It is noted that FA consumes a smaller number of function evaluations as compared to other methods.


Algorithms 3-bus model4-bus model6-bus model

FA4.65573.5624 10.3232
DE4.8421 3.6774 10.6272
MDE-14.80693.669410.5067
MDE-24.7872 3.673410.6238
MDE-34.78223.669210.4370
MDE-44.78063.667410.3812
MDE-54.78063.669410.3514
RST-24.83543.705010.6192
GA5.07613.858713.7996
SOMA8.01013.789226.1495
SOM-GA4.7898 3.674510.3578
LX-POL4.82653.574910.6028
LX-PM4.82863.583010.6219


Number IEEE 3-bus IEEE 4-busIEEE 6-busIEEE 8-bus

Number of lines 3 4 77
Number of DOCRs (relays) 6 8 1414
Number of decision variables 12 16 2828
Number of selectivity constraints 8 9 3840
Number of restricted constraints 24 32 104104



9.462.06100.632.06
26.912.0614.082.06
8.812.23136.232.23
37.682.2312.072.23
17.930.819.20.8
14.350.825.90.8



514.080.8114.082.06
612.070.8312.072.23
425.92.23525.90.8
214.350.8614.352.06
59.460.819.462.06
68.810.838.812.23
219.22.06619.20.8
417.932.23517.930.8



20.320.4823.750.48
88.850.4812.480.48
13.611.178931.921.1789
116.811.178910.381.1789
116.71.525912.071.5259
16.671.525931.921.5259
71.71.2018111.2018
19.271.201818.911.2018



520.32 1.5259 120.32 0.48
512.481.5259112.480.48
713.61 1.2018 3 13.61 1.1789
710.381.2018310.381.1789
11.16 0.48 4116.81 1.1789
212.070.48612.071.1789
216.67 0.486 16.67 1.5259
4111.1789811 1.2018
419.27 1.1789 8 19.27 1.2018



2.53110.25855.94950.2585
2.73760.25855.37520.2585
2.97230.48636.66410.4863
4.14770.48634.58970.4863
1.95450.71386.23450.7138
2.76780.71384.25730.7138
3.84231.7466.36941.746
5.6181.7464.17831.746
4.65381.04243.871.0424
3.52611.04245.26961.0424
2.5840.77296.11440.7729
3.80060.77293.90050.7729
2.41430.58792.90110.5879
5.35410.58794.3350.5879


pq

84.0909 1.746 1 5.3752 0.2585
111.28860.772915.37520.2585
82.93231.746 1 2.5311 0.2585
30.62130.486322.73760.2585
31.66580.4863 2 5.9495 0.2585
100.09231.042434.58970.4863
102.561 1.0424 3 2.9723 0.4863
131.49950.5879 34.58970.4863
10.88690.2585 44.1477 0.4863
11.52430.2585 46.66410.4863
122.5444 0.7729 5 4.2573 0.7138
121.4549 0.772951.95450.7138
141.7142 0.58795 4.2573 0.7138
3 1.46580.4863 66.23450.7138
3 1.12310.2585 66.2345 0.7138
112.14360.7729 74.17831.746
2 2.0355 0.2585 7 4.1783 1.746
111.9712 0.772973.8423 1.746
21.8718 0.25857 3.84231.746
131.8321 0.58799 5.2696 1.0424
43.43860.4863 9 5.2696 1.0424
13 1.618 0.5879 94.65381.0424
4 3.03680.4863 9 4.65381.0424
14 2.08710.5879 113.90050.7729
6 1.81380.7138 11 3.9005 0.7729
141.47440.5879112.5840.7729
61.1099 0.7138 11 2.584 0.7729
8 3.32861.746 12 3.8006 0.7729
20.47340.258512 3.8006 0.7729
84.57361.746126.1144 0.7729
21.54320.258512 6.1144 0.7729
12 2.72690.772913 4.335 0.5879
61.6085 0.7138 13 4.335 0.5879
121.8360.772913 2.4143 0.5879
10 2.0261.042414 2.9011 0.5879
4 0.87570.4863 142.9011 0.5879
102.77841.0424145.35410.5879
4 2.5823 0.4863 145.3541 0.5879


Primary relay (A) (primary) Backup relay (A) (backup)

1 2666.3 6 2666.3
2 5374.8 1 804.7
2 5374.8 7 1531.5
3 3325.6 2 3325.6
4 2217.1 3 2217.1
5 1334.3 4 1334.3
6 4975 5 403.6
6 4975 14 1533
7 4247.6 5 403.6
7 4247.6 13 805.5
8 4973.2 7 1531.5
8 4973.2 9 403.2
9 1420.9 10 1420.9
10 2313.5 11 2313.5
11 3474.3 12 3474.3
12 5377 13 805.5
12 5377 14 1533
13 2475.7 8 2475.7
14 4246.4 1 804.7
14 4246.4 9 403.2


(A)
Relay CT ratio Min Max

11200/5 120 480
2 1200/5 120 480
3 800/5 80 320
4 1200/5 120 480
5 1200/5 120 480
6 1200/5 120 480
7 800/5 80 320
8 1200/5 120 480
9 800/5 80 320
10 1200/5 120 480
11 1200/5 120 480
12 1200/5 120 480
13 1200/5 120 480
14 800/5 80 320

6. Conclusion

In electrical engineering, the problem of optimal coordination of several directional overcurrent relays is NP-hard with many constraints. The mathematical nature of the problem is highly complex, with several constraints imposed on the objective function. The problem of DOCRs requires suitable and robust optimization algorithms to tackle it. Experimental results obtained by FA are compared to previously quoted results of DE, RST-2, GA, SOMA, SOM-GA, LXPOL, LXPM, EFO, PSO, BH, EM, BBO, and HS. In order to summarize the achievements of the research, we present the following key aspects:(i)In this paper, we implemented the firefly algorithm (FA) to improve the solutions for four optimization problems, namely, the IEEE (3-, 4-, 6-, and 8-bus) systems.(ii)To tackle the DOCR problems, the use of a suitable and efficient metaheuristic is needed.(iii)The outcome of our simulations shows that FA can efficiently minimize all the four models of the problem.(iv)The efficiency of FA can be observed from the minimum function evaluations required by the algorithm to reach the optimum as compared to other state-of-the-art algorithms.(v)The outcome suggests that FA is overall better and more efficient than the other optimization techniques considered in this research.(vi)In the future, one can extend this work to solve problems of higher buses and complex power systems. Moreover, extensive statistical analysis and parameters tuning can further highlight and improve the efficiency of FA.

Appendix

Tables 614 for IEEE 3-, 4-, 6-, and 8-bus systems.

Nomenclature

AI:Artificial intelligence
CT:Current transformer
DOCR:Directional overcurrent relay
FA:Firefly algorithm
GA:Genetic algorithm
NIA:Nature-inspired algorithm
PS:Plug setting
PSO:Particle swarm optimization
TDS:Time dial setting.

Conflicts of Interest

The authors declare that there are no conflicts of interest regarding this publication.

References

  1. A. J. Urdaneta, R. Nadira, and L. G. Pérez Jiménez, “Optimal Coordination of Directional Overcurrent Relays in Interconnected Power Systems,” IEEE Transactions on Power Delivery, vol. 3, no. 3, pp. 903–911, 1988. View at: Publisher Site | Google Scholar
  2. D. Birla, R. P. Maheshwari, H. O. Gupta, K. Deep, and M. Thakur, “Application of random search technique in directional overcurrent relay coordination,” International Journal of Emerging Electric Power Systems, vol. 7, no. 1, pp. 1–16, 2006. View at: Google Scholar
  3. H. R. E. H. Bouchekara, M. Zellagui, and M. A. Abido, “Optimal coordination of directional overcurrent relays using a modified electromagnetic field optimization algorithm,” Applied Soft Computing, vol. 54, pp. 267–283, 2017. View at: Publisher Site | Google Scholar
  4. K. Deep, Engineering Optimization: An Introduction with Metaheuristic Applications, 2007. View at: Publisher Site
  5. M. Sulaiman, A. Ashfaq, K. Asfandyar, and S. Muhammad, “Hybridized symbiotic organism search algorithm for the optimal operation of directional over-current relays,” Complexity, 2017. View at: Google Scholar
  6. H. B. Elrafie and M. R. Irving, “Linear programming for directional overcurrent relay coordination in interconnected power systems with constraint relaxation,” Electric Power Systems Research, vol. 27, no. 3, pp. 209–216, 1993. View at: Publisher Site | Google Scholar
  7. A. S. Braga and J. T. Saraiva, “Coordination of overcurrent directional relays in meshed networks using the simplex method,” in Proceedings of the 1996 8th Mediterranean Electrotechnical Conference, MELECON'06. Part 3 (of 3), pp. 1535–1538, May 1996. View at: Google Scholar
  8. H. Askarian Abyaneh and R. Keyhani, “Optimal co-ordination of overcurrent relays in power system by dual simplex method,” in Proceedings of the AUPEC Conference, vol. 3, pp. 440–445, 1995. View at: Google Scholar
  9. A. Y. Abdelaziz, H. E. A. Talaat, A. I. Nosseir, and A. A. Hajjar, “An adaptive protection scheme for optimal coordination of overcurrent relays,” Electric Power Systems Research, vol. 61, no. 1, pp. 1–9, 2002. View at: Publisher Site | Google Scholar
  10. N. A. Laway and H. O. Gupta, “A method for adaptive coordination of overcurrent relays in an interconnected power system,” in Proceedings of the Developments in Power System Protection, pp. 240–243, 1993. View at: Google Scholar
  11. X.-S. Yang, “Firefly algorithms for multimodal optimization,” in Proceedings of the International symposium on stochastic algorithms, vol. 5792, pp. 169–178, Springer. View at: Publisher Site | Google Scholar | MathSciNet
  12. M. Sulaiman, A. Salhi, B. I. Selamoglu, and O. B. Kirikchi, “A plant propagation algorithm for constrained engineering optimisation problems,” Mathematical Problems in Engineering, vol. 2014, Article ID 627416, 10 pages, 2014. View at: Publisher Site | Google Scholar
  13. M. Sulaiman and A. Salhi, “A seed-based plant propagation algorithm: The feeding station model,” The Scientific World Journal, vol. 2015, Article ID 904364, 2015. View at: Publisher Site | Google Scholar
  14. M. M. Mansour, S. F. Mekhamer, and N. E.-S. El-Kharbawe, “A modified particle swarm optimizer for the coordination of directional overcurrent relays,” IEEE Transactions on Power Delivery, vol. 22, no. 3, pp. 1400–1410, 2007. View at: Publisher Site | Google Scholar
  15. H. H. Zeineldin, E. F. El-Saadany, and M. M. A. Salama, “Optimal coordination of overcurrent relays using a modified particle swarm optimization,” Electric Power Systems Research, vol. 76, no. 11, pp. 988–995, 2006. View at: Publisher Site | Google Scholar
  16. F. Razavi, H. A. Abyaneh, M. Al-Dabbagh, R. Mohammadi, and H. Torkaman, “A new comprehensive genetic algorithm method for optimal overcurrent relays coordination,” Electric Power Systems Research, vol. 78, no. 4, pp. 713–720, 2008. View at: Publisher Site | Google Scholar
  17. K. A. Brown and N. Tyle, “Expert system for overcurrent protective device coordination,” in Proceedings of the Rural Electric Power Conference, Papers Presented at the 30th Annual Conference., 1986. View at: Google Scholar
  18. S. J. Lee, S. H. Yoon, M.-C. Yoon, and J.-K. Jang, “An expert system for protective relay setting of transmission systems,” in Proceedings of the Conference Papers Power Industry Computer Application Conference, pp. 296–302, Seattle, Wash, USA. View at: Publisher Site | Google Scholar
  19. G. Decher and J. Hong, “Buildup of ultrathin multilayer films by a self‐assembly process, 1 consecutive adsorption of anionic and cationic bipolar amphiphiles on charged surfaces,” Makromolekulare Chemie: Macromolecular Symposia, vol. 46, no. 1, pp. 321–327, 1991. View at: Publisher Site | Google Scholar
  20. J. Wang and J. Trecat, “RSVIES - A relay setting value identification expert system,” Electric Power Systems Research, vol. 37, no. 2, pp. 153–158, 1996. View at: Publisher Site | Google Scholar
  21. H. A. Abyane, K. Faez, and H. K. Karegar, “New method for overcurrent relay (O/C) using neural network and fuzzy logic,” in Proceedings of the 1997 IEEE TENCON Conference, vol. 1, pp. 407–410, December 1997. View at: Google Scholar

Copyright © 2018 Muhammad Sulaiman et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.


More related articles

963 Views | 474 Downloads | 10 Citations
 PDF  Download Citation  Citation
 Download other formatsMore
 Order printed copiesOrder

Related articles

We are committed to sharing findings related to COVID-19 as quickly and safely as possible. Any author submitting a COVID-19 paper should notify us at help@hindawi.com to ensure their research is fast-tracked and made available on a preprint server as soon as possible. We will be providing unlimited waivers of publication charges for accepted articles related to COVID-19. Sign up here as a reviewer to help fast-track new submissions.