The DOI matches its Crossref record; 16 of the 16 references it cites were found in a registry or an index.
Security analysis and optimization
Abstract
An operationally "secure" power system is one with low probability of blackout or equipment damage. The power system control processes needed to maintain a designated security level at minimum operating cost are extremely complicated. They increasingly depend upon on-line computer security analysis and optimization. This on-line technology is still relatively new, with enormous further potential. Since security and optimality are normally conflicting requirements of power system control, it is inappropriate to treat them separately. Therefore, they are slowly becoming coalesced into a unified hierarchical mathematical problem formulation: one that is, however, far too complex to afford anything but an approximate, near-optimal solution. The practical validity of this unifying trend relies on being able to incorporate all significant security constraints within the process. The main two current computational tools in this field are contingency analysis and special operations-oriented versions of optimal power flow (OPF). Contingency analysis identifies potential emergencies through extensive "what if?." simulations on the power system network. OPF is a major extension to the conventional dispatch calculation. It can respect system static security limits, and can schedule reactive as well as active power. Moreover, the advanced versions of OPF include or interface with contingency analysis. This paper reviews present formulations and methods, and tries to point out areas of difficulty that constitute the main challenges for successful practical on-line implementations over the coming years.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Levary, R. R. (1982) · European Journal of Operational Research · doi:10.1016/0377-2217(82)90093-5 · Cited by 4,158
Dommel, H., & Tinney, W. (1968) · IEEE Transactions on Power Apparatus and Systems · doi:10.1109/tpas.1968.292150 · Cited by 1,664
Optimal Load Flow with Steady-State Security
Alsac, O., & Stott, B. (1974) · IEEE Transactions on Power Apparatus and Systems · doi:10.1109/tpas.1974.293972 · Cited by 1,557
Self-citationStott, B., & Alsac, O. (1974) · IEEE Transactions on Power Apparatus and Systems · doi:10.1109/tpas.1974.293985 · Cited by 1,522
Self-citationPower Flow Solution by Newton's Method
Tinney, W., & Hart, C. (1967) · IEEE Transactions on Power Apparatus and Systems · doi:10.1109/tpas.1967.291823 · Cited by 1,215
Optimal Power Flow By Newton Approach
Sun, D., Ashley, B., Brewer, B., Hughes, A., & Tinney, W. (1984) · IEEE Transactions on Power Apparatus and Systems · doi:10.1109/tpas.1984.318284 · Cited by 942
Contribution a l’etude du dispatching economique.
Carpentier, J. L. (1962) · Cited by 894
Review of load-flow calculation methods
Stott, B. (1974) · Proceedings of the IEEE · doi:10.1109/proc.1974.9544 · Cited by 747
Self-citationSecurity-Constrained Optimal Power Flow with Post-Contingency Corrective Rescheduling
Monticelli, A., Pereira, M. V. F., & Granville, S. (1987) · IEEE Transactions on Power Systems · doi:10.1109/tpwrs.1987.4335095 · Cited by 664
Self-citationOptimal power dispatchߞA comprehensive survey
Happ, H. H. (1977) · IEEE Transactions on Power Apparatus and Systems · doi:10.1109/t-pas.1977.32397 · Cited by 310
Operating under stress and strain [electrical power systems control under emergency conditions]
Fink, L. H., & Carlsen, K. (1978) · IEEE Spectrum · doi:10.1109/mspec.1978.6369445 · Cited by 281
Power System Security Control Calculations Using Linear Programming, Part I
Stott, B., & Hobson, E. (1978) · IEEE Transactions on Power Apparatus and Systems · doi:10.1109/tpas.1978.354664 · Cited by 255
Self-citationFast Contingency Evaluation Using Concentric Relaxation
Zaborszky, J., Whang, K.-W., & Prasad, K. (1980) · IEEE Transactions on Power Apparatus and Systems · doi:10.1109/tpas.1980.319605 · Cited by 166
Network Topology Optimization with Security Constraints
Bacher, R., & Glavitsch, H. (1986) · IEEE Transactions on Power Systems · doi:10.1109/tpwrs.1986.4335024 · Cited by 165
Decoupled Optimal Load Flow Using Linear or Quadratic Programming
Contaxis, G. C., Delkis, C., & Korres, G. N. (1986) · IEEE Transactions on Power Systems · doi:10.1109/tpwrs.1986.4334888 · Cited by 88
Optimal Power Flows: Uses, Methods and Developments
Carpentier, J. L. (1985) · IFAC Proceedings Volumes · doi:10.1016/s1474-6670(17)60410-5 · Cited by 88
Cited by
A review of recent advances in economic dispatch
Chowdhury, B. H., & Rahman, S. (1990) · IEEE Transactions on Power Systems · doi:10.1109/59.99376 · Cited by 680
A survey of the optimal power flow literature
Huneault, M., & Galiana, F. D. (1991) · IEEE Transactions on Power Systems · doi:10.1109/59.76723 · Cited by 603
Optimal power flow: a bibliographic survey I: Formulations and deterministic methods
Frank, S., Steponavice, I., & Rebennack, S. (2012) · Energy Systems · doi:10.1007/s12667-012-0056-y · Cited by 554
Further developments in LP-based optimal power flow
Alsac, O., Bright, J., Prais, M., & Stott, B. (1990) · IEEE Transactions on Power Systems · doi:10.1109/59.65896 · Cited by 527
Self-citationAn interior-point method for nonlinear optimal power flow using voltage rectangular coordinates
Torres, G. L., & Quintana, V. H. (1998) · IEEE Transactions on Power Systems · doi:10.1109/59.736231 · Cited by 355
Metadata
- Authors
- Stott, B., Alsac, O., & Monticelli, A. J.
- Venue
- Proceedings of the IEEE
- Published
- 1987
- Volume
- 75
- Issue
- 12
- Pages
- 1623-1644
- ISSN
- 0018-9219 (ISSN-L)
- OpenAlex
- W2029780375
- Cited by
- 553
- References
- 16
- FWCI
- 12.78
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.