AN APPLICATION OF ANALYTIC HIERARCHY PROCESS TO AUTOMATIC CONTINGENCY SELECTION AND RANKING

This paper presents an approach to study the problem of automatic continency selection and ranking with the analytic hierarchy process, and takes into consideration the relative importance of transmission lines and the situation that the real and reactive power security constraints are violated as the line outage appears. Thus, the precise information in the real time security analysis and economic dispatch can be provided.     

AUTOMATIC CONTINGENCY SELECTION AND RANKING BY NETWORK PROGRAMMING APPROACH

This paper presents a new approach ,to the automatic contingency selection and ranking by the network flow programming (NFP). A complex cost optimisation model based on economy and security, and several simplified models are proposed in the paper. The performance index is the total load curtailment or its weighted value. All the solution algorithms are OKA. The model and its algorithm is tested on IEEE 30-Bus System and the encouraging results are obtained.     

A NONLINEAR PROGRAMMING MODEL AND ITS ALGORITHM FOR TRANSMISSION NETWORK PLANNING

The problem of transmission network planning is studied thoroughly by applying the mathmatical optimal tecqhniue in this paper. A novel approach is put forward for computer aided transmission network planning, which is quite different from what is based on D.C. load flow equations. A nonlinear transmission planning model is set up by regarding A.C. load flow equations as the system model. A practical model which can be solved more easily, and an united algorithm are obtained by applying the SUMT to the nonlinear model. The results of some practical examples indicate that this method can not only make the planning results more accurate, but also provide the voltage qualities and produce planning plans autometically and seek the plans optimally and fast.