Student or educator? Sign up with your school email and get 6 months of Pro free.
Cited by 432

The DOI matches its Crossref record.

Market-Clearing With Stochastic Security— Part I: Formulation

Bouffard, F., Galiana, F.D., Conejo, A.J.·2005·IEEE Transactions on Power Systems

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.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1109/tpwrs.2005.857016

Cites

Statistics

Verification

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

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

Cited by

See all 432

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
0
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

How to cite

Cite CoChat for the checks on this page, and the paper for its own findings.

This page
CoChat. (2026). Citation check: Market-Clearing With Stochastic Security— Part I: Formulation. https://app.cochat.ai/papers/10.1109/tpwrs.2005.857016
The paper
Bouffard, F., Galiana, F. D., & Conejo, A. J. (2005). Market-Clearing With Stochastic Security— Part I: Formulation. IEEE Transactions on Power Systems. https://doi.org/10.1109/tpwrs.2005.857016

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.