No abstract

No abstract

This paper introduces a protective relay setting system capable of handling a large network up to 10,000 buses. The remarkable features are such useful functions as network analysis (fault analysis, load flow calculation, zero‐sequence current calculation, etc.), relay operation simulation, and automated setting coordination tasks. Fault currents in the maximum and the minimum operation networks are calculated to examine the setting values. The protection zones are searched automatically along the network connection. Protection coordination tasks among the primary and the backup relays composed of different types of relays can be performed by the relay operation simulation. The system is built on an engineering workstation, which works in cooperation with other network operation support systems. Its graphical user interface helps every engineer to examine the relay setting using a variety of databases.

A fast, innovative matching method for the spot power market, considering network constraints, has been developed. In this method, buy and sell order bids are respectively divided into the aggregated volume of several band prices. Then, the aggregated volume and the center of each band price are used to calculate an index band clearing price, which contains the real clearing price. The division and calculation process is iterated until the band price is less than the tick size of the bidding price. This method is applied to a real problem in the Japan power market, with 9 bidding areas, 10 area-connecting lines, and 9000 orders (volume/price pairs). Numerical simulation results show that the new method is ten times faster than conventional linear programming, demonstrating the effectiveness of this method.

A new practical method is proposed which gives a quasi‐optimal solution of the dynamic load‐dispatching problem formulated by a multiconstraint multiobjective optimization problem. Here, the multiple constraints are rate reserve constraints and power flow ones, and the multiple objectives are fuel cost and CO2 emission. The proposed method is an integration of the following three techniques: (1) “Group Dispatch Scheme,” which is developed by the authors, is used to satisfy a violated constraint easily. This scheme consists of three steps. The first step is to classify all generators into two groups. One is the group which should be more loaded to satisfy the violated constraint, and the other is the should‐be less loaded group. The second step is to add some load to the former group, and to subtract the same load from the latter. The third step is to dispatch each group load to each groups generators, respectively; (2) the dynamic load‐dispatching algorithm is used which provides, in practical time, quasi‐optimal generation trajectories; (3) the conventional weighting parametric method is used to obtain a Pareto optimal solution of multiobjective problems. The effectiveness of the method is clarified by a computer simulation on the actual power system of Kansai Electric Power Company.