The DOI matches its Crossref record; 14 of the 14 references it cites were found in a registry or an index.
Co-Optimization of Generation Unit Commitment and Transmission Switching With N-1 Reliability
Abstract
Currently, there is a national push for a smarter electric grid, one that is more controllable and flexible. The full control of transmission assets are not currently built into electric network optimization models. Optimal transmission switching is a straightforward way to leverage grid controllability: to make better use of the existing system and meet growing demand with existing infrastructure. Previous papers have shown that optimizing the network topology improves the dispatch of electrical networks. Such optimal topology dispatch can be categorized as a smart grid application where there is a co-optimization of both generators and transmission topology. In this paper we present a co-optimization formulation of the generation unit commitment and transmission switching problem while ensuring N-1 reliability. We show that the optimal topology of the network can vary from hour to hour. We also show that optimizing the topology can change the optimal unit commitment schedule. This problem is large and computationally complex even for medium sized systems. We present decomposition and computational approaches to solving this problem. Results are presented for the IEEE RTS 96 test case.
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
Integer and Combinatorial Optimization
Williams, H. P., Nemhauser, G. L., & Wolsey, L. A. (1990) · Journal of the Operational Research Society · doi:10.2307/2583737 · Cited by 5,485
Grigg, C., Wong, P., Albrecht, P., Allan, R., Bhavaraju, M., Billinton, R., Chen, Q., Fong, C., Haddad, S., Kuruganty, S., et al. (1999) · IEEE Transactions on Power Systems · doi:10.1109/59.780914 · Cited by 3,054
Primal-Dual Interior-Point Methods
Wright, S. J. (1997) · Society for Industrial and Applied Mathematics eBooks · doi:10.1137/1.9781611971453 · Cited by 2,391
Integer and combinatorial optimization
(1999) · Computers & Mathematics with Applications · doi:10.1016/s0898-1221(99)91259-2 · Cited by 1,117
Optimal Transmission Switching
Fisher, E. B., O’Neill, R. P., & Ferris, M. C. (2008) · IEEE Transactions on Power Systems · doi:10.1109/tpwrs.2008.922256 · Cited by 703
Self-citationOptimal response of a thermal unit to an electricity spot market
Arroyo, J. M., & Conejo, A. J. (2000) · IEEE Transactions on Power Systems · doi:10.1109/59.871739 · Cited by 536
Price-Based Unit Commitment: A Case of Lagrangian Relaxation Versus Mixed Integer Programming
Li, T., & Shahidehpour, M. (2005) · IEEE Transactions on Power Systems · doi:10.1109/tpwrs.2005.857391 · Cited by 427
Tighter Approximated MILP Formulations for Unit Commitment Problems
Frangioni, A., Gentile, C., & Lacalandra, F. (2009) · IEEE Transactions on Power Systems · doi:10.1109/tpwrs.2008.2004744 · Cited by 248
Power Generation Scheduling by Integer Programming-Development of Theory
Garver, L. L. (1962) · Transactions of the American Institute of Electrical Engineers. Part III: Power Apparatus and Systems · doi:10.1109/aieepas.1962.4501405 · Cited by 175
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
Cited by
Tight and compact MILP formulation for the thermal unit commitment problem
Morales-Espana, Latorre, J. M., & Ramos, A. (2013) · IEEE Transactions on Power Systems · doi:10.1109/tpwrs.2013.2251373 · Cited by 419
Metadata
- Authors
- Hedman, K. W., Ferris, M. C., O'Neill, R. P., Fisher, E. B., & Oren, S. S.
- Venue
- IEEE Transactions on Power Systems
- Published
- 2010-05
- Volume
- 25
- Issue
- 2
- Pages
- 1052-1063
- ISSN
- 0885-8950 (ISSN-L)
- 1558-0679
- OpenAlex
- W2138267502
- Cited by
- 410
- References
- 14
- FWCI
- 17.69
- 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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Co-Optimization of Generation Unit Commitment and Transmission Switching With N-1 Reliability. https://app.cochat.ai/papers/10.1109/tpwrs.2009.2037232
- The paper
- Hedman, K. W., Ferris, M. C., O'Neill, R. P., Fisher, E. B., & Oren, S. S. (2010). Co-Optimization of Generation Unit Commitment and Transmission Switching With N-1 Reliability. IEEE Transactions on Power Systems. https://doi.org/10.1109/tpwrs.2009.2037232
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.