The DOI matches its Crossref record; 32 of the 32 references it cites were found in a registry or an index.
Market-Clearing With Stochastic Security— Part I: Formulation
Abstract
The first of this two-paper series formulates a stochastic security-constrained multi-period electricity market-clearing problem with unit commitment. The stochastic security criterion accounts for a pre-selected set of random generator and line outages with known historical failure rates and involuntary load shedding as optimization variables. Unlike the classical deterministic reserve-constrained unit commitment, here the reserve services are determined by economically penalizing the operation of the market by the expected load not served. The proposed formulation is a stochastic programming problem that optimizes, concurrently with the pre-contingency social welfare, the expected operating costs associated with the deployment of the reserves following the contingencies. This stochastic programming formulation is solved in the second companion paper using mixed-integer linear programming methods. Two cases are presented: a small transmission-constrained three-bus network scheduled over a horizon of four hours and the IEEE Reliability Test System scheduled over 24 h. The impact on the resulting generation and reserve schedules of transmission constraints and generation ramp limits, of demand-side reserve, of the value of load not served, and of the constitution of the pre-selected set of contingencies are assessed.
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
Probability, Random Variables, and Stochastic Processes.
Abrahams, J., & Papoulis, A. (1984) · Journal of the American Statistical Association · doi:10.2307/2288754 · Cited by 16,226
Probability, Random Variables, and Stochastic Processes
Miller, I. (1966) · Technometrics · doi:10.1080/00401706.1966.10490365 · Cited by 8,452
Introduction to Stochastic Programming
Birge, J. R., & Louveaux, F. (2011) · Springer Series in Operations Research and Financial Engineering · doi:10.1007/978-1-4614-0237-4 · Cited by 6,469
Probability, Random Variables, and Stochastic Processes
Papoulis, A., & Hoffman, J. G. (1967) · Physics Today · doi:10.1063/1.3034123 · Cited by 4,107
Partitioning procedures for solving mixed-variables programming problems
Benders, J. F. (1962) · Numerische Mathematik · doi:10.1007/bf01386316 · Cited by 3,855
Reliability Evaluation of Power Systems
Billinton, R., & Allan, R. N. (1984) · Springer eBooks · doi:10.1007/978-1-4615-7731-7 · Cited by 3,350
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
Reliability Evaluation of Power Systems
Billinton, R., & Allan, R. N. (1996) · Springer eBooks · doi:10.1007/978-1-4899-1860-4 · Cited by 2,974
Introduction to linear optimization
Bertsimas, D., & Tsitsiklis, J. N. (1997) · Cited by 2,705
Branch-and-price: column generation for solving huge integer programs
Barnhart, C., Johnson, E. L., Nemhauser, G. L., Savelsbergh, M. W. P., & Vance, P. H. (1998) · Operations Research · doi:10.1287/opre.46.3.316 · Cited by 2,219
Cited by
Stochastic Security for Operations Planning With Significant Wind Power Generation
Bouffard, F., & Galiana, F. D. (2008) · IEEE Transactions on Power Systems · doi:10.1109/tpwrs.2008.919318 · Cited by 713
Self-citationStochastic Optimization for Unit Commitment—A Review
Zheng, Q. P., Wang, J., & Liu, A. L. (2015) · IEEE Transactions on Power Systems · doi:10.1109/tpwrs.2014.2355204 · Cited by 643
Benefits and challenges of electrical demand response: a critical review
O׳Connell, N., Pinson, P., Madsen, H., & O׳Malley, M. (2014) · Renewable and Sustainable Energy Reviews · doi:10.1016/j.rser.2014.07.098 · Cited by 636
“This is predominantly employed in studies considering the impact of demand response on the system capacity requirements and the need for generation reserves [48,50,60].”
BackgroundReserve Requirements for Wind Power Integration: A Scenario-Based Stochastic Programming Framework
Papavasiliou, A., Oren, S. S., & O'Neill, R. P. (2011) · IEEE Transactions on Power Systems · doi:10.1109/tpwrs.2011.2121095 · Cited by 580
Economic Valuation of Reserves in Power Systems With High Penetration of Wind Power
Morales, J. M., Conejo, A. J., & Perez-Ruiz, J. (2009) · IEEE Transactions on Power Systems · doi:10.1109/tpwrs.2009.2016598 · Cited by 573
Self-citationA Review of Power System Flexibility With High Penetration of Renewables
Mohandes, B., Moursi, M. S. E., Hatziargyriou, N., & Khatib, S. E. (2019) · IEEE Transactions on Power Systems · doi:10.1109/tpwrs.2019.2897727 · Cited by 496
Demand Response Scheduling by Stochastic SCUC
Parvania, M., & Fotuhi-Firuzabad, M. (2010) · IEEE Transactions on Smart Grid · doi:10.1109/tsg.2010.2046430 · Cited by 427
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
“Nevertheless, improving an MILP formulation can dramatically reduce its computational burden and thus allow the implementation of more advanced and computationally demanding problems, such as stochastic formulations [7], accurate modelling of different types of (online and offline) reserves [8], or transmission switch…”
BackgroundIntegrated scheduling of renewable generation and demand response programs in a microgrid
Mazidi, M., Zakariazadeh, A., Jadid, S., & Siano, P. (2014) · Energy Conversion and Management · doi:10.1016/j.enconman.2014.06.078 · Cited by 404
Unified Stochastic and Robust Unit Commitment
Zhao, C., & Guan, Y. (2013) · IEEE Transactions on Power Systems · doi:10.1109/tpwrs.2013.2251916 · Cited by 323
Intermittency and the Value of Renewable Energy
Gowrisankaran, G., Reynolds, S. S., & Samano, M. (2016) · Journal of Political Economy · doi:10.1086/686733 · Cited by 322
Smart microgrid energy and reserve scheduling with demand response using stochastic optimization
Zakariazadeh, A., Jadid, S., & Siano, P. (2014) · International Journal of Electrical Power & Energy Systems · doi:10.1016/j.ijepes.2014.06.037 · Cited by 296
Aghajani, G. R., Shayanfar, H. A., & Shayeghi, H. (2017) · Energy · doi:10.1016/j.energy.2017.03.051 · Cited by 293
Data-Driven Stochastic Unit Commitment for Integrating Wind Generation
Zhao, C., & Guan, Y. (2016) · IEEE Transactions on Power Systems · doi:10.1109/tpwrs.2015.2477311 · Cited by 279
Optimal Participation of an Electric Vehicle Aggregator in Day-Ahead Energy and Reserve Markets
Sarker, M. R., Dvorkin, Y., & Ortega-Vazquez, M. A. (2016) · IEEE Transactions on Power Systems · doi:10.1109/tpwrs.2015.2496551 · Cited by 270
Day-ahead resource scheduling of a renewable energy based virtual power plant
Zamani, A. G., Zakariazadeh, A., & Jadid, S. (2016) · Applied Energy · doi:10.1016/j.apenergy.2016.02.011 · Cited by 266
A review of optimal power flow studies applied to smart grids and microgrids
Abdi, H., Beigvand, S. D., & Scala, M. L. (2017) · Renewable and Sustainable Energy Reviews · doi:10.1016/j.rser.2016.12.102 · Cited by 254
Metadata
- Authors
- Bouffard, F., Galiana, F. D., & Conejo, A. J.
- Venue
- IEEE Transactions on Power Systems
- Published
- 2005-11
- Volume
- 20
- Issue
- 4
- Pages
- 1818-1826
- ISSN
- 0885-8950 (ISSN-L)
- OpenAlex
- W2102161868
- Cited by
- 432
- References
- 32
- FWCI
- 8.90
- 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.