Mathematical Problems in Engineering

Volume 2012 (2012), Article ID 456047, 18 pages

http://dx.doi.org/10.1155/2012/456047

## A New Hybrid Nelder-Mead Particle Swarm Optimization for Coordination Optimization of Directional Overcurrent Relays

^{1}Department of Computer Science and Information Engineering, St. John's University, No. 499, Section 4, Tam King Road, Tamsui District, New Taipei City 25135, Taiwan^{2}Graduate Institute of Computer and Communication Engineering, National Taipei University of Technology, No. 1, Section 3, Chung Hsiao East Road, Taipei 10608, Taiwan^{3}Department of Electrical Engineering, St. John's University, No. 499, Section 4, Tam King Road, Tamsui District, New Taipei City 25135, Taiwan

Received 18 February 2012; Revised 26 April 2012; Accepted 10 May 2012

Academic Editor: Jianming Shi

Copyright © 2012 An Liu and Ming-Ta Yang. 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.

#### Abstract

Coordination optimization of directional overcurrent relays (DOCRs) is an important part of an efficient distribution system. This optimization problem involves obtaining the time dial setting (TDS) and pickup current () values of each DOCR. The optimal results should have the shortest primary relay operating time for all fault lines. Recently, the particle swarm optimization (PSO) algorithm has been considered an effective tool for linear/nonlinear optimization problems with application in the protection and coordination of power systems. With a limited runtime period, the conventional PSO considers the optimal solution as the final solution, and an early convergence of PSO results in decreased overall performance and an increase in the risk of mistaking local optima for global optima. Therefore, this study proposes a new hybrid Nelder-Mead simplex search method and particle swarm optimization (proposed NM-PSO) algorithm to solve the DOCR coordination optimization problem. PSO is the main optimizer, and the Nelder-Mead simplex search method is used to improve the efficiency of PSO due to its potential for rapid convergence. To validate the proposal, this study compared the performance of the proposed algorithm with that of PSO and original NM-PSO. The findings demonstrate the outstanding performance of the proposed NM-PSO in terms of computation speed, rate of convergence, and feasibility.

#### 1. Introduction

Transmission lines are exposed to the environment and stretch long distances, which increases the probability of failure far beyond that of other components of the network, including generators, transformers, and switchgear equipment.

A transmission network is usually divided according to function: (1) transmission lines between various major substations forming the backbone of the network; (2) subtransmission lines connecting substations to load centers or major users; (3) distribution lines between load centers and end users.

Lines from substations or load centers are often distributed in the form of radial feeders. Radial feeders only require the installation of relays and breakers at the ends of the various lines from which the power is sent. When a fault occurs in most radial feeders, the fault current will be greater than the load current with no reverse fault current. As a result, these types of radial feeders can be protected using nondirectional overcurrent relays.

If the protected line is installed with power supplies at both ends, such as in the case of loop networks, the fault current may be fed from the left or right in the event of reverse external failure. In this case, relay malfunctions may occur only if nondirectional overcurrent relays are used for protection, as these relays cannot be coordinated. Directional overcurrent relay (DOCR) is a method to improve protection. DOCR is designed to function only in the event of a unidirectional fault current.

The study of coordination problems in electrical power systems has become increasingly important in recent years. Economic considerations have propelled DOCR into widespread use as the primary protection for distribution systems and as the backup protection for transmission systems. When working with a DOCR system, operators must set time dial setting (TDS) and pick up current () values according to the coordination relationship of the primary/backup (P/B) pairs to fully secure protection for the entire system.

In recent years, several optimization techniques have been proposed for the optimal coordination of DOCRs. Urdaneta et al. applied a minima optimization approach to determine the TDS values for preset values for fixed and multiple power system network configurations [1]. Abyaneh et al. obtained optimum coordination by considering linear and nonlinear models of relay characteristics and changes in network configuration [2]. Birla et al. demonstrated the simultaneous optimization of all DOCR settings with nonlinear relay characteristics using a sequential quadratic programming method [3]. In [4], a genetic algorithm was selected as the tool to solve the DOCR coordination problem, which included nonlinear constraints. The results of [5] reveal that the advantage of the proposed interval method for the DOCR coordination problem provides robust support against uncertainty in the topology of the network. Bedekar and Bhide used a genetic algorithm and nonlinear programming method to systematically determine initial and final values of the time multiplier and plug settings for optimal DOCR coordination [6].

In general, PSO algorithms are not easily trapped in local optima; however, the convergence rate is slow, and optimization problems with constraints cannot be effectively solved. Zeineldin et al. proposed an approach using a modified particle swarm optimization (PSO) algorithm to calculate the optimal relay settings, formulating the coordination problem as a mixed-integer nonlinear programming problem [7]. In [8], the problem of setting the DOCR was formulated and solved as a linear programming problem; a modified PSO was also applied. The major goal of this study was to investigate the feasibility of applying a Nelder-Mead simplex search method and a particle swarm optimization (NM-PSO) methodology to address the coordination optimization of a DOCR distribution system.

We have divided the remainder of this paper into three sections. The first provides an introduction to the theoretical foundations of the research, involving the modeling of DOCR coordination problems. The proposed optimization algorithm includes a constraint handling method, an NM simplex search method, a PSO algorithm, and an NM-PSO method. We utilized IEEE 8- and 14-bus test systems to verify the feasibility of the proposed algorithm. The results show that the proposed method, comprising a linear programming (LP) problem and a mixed-integer nonlinear programming (MINLP) problem, is capable of overcoming the relay coordination problem of a power system. The combined approach effectively increases the convergence rate of calculation and enhances the capability of the PSO when processing under constraints. Finally, we discuss the results and draw conclusions.

#### 2. DOCR Coordination Problem

The main purpose of the DOCR coordination problem is to determine the TDS and values of each relay in a power system. The optimal operating times of the primary relays are then minimized, and coordination pairs of the P/B relays and coordination constraints are obtained. The DOCR coordination optimization problem in a power system can be described as follows: where is the number of relays in zone of a power network, and is a coefficient indicating the probability of a fault occurring on the th line in zone of a power network. In general, the value of is either 1 or 0. The variable indicates the operating time of relay for a close-in fault in zone .

The coordination constraints between the primary relay and the backup relay(s) are as follows: where reveals the operating time of relay , and the relay is the backup relay of relay . CTI is the minimum coordination time interval; its value ranges from 0.2 to 0.5 s. In this study, a CTI of 0.2 s was chosen.

The function for the nonlinear relay characteristics is based on IEEE standard C37.112-1996 and is represented as follows:
where TDS_{i} and are the time dial setting and the pickup current setting of the th relay, respectively. is the short-circuit fault current passing through the *i*th relay.

The constants and exponent in (2.3) define the shape of the extremely inverse trip characteristics.

The results of this research not only describe the methodology of DOCR coordination optimization but also demonstrate the feasibility of the TDS and settings of the relays. In general, DOCR allows for a continuous TDS value, but a discrete setting. To satisfy this requirement, this study explored both linear and nonlinear programming for DOCR coordination optimization. The variable TDS is optimized according to a predefined for each DOCR, and this optimization problem can be viewed as a linear programming (LP) problem. For the nonlinear programming (NLP) problem, variables TDS and are optimized for each DOCR. In the LP or NLP problem of the DOCR coordination optimization, the TDS values can range continuously from 0.1000 to 1.1000, and the values can range discretely between 10 and 1000 with a step size of 1, depending on the close-in fault current for each relay.

#### 3. Proposed Optimization Algorithm

PSO is a random optimization technology developed by Eberhart and Kennedy in 1995 [9], who were inspired by simulating the intelligence of swarming bird flocks. PSO shares many similarities with evolutionary computation techniques such as genetic algorithms (GAs) [6]. The problem is initialized with a population of feasible random solutions; however, PSO contains no genetic operations, such as crossover or mutation.

Another important feature of PSO is that each particle has memory. PSO’s information sharing mechanism differs greatly from that of GAs. In GAs, chromosomes mutually share information, and therefore, the movement of the population as it approaches the best area is relatively even. In PSO, the possible individual elements of PSO algorithms are called particles. The global best particle gives information to other particles and updates the movement direction and speed of each particle.

Based on the PSO method, we propose the NM-PSO method for solving the constrained optimization problem. The following section introduces the basic principles of NM-PSO, including constraint-handling methods, Nelder-Mead (NM) simplex search, and PSO.

##### 3.1. Constraint-Handling Methods

Constraint handling is a major concern when applying PSO algorithms to solve constrained optimization problems. This is because the traditional search operators of PSO algorithms are blind to constraints. Thus far, the most commonly used constraint handling methods for PSO are the penalty and repair methods.

The gradient-based repair method was addressed by [10, 11]. This method adopts gradient information derived from the constraint set to gradually repair an infeasible solution by directing the infeasible solution toward a feasible area. Because the constraints of the DOCR coordination optimization are not complicated, this method is highly suitable. Furthermore, because DOCR coordination optimization has no equality constraints,equality constraint equations can be ignored. This method is described below.(1)For a random solution, determine the degree of constraint violation using the following equation: where is the vector of inequality constraints (), and is the degree of constraint violation .(2)Compute , where are the derivatives of these constraints with respect to the solution vector ( decision variables) (3)The relationship between changes in the constraint violation and the solution vector is expressed as (4)Compute the pseudoinverse .(5)Update the solution vector by

The degree of constraint violation is adjusted according to the above procedure. In this algorithm, a “repair method” rapidly revises infeasible solutions to move them toward a feasible region. The number of constraint violations decreases and quickly vanishes with each iteration. Finally, a solution in the feasible region will be obtained.

##### 3.2. The Nelder-Mead Simplex Search Method

When the search space is -dimensional, the simplex consists of solutions [12]. As shown in Figure 1(a), in a two-dimensional search plane, a simplex is a triangle. The fitness of each solution is considered at each step of the Nelder-Mead method, and the worst solution is identified. The centroid, , of the remaining points is computed, and the reflection of is determined. This reflection yields a new solution, , which replaces , as shown in Figure 1(b). If the solution produced by this reflection has a higher fitness than any other solution in the simplex, the simplex is further expanded in the direction of , and is replaced with , as shown in Figure 1(c).

On the other hand, if has a comparatively low fitness, the simplex is contracted. Contraction can either be outward or inward, depending upon whether is better or worse than , respectively. The contraction operations (i.e., is replaced with ) are shown in Figures 1(d) and 1(e). If neither contraction improves the worst solution in the simplex, the best point in the simplex is computed, and a shrinkage is then performed; all the points of the simplex are moved a little closer towards the best solution (), as shown in Figure 1(f).

##### 3.3. Particle Swarm Optimization

In the past several years, PSO has been successfully applied in many fields [13, 14]. It has been demonstrated that the results of PSO are superior to other methods. The PSO procedure is reviewed below.(1)*Initialization*. It randomly generates a swarm of potential solutions called “particles” and assigns a random velocity to each.(2)*Velocity Update*. The particles are then “flown” through hyperspace by updating their own velocity. The velocity update of a particle is dynamically adjusted, subject to its own past flight and those of its companions. The velocity and position of the particles are updated by the following equations:
where and are two positive constants; is an inertia weight, and rand( ) is a random value between (0, 1). Zahara and Hu suggested = = 2 and = [0.5 + (rand( )/2)] [15]. However, many experiments have shown that using = [0.5 + (rand( )/3)] provides better results. Equation (3.5) illustrates the calculation of a new velocity for each individual. The velocity of each particle is updated according to its previous velocity (), the particle’s previous best location (), and the global best location (). Particle velocities for each dimension are clamped to a maximum velocity . Equation (3.6) shows how each particle’s position is updated in the search space.

##### 3.4. NM-PSO Method

The NM-PSO optimization method [16] integrates the constraint-handling methods, the Nelder-Mead simplex search method (traditional algorithm), and the PSO algorithm (evolutionary algorithm) [17]. The PSO optimal method resists easily falling into the local best solution, but it requires many particles in an optimal process, which reduces the speed of computation. The Nelder-Mead simplex search method improves the efficiency of PSO due to its capacity for rapid convergence. However, the drawback of this method is that it easily falls into a local best solution. This drawback is improved by integrating the two algorithms. Combining the two algorithms and the gradient-based repair methods enables feasible optimal solutions to be found that satisfy the constraint conditions [18].

Using the advantages mentioned above, the NM-PSO method clearly overcomes the drawbacks of low convergence speed, the need for more particles, and the inability to deal with constraint conditions to accurately find optimal solutions.

##### 3.5. Implementation of Proposed Method

The following section introduces the NM-PSO algorithm procedure. Assume the problem to be solved is -dimensional. First produce particles to form a swarm. For every particle that violates the constraints, use the gradient repair method to direct the infeasible solution toward the feasible region. In most cases, the repair method does move the solution to the feasible region. Arrange the results of the objective function in order of good to bad and divide the particles into particles, the th particle, and particles and then create three groups. First calculate the top particles and the th particle using the NM simplex method. The updated best particle is obtained and the result saved. The PSO method adjusts the particles by taking into account the position of the best particle. Through the calculation of a simple NM algorithm, the probability of finding the optimal solution was increased. This procedure for adjusting the particles involves selection of the global best particle, the selection of the neighboring best particles, and finally the velocity updates. The global best particle of the population is determined according to the sorted fitness values.

Unlike the original PSO calculation method proposed by [15], which updates the remaining particles , we use the PSO algorithm to update all of the particles. These two PSO algorithms combination NM methods are referred to in this paper as the original NM-PSO method and the proposed NM-PSO method, respectively. Repeat the entire NM-PSO optimization process until the condition is fulfilled. Figure 2 depicts the schematic representation of the proposed NM-PSO. Algorithm 1 shows the pseudocode of the NM-PSO algorithm embedded within the constraint-handling methods.

#### 4. Case Study

The appearance and parameters of the relevant line equipment of two typical test systems are introduced. We discuss the fault current and the corresponding DOCR relationship of the coordination pairs of P/B when a close-in three-phase short fault occurs in transmission lines.

Taking the above two test systems as examples, this study validated the feasibility of the proposed NM-PSO optimization algorithm to solve the DOCR optimal coordination problem. The results were compared with PSO and original NM-PSO algorithm. The results of the comparison demonstrate that the proposed NM-PSO algorithm is clearly better than PSO and original NM-PSO in terms of the objective function, the rate of convergence, and computation speed.

In this study, the multiples , , , and were adopted as the number of populations to demonstrate the influence of the number of particles on the proposed algorithm. To observe the process and changes of convergence in the objective function, the number of iterations was set at 300, to highlight the superior performance of the proposed system.

##### 4.1. IEEE 8-Bus Test System

As shown in Figure 3, the 8-bus test system consists of 9 lines, 2 transformers, and 14 DOCRs. All the DOCRs have the IEEE standard inverse-time characteristics mentioned in (2.3) above. The system parameters are the same as in [6]. At bus 4, there is a link to another network modeled by a short-circuit capacity of 400 MVA. The DOCR coordination problem can be formulated as an LP problem or an MINLP problem. Additionally, there are 20 inequality constraints corresponding to each relay pair.

Table 1 illustrates the fault currents of the DOCR coordination pairs of P/B of each phase in the event of a close-in three-phase short fault of the system. If a DOCR coordination optimization problem with known values is assumed to be an LP problem, the results obtained using PSO, original NM-PSO, and proposed NM-PSO for the case of 300 iterations and a population size of 141 (10 × + 1, where is the number of variables TDS of the 14 relays) are illustrated in Table 2. The results are also compared to those of Linprog (linear programming) obtained using the MATLAB optimization toolbox.

To validate the feasibility of the proposed method, the obtained TDS values and known values were entered as constraints to obtain the results shown in Table 3. Since the proposed method satisfies all constraints (i.e., CTI ≧ 0.2), the best coordination setting for DOCR can be efficiently completed.

As expected, the proposed NM-PSO yields better objective function results than PSO and original NM-PSO. Figure 4 shows that proposed NM-PSO nearly reached the global optimum after 189 iterations. The results of this proposed NM-PSO algorithm reveal better convergence.

To analyze the convergence consistency of the proposed NM-PSO algorithm when solving the LP problem in the case of different initial values, this study randomly performed the proposed method five times. As seen in Figure 5, the proposed NM-PSO algorithm can reduce the objective function to the same value after nearly 200 iterations. The convergence of the proposed NM-PSO is evidently not affected by different initial values.

##### 4.2. IEEE 14-Bus Test System

The IEEE 14-bus test system consists of 5 generators, 2 power transformers, 20 transmission lines, and 40 DOCRs, as shown in Figure 6. The system parameters are given in [19]. The voltage level and the power base of this system are 138 kV and 100 MVA, respectively.

It is assumed that the DOCRs all have the standard IEEE inverse-time characteristics as an IEEE 8-bus test system. Table 4 reveals the P/B relay pairs and the corresponding fault currents passing through them for a close-in fault in this network. There are 92 inequality constraints corresponding to each relay pair.

This study also used PSO, original NM-PSO, and proposed NM-PSO to solve the DOCR coordination optimization of the MINLP problem, which required obtaining the TDS and values of each DOCR. The results after 300 iterations with a population size of 1601 (20 × + 1, where is the number of TDS and variables of the 40 relays) are shown in Table 5. The integer can be directly applied in the current intelligent electronic device (IED) settings.

Figure 7 shows the results of the comparison demonstrate that the proposed NM-PSO algorithm is clearly better than PSO and original NM-PSO in terms of the objective function, the rate of convergence, and computation speed.

To analyze the consistency in convergence of the proposed NM-PSO when solving MINLP problems, this study randomly executed the proposed method five times. As seen from Figure 8, the proposed NM-PSO can reduce the objective function to almost the same value after approximately 220 iterations. Results show that the convergence of the proposed NM-PSO is not seriously influenced by optimization problems of high complexity.

In addition to convergence rate, we investigated the final convergence values of the objective function (Obj-Fun). Figures 9(a) and 9(b) show the results of LP coordination problems, for the same number of iterations (300) and for four different populations 2 × + 1, 5 × + 1, 10 × + 1, and 20 × +1.

It can clearly be seen that the proposed NM-PSO method results in better Obj-Fun values than the PSO and original NM-PSO algorithm. For the more complicated MINLP problem shown in Figures 10(a) and 10(b), the proposed NM-PSO after 300 iterations results in even better Obj-Fun values in the case of particles 2 × + 1 than the Obj-Fun values of PSO algorithm in the case of particles 20 × + 1. Hence, the proposed method produces better results than the PSO algorithm using fewer particles (less computation time).

#### 5. Conclusions

In this paper, the DOCR coordination problem is formulated as a constrained optimization problem. It can be concluded that the proposed NM-PSO optimization algorithm is applicable to the DOCR coordination optimization of a distribution system. In contrast to other methods in the literature that only find TDS, the algorithm proposed in this study obtains and TDS values simultaneously, and the values can be represented by integers for applications in the IED setting to complete a more comprehensive coordination optimization. The proposed method makes use of the advantages of both the NM and PSO methods, while overcoming the drawbacks associated with these methods. Regardless of whether LP or MINLP is used to solve a coordination optimization problem, we have demonstrated that the proposed algorithm performs better than PSO and original NM-PSO algorithm in terms of computation speed, rate of convergence, and objective function value. The reduction in the DOCR operating time in our results demonstrates that the proposed method can be adopted for determining the optimum settings of DOCRs.

#### References

- A. J. Urdaneta, R. Nadira, and L. G. Perez Jimenez, “Optimal coordination of directional overcurrent relays in interconnected power systems,”
*IEEE Transactions on Power Delivery*, vol. 3, pp. 903–911, 1988. View at Publisher · View at Google Scholar · View at Scopus - H. A. Abyaneh, M. Al-Dabbagh, H. K. Karegar, S. H. H. Sadeghi, and R. A. J. Khan, “A new optimal approach for coordination of overcurrent relays in interconnected power systems,”
*IEEE Transactions on Power Delivery*, vol. 18, no. 2, pp. 430–435, 2003. View at Publisher · View at Google Scholar · View at Scopus - D. Birla, R. P. Maheshwari, and H. O. Gupta, “A new nonlinear directional overcurrent relay coordination technique, and banes and boons of near-end faults based approach,”
*IEEE Transactions on Power Delivery*, vol. 21, no. 3, pp. 1176–1182, 2006. View at Publisher · View at Google Scholar · View at Scopus - A. S. Noghabi, J. Sadeh, and H. R. Mashhadi, “Considering different network topologies in optimal overcurrent relay coordination using a hybrid GA,”
*IEEE Transactions on Power Delivery*, vol. 24, no. 4, pp. 1857–1863, 2009. View at Publisher · View at Google Scholar · View at Scopus - A. S. Noghabi, H. R. Mashhadi, and J. Sadeh, “Optimal coordination of directional overcurrent relays considering different network topologies using interval linear programming,”
*IEEE Transactions on Power Delivery*, vol. 25, no. 3, pp. 1348–1354, 2010. View at Publisher · View at Google Scholar · View at Scopus - P. P. Bedekar and S. R. Bhide, “Optimum coordination of directional overcurrent relays using the hybrid GA-NLP approach,”
*IEEE Transactions on Power Delivery*, vol. 26, no. 1, pp. 109–119, 2011. View at Publisher · View at Google Scholar · View at Scopus - 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 · View at Google Scholar · View at Scopus - 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 · View at Google Scholar · View at Scopus - R. C. Eberhart and J. Kennedy, “A new optimizer using particle swarm theory,” in
*Proceedings of the 6th International Symposium on Micro Machine and Human Science*, pp. 39–43, Nagoya, Japan, October 1995. View at Scopus - P. Chootinan and A. Chen, “Constraint handling in genetic algorithms using a gradient-based repair method,”
*Computers and Operations Research*, vol. 33, no. 8, pp. 2263–2281, 2006. View at Publisher · View at Google Scholar · View at Scopus - Y. Dong, J. F. Tang, B. D. Xu, and D. Wang, “An application of swarm optimization to nonlinear programming,”
*Computers and Mathematics with Applications*, vol. 49, no. 11-12, pp. 1655–1668, 2005. View at Publisher · View at Google Scholar · View at Scopus - J. H. Mathews,
*Numerical Methods Using Matlab*, Prentice-Hall, Upper Saddle River, NJ, USA, 2004. - T. Niknam, H. D. Mojarrad, and M. Nayeripour, “A new hybrid fuzzy adaptive particle swarm optimization for non-convex economic dispatch,”
*International Journal of Innovative Computing, Information and Control*, vol. 7, no. 1, pp. 189–202, 2011. View at Google Scholar · View at Scopus - C. H. Lin, J. L. Chen, and Z. L. Gaing, “Combining biometric fractal pattern and particle swarm optimization-based classifier for fingerprint recognition,”
*Mathematical Problems in Engineering*, vol. 2010, Article ID 328676, 14 pages, 2010. View at Publisher · View at Google Scholar · View at Scopus - E. Zahara and C. H. Hu, “Solving constrained optimization problems with hybrid particle swarm optimization,”
*Engineering Optimization*, vol. 40, no. 11, pp. 1031–1049, 2008. View at Publisher · View at Google Scholar · View at Scopus - E. Zahara and A. Liu, “Solving parameter identification problem by hybrid particle swarm optimization,” in
*Proceedings of the International MultiConference of Engineers and Computer Scientists 2010 (IMECS '10)*, pp. 36–38, March 2010. View at Scopus - A. Liu and E. Zahara, “Parameter identification problem using particle swarm optimization,” in
*Proceedings of the 5th International Conference on Natural Computation (ICNC '09)*, pp. 275–278, Tianjin, China, August 2009. View at Publisher · View at Google Scholar · View at Scopus - Y. T. Kao, E. Zahara, and I. W. Kao, “A hybridized approach to data clustering,”
*Expert Systems with Applications*, vol. 34, no. 3, pp. 1754–1762, 2008. View at Publisher · View at Google Scholar · View at Scopus - S. Kamel and M. Kodsi, “Modeling and simulation of IEEE 14 bus system with facts controllers,” Tech. Rep., 2009. View at Google Scholar