W. Thomas, A. Dixon, D. Cheng, R. M. Dunnett, G. Schaff, J. Thorp
{"title":"Optimal reactive planning with security constraints","authors":"W. Thomas, A. Dixon, D. Cheng, R. M. Dunnett, G. Schaff, J. Thorp","doi":"10.1109/PICA.1995.515168","DOIUrl":"https://doi.org/10.1109/PICA.1995.515168","url":null,"abstract":"The National Grid Company (NGC) of England and Wales has developed a computer program, SCORPION, to help system planners optimize the location and size of new reactive compensation plant on the transmission system. The reactive power requirements of the NGC system have risen as a result of increased power flows and the shorter timescale on which power stations are commissioned and withdrawn from service. In view of the high costs involved, it is important that reactive compensation be installed as economically as possible, without compromising security. Traditional methods based on iterative use of a load flow program are labour intensive and subjective. SCORPION determines a near-optimal pattern of new reactive sources which are required to satisfy voltage constraints for normal and contingent states of operation of the transmission system. The algorithm processes the system states sequentially, instead of optimizing all of them simultaneously. This allows a large number of power system states to be considered with an acceptable run time and computer memory requirement. Installed reactive sources are treated as continuous, rather than discrete, variables. However, the program has a restart facility which enables the user to add realistically sized reactive sources explicitly and thereby work towards a realizable solution to the planning problem.","PeriodicalId":294493,"journal":{"name":"Proceedings of Power Industry Computer Applications Conference","volume":"57 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1995-05-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133565439","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
J. Wrubel, P.S. Rapcienski, K.L. Lee, B.S. Gisin, G. Woodzell
{"title":"Practical experience with corrective switching algorithm for on-line applications","authors":"J. Wrubel, P.S. Rapcienski, K.L. Lee, B.S. Gisin, G. Woodzell","doi":"10.1109/PICA.1995.515208","DOIUrl":"https://doi.org/10.1109/PICA.1995.515208","url":null,"abstract":"The objective of the corrective switching algorithm (CSA) is to identify switching candidates to eliminate or reduce system overloads. This paper describes the implementation of the CSA for on-line contingency analysis. The developed program searches for the best switching candidates from a user specified list, which normally includes all branches in the study area and most typical switching operations (openings and closings) at main substations. The developed algorithm has the unique ability to process complicated substation busbar switching scenarios, including multiple switching scenarios per any substation. The selection algorithm is based on a linearized DC model, but all selected candidates are verified using AC load flows. The program has been used as part of the security analysis program at Public Service Electric and Gas Company (PSE&G) since Summer 1993 and has proved its reliability and efficiency.","PeriodicalId":294493,"journal":{"name":"Proceedings of Power Industry Computer Applications Conference","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1995-05-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132762234","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
J. Shinohara, I. Kozakai, M. Kunugi, J. Nagata, H. Saito
{"title":"Knowledge-based behavior interface: its application to power network restoration support system","authors":"J. Shinohara, I. Kozakai, M. Kunugi, J. Nagata, H. Saito","doi":"10.1109/PICA.1995.515198","DOIUrl":"https://doi.org/10.1109/PICA.1995.515198","url":null,"abstract":"The characteristics of power system restoration (its combinational aspects, use of knowledge from a wide variety of origins and of different types and number of criteria to satisfy) make it a difficult problem. As a solution, a number of research teams are considering the use of expert systems to generate restoration plans. Promising results have already been obtained. Yet most expert systems remain in the prototype stage. One reason seems to be that the study of support systems for knowledge-based behavior (unable to describe with any rule) is insufficient. This paper begins by analyzing power system restoration based on the human performance model and discusses knowledge-based behavior as a high conceptual level human performance to solve this problem with combinational aspects. The paper then reports on its applications to the trunk line power network dispatching center. Finally the paper verifies the relation between knowledge-based behavior and designed human interfaces with a power network restoration case-study.","PeriodicalId":294493,"journal":{"name":"Proceedings of Power Industry Computer Applications Conference","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1995-05-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130424906","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Integrated methodology for transmission and reactive power planning","authors":"V. Levi, D. Popović","doi":"10.1109/PICA.1995.515196","DOIUrl":"https://doi.org/10.1109/PICA.1995.515196","url":null,"abstract":"This paper presents the comprehensive methodology for solving the transmission reinforcement and reactive power planning problems. The static approach is applied to both problems and they are separated into corresponding investment and operation subproblems. The solution of the transmission reinforcement investment problem is obtained through the further decomposition to two independent subproblems, while the operation problem is dealt with by the Monte Carlo simulation. Both the investment and operation problems of the reactive power planning are studied with the optimum power flow models which are extended to encompass the voltage stability.","PeriodicalId":294493,"journal":{"name":"Proceedings of Power Industry Computer Applications Conference","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1995-05-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122307839","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Identification of ARMAX model for short term load forecasting: an evolutionary programming approach","authors":"Hong-Tzer Yang, Chao-Ming Huang, C. Huang","doi":"10.1109/PICA.1995.515202","DOIUrl":"https://doi.org/10.1109/PICA.1995.515202","url":null,"abstract":"This paper proposes a new evolutionary programming (EP) approach to identify the autoregressive moving average with exogenous variable (ARMAX) model for one day to one week ahead hourly load demand forecasts. Typically, the surface of forecasting error function possesses multiple local minimum points. Solutions of the traditional gradient search based identification technique therefore may stall at the local optimal points which lead to an inadequate model. By simulating a natural evolutionary process, the EP algorithm offers the capability of converging towards the global extremum of a complex error surface. The developed EP based load forecasting algorithm is verified by using different types of data for the Taiwan Power (Taipower) system and substation load as well as temperature values. Numerical results indicate the proposed EP approach provides a method to simultaneously estimate the appropriate order and parameter values of the ARMAX model for diverse types of load data. Comparisons of forecasting errors are made to the traditional identification techniques.","PeriodicalId":294493,"journal":{"name":"Proceedings of Power Industry Computer Applications Conference","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1995-05-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121020098","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Computer aided power flow software engineering and code generation","authors":"R. Bacher","doi":"10.1109/PICA.1995.515280","DOIUrl":"https://doi.org/10.1109/PICA.1995.515280","url":null,"abstract":"In this paper a software engineering concept is described which permits the automatic solution of a nonlinear set of network equations. The power how equation set can be seen as a defined subset of a network equation set. The automated solution process is the numerical Newton-Raphson solution process of the power flow equations where the key code parts are the numeric mismatch and the numeric Jacobian term computation. It is shown that both the Jacobian and the mismatch term source code can be automatically generated in a conventional language such as Fortran or C. Thereby one starts from a high level, symbolic language with automatic differentiation and code generation facilities. As a result of this software engineering process an efficient, very high quality Newton-Raphson solution code is generated which allows easier implementation of network equation model enhancements and easier code maintenance as compared to hand-coded Fortran or C code.","PeriodicalId":294493,"journal":{"name":"Proceedings of Power Industry Computer Applications Conference","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1995-05-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121744098","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
J. Robinson, T. Saxton, A. Vojdani, D. Ambrose, G. Schimmel, R.R. Blaesing, R. Larson
{"title":"Development of the Intercontrol Center Communications Protocol (ICCP) [power system control]","authors":"J. Robinson, T. Saxton, A. Vojdani, D. Ambrose, G. Schimmel, R.R. Blaesing, R. Larson","doi":"10.1109/PICA.1995.515277","DOIUrl":"https://doi.org/10.1109/PICA.1995.515277","url":null,"abstract":"After a three-year research and development project that included a collaborative effort by EPRI and 20 electric utilities and vendors in the USA, two electric utilities conducted full-scale demonstrations of a proposed international standard, UCA compliant protocol for communicating between power system control centers. The recently developed Intercontrol Center Communications Protocol (ICCP) was implemented and tested at Western Area Power Administration's (WAPA) Loveland area office and at Ohio Edison (OE) company. A third node at the vendor, Harris Controls, allowed demonstration of routing and networking capabilities.","PeriodicalId":294493,"journal":{"name":"Proceedings of Power Industry Computer Applications Conference","volume":"27 4","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1995-05-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"113987828","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"A new successive relaxation scheme for the W-matrix solution method on a shared memory parallel computer [power system analysis]","authors":"J. Wu, A. Bose","doi":"10.1109/PICA.1995.515164","DOIUrl":"https://doi.org/10.1109/PICA.1995.515164","url":null,"abstract":"The W-matrix method has the potential to be efficient for parallel computing as a substitute for the precedence stringent substitution schemes, which are being commonly used on sequential computers for the solution of power system sparse linear matrix equations, with the support of appropriate reordering and partitioning algorithms. In this paper, the factors which may affect the performance of the W-matrix method are examined first. A bus reordering and partitioning scheme is then proposed which is aimed at reducing the fill-ins in both the triangular matrices L power system and U and the W-matrices and adjusting the patterns of the W-matrices for better parallel efficiency. Tests conducted on a shared memory parallel computer proved the effectiveness of the proposed algorithm for various power systems. Test results are presented and discussed.","PeriodicalId":294493,"journal":{"name":"Proceedings of Power Industry Computer Applications Conference","volume":"529 ","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1995-05-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134127940","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
J. Sanchez-Gasca, R. D'aquila, W. Price, J. Paserba
{"title":"Variable time step, implicit integration for extended-term power system dynamic simulation","authors":"J. Sanchez-Gasca, R. D'aquila, W. Price, J. Paserba","doi":"10.1109/PICA.1995.515182","DOIUrl":"https://doi.org/10.1109/PICA.1995.515182","url":null,"abstract":"This paper describes the development of a variable time step algorithm for the numerical simulation of power system phenomena spanning time periods from several seconds to several hours. The algorithm automatically reduces the time step of integration to capture fast transients and increases it when the system variables are varying slowly. The solution algorithm is based on a numerically stable, implicit, low order integration similar to the trapezoidal rule. Computer simulation results for two scenarios are presented. These scenarios are: a severe power system load ramp leading to voltage collapse; and a six-hour operational cycle.","PeriodicalId":294493,"journal":{"name":"Proceedings of Power Industry Computer Applications Conference","volume":"324 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1995-05-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132775708","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Multi-objective feeder reconfiguration by distribution management system","authors":"I. Roytelman, V. Melnik, S.S.H. Lee, R. Lugtu","doi":"10.1109/PICA.1995.515286","DOIUrl":"https://doi.org/10.1109/PICA.1995.515286","url":null,"abstract":"Feeder reconfiguration for use by distribution management systems is discussed in this paper. Multiple objectives are proposed to reflect realistic operating environments while achieving all benefits from feeder reconfiguration. The multiple objectives considered are minimization of power losses, load balancing among supply transformers, minimization of the worst voltage drop, minimization of service interruption frequency, and balanced service of important customers for enhanced service reliability. The objective function containing five different objectives are optimized subject to capacity and protection device constraints. The overall solution approach is a two-stage process. In the first stage, a suboptimal solution is found by analyzing the mesh distribution system in which all open switches are simulated to be closed. Applying special power flow analyses to this mesh network, a radial distribution system is determined as an intermediate solution. In the second stage, this solution is continuously improved by the branch exchange scheme. Special topology models are also developed to accelerate the search procedure. Use of the algorithm is illustrated by numerical examples.","PeriodicalId":294493,"journal":{"name":"Proceedings of Power Industry Computer Applications Conference","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1995-05-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133690902","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}