Calculation of Distance Protection Settings in Mutually Coupled Transmission Lines: A Comparative Analysis
Abstract
:1. Introduction
2. Methodology
2.1. Expected General Performance of the Distance Protection Zones
2.2. Performance of the Distance Protection for Mutually Coupled Transmission Lines
2.3. Formulation of the Optimization Problem to Calculate the Zone Reach Settings
- (1)
- Fault type p(Tf), for which the following probability distribution is assumed [19]: single-phase to ground faults (80%), double-phase to ground faults (12%) and three-phase faults (8%).
- (2)
- Operative status of the mutually-coupled circuit p(Eo), assuming an empirical distribution: both circuits in service (90%), coupled circuit out of service and grounded at both ends (6%), coupled circuit out of service and isolated from ground (4%).
2.4. Sample Transmission System and Methodology for Obtaining the Input Data of the Solution Strategy
2.5. Solution Strategy
2.6. Setting Parameters for the Proposed Genetic Algorithm
3. Tests and Results
3.1. Calculation of the Earth Compensation Factor (k0)
3.2. Calculation of the Initial Settings for Zone 1
3.3. Calculation of the Reach Settings for Zone 1 Using the Proposed Method
3.4. Sensitivity Analysis for the Mutation Rate and Number of Iterations of the Genetic Algorithm
4. Conclusions
Author Contributions
Acknowledgments
Conflicts of Interest
Appendix A
Solution Method Algorithm | |
---|---|
1: | Setting of the parameters related to the algorithm |
2: | Variable declaration: |
3: | Sets: auxiliary sets for faulted elements: sLines, sBars |
4: | Integers: auxiliary counters, vector sizes, set and matrices sizes, integer operators of the GA |
5: | Objects: short-circuit command, distance relay measured impedance, faulted line, faulted bar |
6: | Doubles: auxiliary operators for probability counters, reach settings bounds |
7: | Definition of the fault impedance vector |
8: | Definition of the fault location vector (for faulted lines only) |
9: | Edition of matrices G1, D1 and F1 |
10: | Start row counters for G1, D1 and F1 |
11: | Part 1: simulation and classification of faults |
12: | Initialize counter for status of the mutually coupled line |
13: | while status of the mutually coupled line <= 3: |
14: | if status = both lines are in service: |
15: | Energize mutually coupled line |
16: | iStatus = 1 |
17: | else if status = mutually coupled line out of service and grounded at both line ends: |
18: | Isolate and ground mutually coupled line |
19: | iStatus = 2 |
20: | else if status = mutually coupled line out of service and ungrounded at both line ends: |
21: | Isolate mutually coupled line |
22: | iStatus = 3 |
23: | Initialize counter for fault type |
24: | while fault type <= 3: |
25: | if fault type = single-phase to ground: |
26: | Set fault type in the short-circuit command to single-phase to ground |
27: | iFaultType = 1 |
28: | else if fault type = double-phase to ground: |
29: | Set fault type in the short-circuit command to double-phase to ground |
30: | iFaultType = 2 |
31: | else if fault type = three-phase: |
32: | Set fault type in the short-circuit command to three-phase |
33: | iFaultType = 3 |
34: | Set the short-circuit method to be used |
35: | Set the faulted object (line or bus bar) |
36: | Initialize counter for fault location |
37: | while Fault location available at the fault location vector: |
38: | Set the fault location according to the value of the counter for fault location and its corresponding position in the fault location vector |
39: | Initialize counter for fault impedance |
40: | while Fault impedance available at the fault impedance vector: |
41: | Set the fault impedance according to the value of the counter for fault impedance and its corresponding position in the fault location vector |
42: | Execute short-circuit simulation |
43: | if Distance protection starts, detects the fault in the forward direction and the resistive component of the apparent impedance measured from the fault is lower than the resistive component related to the minimum load transfer impedance: |
44: | if fault type = single-phase to ground or three-phase: |
45: | Store the apparent impedance of loop A to ground in set G1 |
46: | else if fault type = double-phase to ground: |
47: | Store the apparent impedance of loop B-C in set G1 |
48: | if fault location is inside the protected line and until 85% of the total distance from the relay location: |
49: | if fault type = single-phase to ground or three-phase: |
50: | Store the apparent impedance of loop A to ground in set D1 |
51: | Calculate p(Zap) according to fault type and status of the mutually coupled line |
52: | else if fault type = double-phase to ground: |
53: | Store the apparent impedance of loop B-C in set D1 |
54: | Calculate p(Zap) according to fault type and status of the mutually coupled line |
55: | else if fault location is outside the protected line or inside and above 85% of the total distance from the relay location: |
56: | if fault type = single-phase to ground or three-phase: |
57: | Store the apparent impedance of loop A to ground in set D1 |
58: | Calculate p(Zap) according to fault type and status of the mutually coupled line |
59: | else if fault type = double-phase to ground: |
60: | Store the apparent impedance of loop B-C in set D1 |
61: | Calculate p(Zap) according to fault type and status of the mutually coupled line |
62: | Part 2: Genetic Algorithm (GA) implementation |
63: | Part 2.1: Stablishing the initial population |
64: | Creation of the initial population matrix |
65: | Initialize auxiliary counter for the population matrix |
66: | Definition of the upper and lower limits for the reaches (R and X) of Zone 1: |
67: | RLowerLimit = 0.2*XL1 (XL1: positive sequence reactance of the protected line) |
68: | XLowerLimit = 0.2*XL1 |
69: | RUpperLimit = 0.45*ZminLoad |
70: | XupperLimit = 0.85*XL1 |
71: | Calculation of steps in R and X for the calculation of the initial population |
72: | DeltaR = (RUpperLimit − RLowerLimit)/25 |
73: | DeltaX = (XUpperLimit − XLowerLimit)/25 |
74: | while Population <= Population Size: |
75: | Creation of the initial population individuals based on an uniform distribution of solutions between the upper and lower limits for the reaches of Zone 1 (Rreach, Xreach) |
76: | while Population <= Population Size: |
77: | Edition of matrices S1 from D1 and T1 from F1 |
78: | Start row counters for S1 and T1 |
79: | Initialize probability accumulators p(S1) and p(T1) at zero |
80: | for all (Rap,Xap) entries in D1: |
81: | if {(Rap ∈ D1) > Rreach} or {(Xap ∈ D1) > Xreach}: |
82: | Store Rap, Xap and p(Zap) in S1 |
83: | p(S1) = p(S1) + p(Zap) |
84: | for all (Rap,Xap) entries in F1: |
85: | if {(Rap ∈ F1) < Rreach} and {(Xap ∈ F1) < Xreach}: |
86: | Store Rap, Xap and p(Zap) in T1 |
87: | p(T1) = p(T1) + p(Zap) |
88: | Calculate the preference function for the current solution in the initial population as: |
89: | M1 = k*p(T1) + (1 − k)*p(S1) |
90: | Part 2.2: Natural Selection |
91: | Creation of the new generation population matrix |
92: | Initialize auxiliary counter for the new generation population matrix |
93: | Initialize the new generation population matrix with the initial population matrix values |
94: | Initialize counter of the number of iterations for the GA |
95: | while below the maximum number of iterations: |
96: | Sort next generation population matrix according to the objective function |
97: | Natural Selection: select the 25 individuals with the lowest value of the preference function (selection rate of 2/3) |
98: | Creation and initialization of the auxiliary population matrix |
99: | Store the 25 individuals from the natural selection in the auxiliary population matrix |
100: | Part 2.3: Mating |
101: | Creation and initialization of the crossover matrix |
102: | Initialize counter for number of mates |
103: | while Number of Mates <= 25: |
104: | Random selection of three candidates to father from the subset of the natural selection |
105: | Selection of the father among the three candidates by tournament (candidate with the lowest objective function) |
106: | Store selected father in the crossover matrix |
107: | Random selection of three candidates to mother from the subset of the natural selection |
108: | Selection of the mother among the three candidates by tournament (candidate with the lowest objective function) |
109: | if the selected mother is the same as the selected father: |
110: | Change the mother by another candidate among the three in the tournament |
111: | Store selected mother in the crossover matrix |
112: | Part 2.4: Crossover |
113: | Initialize counters for number of crossings and number of children |
114: | while Number of Crossings <= 25: |
115: | Get the mother and father from the crossover matrix |
116: | Get the values for R and X from both the mother and father stored in the auxiliary population matrix (the 25 chosen from the natural selection) |
117: | if Crossover Rate = 0.5: |
118: | Random selection of the variable (R or X) to be crossed |
119: | if the selected value to be crossed is R: |
120: | β = Random{0,1}, with β ∈ ℜ (real number) |
121: | α = Random{0,1}, with α ∈ Ζ (integer number) |
122: | Perform crossover for the first child: |
123: | Rchild1 = β*Rfather + (1 − β)*Rmother |
124: | Xchild1 = α*Xfather +(1 − α)*Xmother |
125: | Store the first child in the auxiliary population matrix |
126: | Increase counter for number of children by 1 |
127: | β = Random{0,1}, with β ∈ ℜ (real number) |
128: | α = Random{0,1}, with α ∈ Ζ (integer number) |
129: | Perform crossover for the second child: |
130: | Rchild2 = β*Rfather + (1 − β)*Rmother |
131: | Xchild2 = α*Xfather +(1 − α)*Xmother |
132: | Store the second child in the auxiliary population matrix |
133: | Increase counter for number of children by 1 |
134: | else if the selected value to be crossed is X: |
135: | β = Random{0,1}, with β ∈ ℜ (real number) |
136: | α = Random{0,1}, with α ∈ Ζ (integer number) |
137: | Perform crossover for the first child: |
138: | Rchild1 = α*Rfather +(1 − α)*Rmother |
139: | Xchild1 = β*Xfather + (1 − β)*Xmother |
140: | Store the first child in the auxiliary population matrix |
141: | Increase counter for number of children by 1 |
142: | β = Random{0,1}, with β ∈ ℜ (real number) |
143: | α = Random{0,1}, with α ∈ Ζ (integer number) |
144: | Perform crossover for the second child: |
145: | Rchild2 = α*Rfather +(1 − α)*Rmother |
146: | Xchild2 = β*Xfather + (1 − β)*Xmother |
147: | Store the second child in the auxiliary population matrix |
148: | Increase counter for number of children by 1 |
149: | else if Crossover Rate = 1: |
150: | Random selection of the variable (R or X) to be crossed |
151: | β = Random{0,1}, with β ∈ ℜ (real number) |
152: | Perform crossover for the first child: |
153: | Rchild1 = β*Rfather + (1 − β)*Rmother |
154: | Xchild1 = β*Xfather + (1 − β)*Xmother |
155: | Store the first child in the auxiliary population matrix |
156: | Increase counter for number of children by 1 |
157: | β = Random{0,1}, with β ∈ ℜ (real number) |
158: | Perform crossover for the second child: |
159: | Rchild2 = β*Rfather + (1 − β)*Rmother |
160: | Xchild2 = β*Xfather + (1 − β)*Xmother |
161: | Store the second child in the auxiliary population matrix |
162: | Increase counter for number of children by 1 |
163: | Increase counter for number of crossings by 1 |
164: | Part 2.5: Mutation |
165: | Set the auxiliary population matrix row counter at 26, so that mutation is only applied to the 50 children obtained from the crossover |
166: | while Population matrix row counter <= Population Size (75): |
167: | Edition of matrices S1 from D1 and T1 from F1 |
168: | Start row counters for S1 and T1 |
169: | Initialize probability accumulators p(S1) and p(T1) at zero |
170: | for all (Rap,Xap) entries in D1: |
171: | if {(Rap ∈ D1) > Rreach} or {(Xap ∈ D1) > Xreach}: |
172: | Store Rap, Xap and p(Zap) in S1 |
173: | p(S1) = p(S1) + p(Zap) |
174: | for all (Rap,Xap) entries in F1: |
175: | if {(Rap ∈ F1) < Rreach} and {(Xap ∈ F1) < Xreach}: |
176: | Store Rap, Xap and p(Zap) in T1 |
177: | p(T1) = p(T1) + p(Zap) |
178: | Calculate the preference function for the current solution in the auxiliary population as: |
179: | M1 = k*p(T1) + (1-k)*p(S1) |
180: | Update objective function in the auxiliary population matrix |
181: | Sort the auxiliary population matrix according to the value of the objective function |
182: | Calculate the Number of Mutations: |
183: | #Mutarions = MutationRate*(PopulationSize − ElitePopulation)*#Variables |
184: | Initialize mutation counter |
185: | while mutation counter <= #Mutations: |
186: | Random selection of the cell of the auxiliary population matrix to be mutated, avoiding to include in the mutation operator those individuals in the elite population: |
187: | iAuxRow = Random(ElitePopulation + 1, PopulationSize), with iAux Row ∈ Ζ (integer) |
188: | iAuxColumn = Random(1,2), with iAuxColumn ∈ Ζ (integer) |
189: | if iAuxColumn = 1: |
190: | dAux = Random(RLowerLimit,RUpperLimit), with dAux ∈ ℜ (real number) |
191: | Change the cell of the auxiliary population matrix indicated by iAuxRow and iAuxColumn to the value obtained for dAux |
192: | else: |
193: | dAux = Random(XLowerLimit,XUpperLimit), with dAux ∈ ℜ (real number) |
194: | Change the cell of the auxiliary population matrix indicated by iAuxRow and iAuxColumn to the value obtained for dAux |
195: | Part 2.6: Setting of the new generation population matrix |
196: | Assign all the final values in the auxiliary population matrix to the new population matrix |
197: | Increase by 1 the counter of the number of iterations for the GA |
198: | Part 3: Local Search implementation |
199: | Take the best solution from the final population of the GA |
200: | Define neighborhoods for R and X with steps according to the minimum combined measurement error of the instrument transformers |
201: | Calculation of the objective function for all the solutions in the neighborhood |
202: | Select the best solution for changes in R and X reaches (separately) |
203: | if the solution obtained improves the best solution from the final population of the GA |
204: | Repeat until it is not possible to improve the previous solution |
205: | Report the final solution |
Appendix B
Transformer | Rated Power [MVA] | Nominal Frequency [Hz] | Rated Voltage [kV] | Vector Group | Short-Circuit Voltage [%] | |||
---|---|---|---|---|---|---|---|---|
HV-Side | LV-Side | HV-Side | LV-Side | Phase Shift | ||||
Generation Transformers | 220 | 60 | 230 | 16.5 | YN | D | 1 | 9.99 |
Transformer | Rated Power [MVA] | Rated Voltage [kV] | Vector Group | Short-Circuit Voltage [%] | ||||||
---|---|---|---|---|---|---|---|---|---|---|
HV-Side | MV-Side | LV-Side | HV-Side | MV-Side | LV-Side | HV-MV | MV-LV | LV-HV | ||
XFMR1 | 100 | 70 | 30 | 220 | 110 | 34.5 | YN0yn0d1 | 6.93 | 6 | 10.899 |
XFMR2 | 100 | 70 | 30 | 220 | 110 | 34.5 | YN0yn0d1 | 6.93 | 6 | 10.899 |
TR_3W | 180 | 180 | 60 | 220 | 110 | 44.6 | YN0yn0d1 | 9.31 | 9.15 | 13.06 |
Line | Length [km] | Rated Current [kA] | Positive-Sequence Impedance [Ohms/km] | Zero-Sequence Impedance [Ohms/km] | Mutual Zero-Sequence Impedance [Ohms/km] | Susceptance [uS/km] | ||||
---|---|---|---|---|---|---|---|---|---|---|
R1 | X1 | R0 | X0 | R0M | X0M | B1 | B0 | |||
LT_1 | 84 | 0.755 | 0.048831 | 0.35786 | 0.29136 | 1.0086 | 0.24072 | 0.5563 | 4.6529 | 2.643 |
LT_2 | 84 | 0.755 | 0.048831 | 0.35786 | 0.29136 | 1.0086 | 0.24072 | 0.5563 | 4.6529 | 2.643 |
Power Transformer Connections | 0.01 | 0.971 | 0.0536 | 0.4998 | 0.2632 | 1.1175 | -- | -- | 3.4209 | 2.1723 |
Generator | Rated Power [MVA] | Rated Voltage [kV] | Rated Power Factor | Connection | xd″ [p.u.] | xd′ [p.u.] | x0 [p.u.] | x2 [p.u.] | xd [p.u.] | xq [p.u.] |
---|---|---|---|---|---|---|---|---|---|---|
Generators | 224 | 18 | 0.85 | YN | 0.216 | 0.265 | 0.111 | 0.217 | 1.781 | 1.74 |
Network Equivalent | Angle [°] | Voltage Setpoint [p.u.] | Maximum Short-Circuit | Minimum Short-Circuit | ||||||||
---|---|---|---|---|---|---|---|---|---|---|---|---|
Short-Circuit Current [kA] | R/X | Z2/Z1 | X0/X1 | R0/X0 | Short-Circuit Current [kA] | R/X | Z2/Z1 | X0/X1 | R0/X0 | |||
RTS 110 kV | −5.13 | 1.03 | 17.658 | 0.271 | 1.015 | 1.87 | 0.202 | 13.572 | 0.263 | 1.026 | 1.96 | 0.26 |
ST 220 kV | −3.64 | 1.07 | 14.5 | 0.106 | 1.021 | 1.895 | 0.202 | 10.68 | 0.13 | 1.012 | 1.94 | 0.193 |
Demand Equivalent | Rated Power [MVA] | Power Factor | Leading/Lagging |
---|---|---|---|
Demand STS | 50 | 0.9 | lagging |
Demand TS 110 kV | 110 | 0.92 | lagging |
References
- IEEE Power and Energy Society. IEEE Guide for Protective Relay Applications to Transmission Lines; IEEE Std C37.113-2015; IEEE Power and Energy Society: Piscataway, NJ, USA, 2015. [Google Scholar]
- Tziouvaras, D.A.; Altuve, H.J.; Calero, F. Protecting Mutually Coupled Transmission Lines: Challenges and Solutions. In Proceedings of the 68th Annual Georgia Tech Protective Relaying Conference, Atlanta, GA, USA, 30 April–2 May 2014. [Google Scholar]
- Zocholl, S.E. Three phase circuit analysis and the mysterious k0 factor. In Proceedings of the 22nd Annual Western Protective Relay Conference, Spokane, DC, USA, 24–26 October 1995. [Google Scholar]
- Klapper, U.; Apostolov, A.; Tholomier, D.; Richards, S. K-Factor Mutual Coupling Correction on Asymmetrical Overhead Lines for Optimum Reliability of Distance Protection. In Proceedings of the CIGRE Working Group B5—212, 2008 Paris Session Proceedings, Cigre Session 42, Paris, France, 24–29 August 2008; pp. 1–8. [Google Scholar]
- Tziouvaras, D.A.; Chano, S.R.; Chanelière, J.-L.; Holbach, J.; Moroni, S.; Sachdev, M.S.; Zavolas, C.E.; Lee, S.J.; Topham, G.H. Modern Distance Protection Functions and Applications; CIGRE Working Group B5.15; Green Book 359; CIGRE: Paris, France, October 2008; ISBN 978-2-85873-047-6. [Google Scholar]
- Ziegler, G. Numerical Distance Protection Principles and Applications, 4th ed.; Publicis: Erlagen, Germany, 2011; ISBN 978-3-89578-381-4. [Google Scholar]
- Sorrentino, E.; De Andrade, V. Optimal-Probabilistic Method to Compute the Reach Settings of Distance Relays. IEEE Trans. Power Deliv. 2011, 26, 1522–1529. [Google Scholar] [CrossRef]
- Zhang, W.; Zhang, Y.H. Determination of Optimal Setting Parameters of Distance Relay in Transmission Systems. In Proceedings of the 2015 IEEE Power & Energy Society General Meeting, Denver, CO, USA, 26–30 July 2015. [Google Scholar] [CrossRef]
- Shabani, M.; Noghabi, A.S.; Farshad, M. A new optimization formulation for determining the optimum reach setting of distance relay zones by probabilistic modeling of uncertainties. Automatika 2016, 57, 871–880. [Google Scholar] [CrossRef]
- Zalitis, I.; Dolgicers, A.; Kozadajevs, J. A distance protection based on the estimation of system model parameters. In Proceedings of the 2017 IEEE Manchester Power Tech, Manchester, UK, 18–22 June 2017. [Google Scholar] [CrossRef]
- Cho, J.; Jung, C.; Kim, J. Adaptive Setting of Digital Relay for Transmission Line Protection. In Proceedings of the TENCON IEEE Region 10 Conference, Melbourne, Australia, 21–24 November 2005; pp. 1–6. [Google Scholar]
- Davvdova, N.; Shchetinin, D.; Hug, G. Optimization of first zone boundary of adaptive distance protection for flexible transmission lines. In Proceedings of the 20th Power Systems Computation Conference, PSCC 2018, Dublin, Ireland, 11–15 June 2018. [Google Scholar] [CrossRef]
- Mohajeri, A.; Seyedi, H.; Sabahi, M. Optimal setting of distance relays quadrilateral characteristic considering the uncertain effective parameters. Int. J. Electr. Power Energy Syst. 2015, 73, 1051–1059. [Google Scholar] [CrossRef]
- International Electrotechnical Commission (IEC), TC 38—Instrument Transformers. IEC 61869-2:2012 Instrument Transformers—Part 2: Additional Requirements for Current Transformers; Edition 1.0; IEC: Geneva, Switzerland, 2012. [Google Scholar]
- International Electrotechnical Commission (IEC), TC 38—Instrument Transformers. IEC 61869-3:2011 Instrument Transformers—Part 3: Additional Requirements for Inductive Voltage Transformers; Edition 1.0; IEC: Geneva, Switzerland, 2011. [Google Scholar]
- International Electrotechnical Commission (IEC), TC 38—Instrument Transformers. IEC 61869-5:2011 Instrument Transformers—Part 5: Additional Requirements for Capacitor Voltage Transformers; Edition 1.0; IEC: Geneva, Switzerland, 2011. [Google Scholar]
- DIgSILENT Power Factory. Technical Reference Documentation: Overhead Line Models ElmLne, TypLne, TypGeo, TypTow; Revision 1; DIgSILENT GmbH: Gomaringen, Germany, 2017. [Google Scholar]
- DIgSILENT Power Factory. Technical Reference Documentation: Overhead Line Constants TypGeo, TypTow, TypCon; Revision 2; DIgSILENT GmbH: Gomaringen, Germany, 2018. [Google Scholar]
- Jaramillo, J.; López, J.M. An Alternative Method for Obtaining the Optimal Directional Characteristic Angle of Directional Overcurrent Relays in Transmission Networks. Contemp. Eng. Sci. 2018, 11, 149–164. [Google Scholar] [CrossRef]
- Kari, T.; Gao, W.; Tuluhong, A.; Yaermaimaiti, Y.; Zhang, Z. Mixed Kernel Function Support Vector Regression with Genetic Algorithm for Forecasting Dissolved Gas Content in Power Transformers. Energies 2018, 11, 2437. [Google Scholar] [CrossRef]
- Liu, Y.; Wang, R. Study on network traffic forecast model of SVR optimized by GAFSA. Chaos Solitons Fractals 2016, 89, 153–159. [Google Scholar] [CrossRef]
- Wang, S.; Hae, H.; Kim, J. Development of Easily Accessible Electricity Consumption Model Using Open Data and GA-SVR. Energies 2018, 11, 373. [Google Scholar] [CrossRef]
- Gholamalizadeh, E.; Kim, M. Multi-Objective Optimization of a Solar Chimney Power Plant with Inclined Collector Roof Using Genetic Algorithm. Energies 2016, 9, 971. [Google Scholar] [CrossRef]
- Li, C.; Zhai, R.; Yang, Y. Optimization of a Heliostat Field Layout on Annual Basis Using a Hybrid Algorithm Combining Particle Swarm Optimization Algorithm and Genetic Algorithm. Energies 2017, 10, 1924. [Google Scholar] [CrossRef]
- Wang, B.; Yang, Z.; Lin, F. An Improved Genetic Algorithm for Optimal Stationary Energy Storage System Locating and Sizing. Energies 2014, 7, 6434–6458. [Google Scholar] [CrossRef]
- Haupt, R.L.; Haupt, S.E. Practical Genetic Algorithms, 2nd ed.; John Wiley & Sons Inc.: Hoboken, NJ, USA, 2004; pp. 51–65. ISBN 0-471-45565-2. [Google Scholar]
R1 [Ω] | X1 [Ω] |
---|---|
58.23 | 25.55 |
Number of Iterations | Solution | Objective Function | Population Deviation from Solution | Number of Solutions with the Same Value of the Objective Function | |
---|---|---|---|---|---|
R Reach | X Reach | ||||
2 | 21.391 | 16.411 | 6.167 | 6.215 | 1 |
5 | 22.972 | 16.485 | 5.674 | 3.529 | 1 |
10 | 22.887 | 16.662 | 5.453 | 4.001 | 1 |
20 | 24.024 | 16.644 | 5.301 | 5.471 | 6 |
50 | 23.846 | 16.685 | 5.328 | 5.592 | 1 |
100 | 23.477 | 16.688 | 5.275 | 6.482 | 2 |
200 | 24.168 | 16.690 | 5.195 | 8.811 | 1 |
500 | 24.073 | 16.663 | 5.301 | 5.715 | 3 |
1000 | 24.132 | 16.691 | 5.195 | 6.502 | 1 |
Number of Iterations | Solution | Objective Function | Population Deviation from Solution | Number of Solutions with the Same Value of the Objective Function | |
---|---|---|---|---|---|
R Reach | X Reach | ||||
2 | 20.639 | 16.534 | 6.007 | 4.385 | 1 |
5 | 22.279 | 16.537 | 5.701 | 3.119 | 1 |
10 | 23.973 | 16.741 | 5.355 | 1.790 | 1 |
20 | 56.269 | 16.679 | 5.248 | 2.202 | 35 |
50 | 22.699 | 16.744 | 5.315 | 6.042 | 1 |
100 | 34.750 | 22.006 | 5.248 | 6.358 | 8 |
200 | 24.285 | 16.658 | 5.301 | 7.549 | 1 |
500 | 23.981 | 16.686 | 5.248 | 8.128 | 1 |
1000 | 41.950 | 23.094 | 5.195 | 8.187 | 19 |
Number of Iterations | Solution | Objective Function | Population Deviation from Solution | Number of Solutions with the Same Value of the Objective Function | |
---|---|---|---|---|---|
R Reach | X Reach | ||||
2 | 27.315 | 16.711 | 5.874 | 5.156 | 1 |
5 | 26.496 | 16.173 | 6.007 | 2.714 | 1 |
10 | 25.782 | 16.369 | 5.688 | 0.363 | 2 |
20 | 25.846 | 16.005 | 6.021 | 0.313 | 2 |
50 | 31.028 | 16.972 | 5.195 | 2.136 | 25 |
100 | 56.130 | 19.481 | 5.248 | 6.524 | 25 |
200 | 24.081 | 16.690 | 5.195 | 7.069 | 1 |
500 | 52.913 | 23.834 | 5.248 | 6.561 | 25 |
1000 | 54.210 | 19.057 | 5.195 | 5.085 | 25 |
Number of Iterations | Solution | Objective Function | Population Deviation from Solution | Number of Solutions with the Same Value of the Objective Function | |
---|---|---|---|---|---|
R Reach | X Reach | ||||
2 | 31.079 | 15.391 | 1.864 | 1.734 | 1 |
5 | 22.488 | 16.344 | 1.502 | 2.656 | 1 |
10 | 25.393 | 16.161 | 1.479 | 6.294 | 1 |
20 | 23.852 | 16.683 | 1.332 | 4.251 | 2 |
50 | 24.289 | 16.615 | 1.339 | 8.209 | 1 |
100 | 23.080 | 16.688 | 1.339 | 5.960 | 1 |
200 | 23.999 | 16.675 | 1.325 | 2.793 | 2 |
500 | 24.025 | 16.646 | 1.325 | 5.183 | 1 |
1000 | 24.126 | 16.661 | 1.325 | 9.230 | 5 |
Number of Iterations | Solution | Objective Function | Population Deviation from Solution | Number of Solutions with the Same Value of the Objective Function | |
---|---|---|---|---|---|
R Reach | X Reach | ||||
2 | 22.581 | 16.298 | 1.502 | 2.792 | 1 |
5 | 19.581 | 16.836 | 1.485 | 1.558 | 1 |
10 | 25.814 | 16.288 | 1.395 | 3.491 | 1 |
20 | 26.025 | 16.024 | 1.505 | 2.056 | 1 |
50 | 24.116 | 16.585 | 1.339 | 6.078 | 1 |
100 | 24.231 | 16.680 | 1.312 | 4.998 | 2 |
200 | 23.381 | 16.690 | 1.319 | 8.667 | 2 |
500 | 38.312 | 21.141 | 1.312 | 2.462 | 25 |
1000 | 23.960 | 16.676 | 1.312 | 3.896 | 1 |
Number of Iterations | Solution | Objective Function | Population Deviation from Solution | Number of Solutions with the Same Value of the Objective Function | |
---|---|---|---|---|---|
R Reach | X Reach | ||||
2 | 31.079 | 15.391 | 1.865 | 1.503 | 1 |
5 | 33.962 | 14.652 | 1.841 | 3.904 | 1 |
10 | 27.184 | 15.827 | 1.532 | 0.309 | 1 |
20 | 23.206 | 16.660 | 1.345 | 2.544 | 1 |
50 | 33.298 | 15.742 | 1.319 | 0.964 | 25 |
100 | 50.784 | 23.095 | 1.299 | 3.040 | 25 |
200 | 49.696 | 16.688 | 1.299 | 6.092 | 9 |
500 | 24.288 | 16.692 | 1.299 | 6.890 | 4 |
1000 | 45.948 | 23.014 | 1.299 | 6.800 | 25 |
© 2019 by the authors. Licensee MDPI, Basel, Switzerland. This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC BY) license (http://creativecommons.org/licenses/by/4.0/).
Share and Cite
Jaramillo Serna, J.d.J.; López-Lezama, J.M. Calculation of Distance Protection Settings in Mutually Coupled Transmission Lines: A Comparative Analysis. Energies 2019, 12, 1290. https://doi.org/10.3390/en12071290
Jaramillo Serna JdJ, López-Lezama JM. Calculation of Distance Protection Settings in Mutually Coupled Transmission Lines: A Comparative Analysis. Energies. 2019; 12(7):1290. https://doi.org/10.3390/en12071290
Chicago/Turabian StyleJaramillo Serna, José de Jesús, and Jesús M. López-Lezama. 2019. "Calculation of Distance Protection Settings in Mutually Coupled Transmission Lines: A Comparative Analysis" Energies 12, no. 7: 1290. https://doi.org/10.3390/en12071290
APA StyleJaramillo Serna, J. d. J., & López-Lezama, J. M. (2019). Calculation of Distance Protection Settings in Mutually Coupled Transmission Lines: A Comparative Analysis. Energies, 12(7), 1290. https://doi.org/10.3390/en12071290