Optimal coordination of directional overcurrent relays ininterconnected power systems

The authors present a new methodology based upon the principles of optimization theory, to treat the problem of optimal coordination of directional overcurrent relays in interconnected power systems. With the application of the proposed technique, this coordination problem is stated as a parameter optimization problem, which in general, is of a large dimension, especially when many different system configurations and perturbations are to be considered. Several optimization procedures, including direct methods and decomposition techniques, for solving this large scale coordination problem are described, and results of optimally coordinating directional overcurrent relays in power systems with up to 30 buses are presented     

Optimal coordination of directional overcurrent relays consideringdefinite time backup relaying

A methodology is presented for the consideration of definite-time backup relays in the optimal coordination of directional overcurrent relays using linear programming. It is shown that the influence of considering second-zone distance relays and breaker failure relays impose important requirements for the determination of the time dial settings of directional overcurrent relays. The paper introduces a revised formulation of the optimization problem. Results are presented for the application of the methodology on a power system with 2 generators, 9 buses, 2 transformers and 7 transmission lines     

Optimal coordination of directional overcurrent relays consideringdynamic changes in the network topology

This paper presents a method to consider the dynamic changes in the network's topology for the coordination of directional overcurrent relays using linear programming. The proper coordination constraints are included by using linear approximations for the relay dynamics. The application of the methodology as well as the importance of considering the transient configuration changes are illustrated with a practical example and a test case consisting of a real industrial power system     

Computer aided coordination of directional relays: determination ofbreak points

The directional overcurrent and distance relays of a multiloop network must be set in a sequence to ensure coordination. The starting points of the sequence are called break points. An algorithm to determine the minimum number of break points is presented. It can be readily implemented on a computer and forms a basic component of a computer-aided-design package for a protective system     

Optimal computation of distance relays second zone timing in amixed protection scheme with directional overcurrent relays

This paper describes a technique to determine the optimal time setting for the second zone of distance relays when used in a mixed protection scheme with directional overcurrent relays. The technique consists of including the second zone operation time as a new variable in the original problem statement of optimal computation of directional overcurrent relays settings. It is shown that the influence of distance relays and directional overcurrent relays must be considered when the settings of these relays are computed. Numerical results obtained with the proposed method for a realistic power system are presented     

Presolve analysis and interior point solutions of the linear programming coordination problem of directional overcurrent relays

A linear programming interior point algorithm is proposed for the solution of the problem of coordinating directional overcurrent relays in interconnected power systems considering definite time backup relaying. The proposed algorithm is a variation of the primal–dual approach that uses multiple correctors of centrality. Pre-solution problem filtering simplification techniques are used prior to the application of the linear programming algorithm. Results are presented for the application of the methodology on a realistic test case, a 115–69 kV power system with 108 buses, 86 lines, 61 transformers, and 97 directional overcurrent relays. Optimal solutions are found in an automatic fashion, using the algorithm for the settings of the ground relays as well as for the phase relays. The application of the pre-solution problem simplification techniques is highly recommended, resulting in a significant reduction of the size and complexity of the linear programming problem to be solved. The interior point approach reaches a feasible point in the close vicinity of the final optimal result in only one or two iterations. This fact represents an advantage for on-line applications. The proposed methodology and in particular the use of the presolve problem simplification techniques is shown as a new valuable tool for the setting of directional overcurrent relays in interconnected power systems.     

A novel method for optimal coordination of directional overcurrent relays considering their available discrete settings and several operation characteristics

For optimal coordination of directional overcurrent relay we propose to consider operation characteristics, pickup current and time multiplier setting of relays as optimization parameters. Each parameter is optimized independently with the aid of linear formulation of the coordination problem. First, optimal discrete values of pickup current are selected. Second, adequate operation time characteristics of relays are selected. Third, optimal discrete values of time multiplier setting are determined. The proposed method is tested on two networks: an 8-bus system and the IEEE 30-bus system. Its performances are evaluated and compared with those of the linear and nonlinear programming techniques.     

Efficient coordination of ROCOF and frequency relays for distributed generation protection by using the application region

This paper proposes a method for determining the coordination of the rate of change of frequency (ROCOF) and under/overfrequency relays for distributed generation protection considering islanding detection and frequency-tripping requirements. The method is based on the concept of application region, which defines a region in the trigger time versus active power imbalance space where frequency-based relays can be adjusted to satisfy the anti-islanding and frequency-tripping requirements simultaneously. This method can be used to optimally determine the instantaneous and time-delay settings of different frequency-based relays in a unified manner. The application region can be also employed to evaluate how much an existing frequency-based protection scheme violates one of the above-mentioned requirements. In addition, it can be used to set different combinations of frequency-based relays in order to make the distributed generator frequency-based protection system as efficient as possible, since it respects the region that satisfies both requirements.     

A novel algorithm to determine minimum break point set for optimum cooperation of directional protection relays in multiloop networks

Determining minimum break point set (MBPS) is necessary before setting distance protection relays or zero-sequence protection relays in multiloop extremely high voltage power networks. Determining directional simple loops (DSLs) and relative sequence groups (RSGs) is the prerequisite of traditional algorithms which are used to determine MBPS. In order to reduce the CPU time and complexity of calculating MBPS, a new concept named as protection relay dependency dimension (PRDD) is presented for the first time in this paper. By comparison of PRDD in a multiloop network, the MBPS can be determined, and the process of comparisons will not stop until the MBPS of the multiloop networks is discovered. In the meantime, the RSG could be easily determined by means of judging whether the primary protection relay set of a protection relay is null or not. The new algorithm leaves out those laborious steps, such as determining all of the DSLs and RSGs. Some examples are given to illuminate the novel algorithm presented in the paper to be simple and effective.     

用遗传算法求解广义系统最优同时镇定问题

研究了用改进的遗传算法（简称GA）求解同时镇定一族线性定常广义系统的最优输出反馈控制律问题。在满足稳定性的条件,将最优同时镇定转化为一个受约束的非线性最小问题。引入了自适应机制和惩罚函数变换,对传统的GA进行改造。并用于受约束非线性问题的全局优化。计算结果和数值仿真说明GA是求解同时镇定问题的一种有效的数值方法。     

基于遗传算法(GA)的配网无功优化控制的两部算法

提出了基于遗传算法的两部算法,该算法经用Ｃ＋＋语言编程后,分别在１６节点和４４节点算例系统上测试,结果表明两部算法比单纯用遗传算法可以在更短的计算时间内获得更好的解。     

Optimal power flow solution of two-terminal HVDC systems using genetic algorithm

The usage extensively of high voltage direct current (HVDC) transmission links in recent years makes it necessary further work in this area. Therefore, two-terminal HVDC transmission link is one of most important elements in electrical power systems. HVDC link representation is mostly ignored and simplified for optimal power flow (OPF) studies in power systems. OPF problem of purely alternating current (AC) power systems is defined as minimization of the fuel cost to subjected equality and inequality constraints. Hence, OPF software of purely AC power systems is extended by taking into consideration power transfer control characteristics of HVDC links. In this paper, OPF problem of integrated AC–DC power systems is first solved by genetic algorithm that is a heuristic algorithm based on evolutionary. The proposed method is tested on two test systems which are the modified 5-node test system and the modified WSCC 9-bus test system. In order to show effectiveness and efficiency of the proposed method, the obtained results are compared to that reported in the literature.     

Optimal placement of line switches for distribution automation systems using immune algorithm

To enhance the cost effectiveness of the distribution automation system (DAS), this paper proposes the immune algorithm (IA) to derive the optimal placement of switching devices by minimizing the total cost of customer service outage and investment cost of line switches. The reliability index of each service zone defined by the boundary switches is derived to solve the expected energy not served due to fault contingency, and the customer interruption cost is then determined according to the customer type and power consumption within the service zone. To demonstrate the effectiveness of proposed IA methodology to solve the optimal placement of line switches, a practical distribution system of Taiwan Power Company (Taipower) is selected for computer simulation to explore the cost benefit of line switch placement for DAS.     

Optimal placement of PMUs to maintain network observability using a modified BPSO algorithm

This paper presents a novel approach to optimal placement of Phasor Measurement Units (PMUs) for state estimation. At first, an optimal measurement set is determined to achieve full network observability during normal conditions, i.e. no PMU failure or transmission line outage. Then, in order to consider contingency conditions, the derived scheme in normal conditions is modified to maintain network observability after any PMU loss or a single transmission line outage. Observability analysis is carried out using topological observability rules. A new rule is added that can decrease the number of required PMUs for complete system observability. A modified Binary Particle Swarm Optimization (BPSO) algorithm is used as an optimization tool to obtain the minimal number of PMUs and their corresponding locations while satisfying associated constraint. Numerical results on different IEEE test systems are presented to demonstrate the effectiveness of the proposed approach.     

应用改进遗传算法实现输电网络最优规划

对传统遗传算法中的交叉和变异算子算法进行了改进,并实施了在初始群体中保留若干最优解的策略,形成了改进遗传算法,并将其应用在输电网络优化规划中。改进的遗传算法具有快速搜索,易收敛和鲁棒性强的特点,算例验证了该方法应用到输电网络规划中的有效性。     

Nuclear reactor diagnostic system using genetic algorithm (GA)-trained neural networks

Several nuclear reactor diagnostic systems using neural networks have been proposed in recent years. Neural networks trained by backpropagation, the standard training algorithm, have certain problems such as local minima and long training times. In this paper, neural networks trained by genetic algorithms are used in a nuclear reactor diagnostic system to solve these problems. The system is tested by simulated data modeled on the experimental fast reactor JOYO, and two categories of abnormality (abnormal control rod vibration and abnormal coolant flow) are identified. The comparisons to networks trained by back-propagation also are discussed.     

基于模拟退火的粒子群算法在水电站水库优化调度中的应用

介绍了一种基于模拟退火的粒子群算法,并用其求解以水电站年发电量最大建立的优化调度的数学模型.考虑到基本的粒子群算法(PSO)后期粒子趋向同一化,使其进化速度变慢,精度较差,本文将模拟退火的思想应用到具有杂交和变异的粒子群算法当中,通过模拟退火的降温过程来提高算法后期的进化速度和精度.最后,以普定水电站的优化调度为例进行了计算,结果表明,该算法的性能较基本粒子群算法有了较大改善,且明显优于常规调度方法和动态规划.     

Optimal location and sizing of capacitor placement in radial distribution system using Bacterial Foraging Optimization Algorithm

This study introduces a new long term scheduling for optimal allocation of capacitor bank in radial distribution system with the objective of minimizing power loss of the system subjected to equality and in equality constraints. In the proposed method the new integrated approach of Loss Sensitivity Factor (LSF) and Voltage Stability Index (VSI) are implemented to determine the optimal location for installation of capacitor banks. Bacterial Foraging optimization algorithm (BFOA) is proposed to find the optimal size of the capacitor banks. The proposed method is applied on IEEE 34-bus and 85-bus radial distribution system with all possible load changes. The load is varied from light load (50%) to peak load (160%) with a step size of 1% and optimization procedure is followed to entire period. The generalized equation obtained from the curve fitting technique is very much helpful for the Distribution Network Operators (DNOs) to adjust the capacitor size according to the load changes. The simulated results demonstrate well the performance and effectiveness of the proposed method.     

优化开关模式在高频SVPWM逆变器中的应用

针对数字化高频SVPWM逆变器的特殊要求，提出了两种适用于高频SVPWM算法的优化开关模式，分别采用纯软件方法和软件结合DSP内部空间矢量。PWM集成硬件的混合方法，应用于一高频SVPWM逆变器样机。该样机采用TMS320LF2407A构成的最小控制系统，可输出0～1kHz连续可调的三相交流电。