The DOI matches its Crossref record; 11 of the 11 references it cites were found in a registry or an index.
Scenario reduction and scenario tree construction for power management problems
Abstract
Portfolio and risk management problems of power utilities may be modeled by multistage stochastic programs. These models use a set of scenarios and corresponding probabilities to model the multivariate random data process (electrical load, stream flows to hydro units, and fuel and electricity prices). For most practical problems the optimization problem that contains all possible scenarios is too large. Due to computational complexity and to time limitations this program is often approximated by a model involving a (much) smaller number of scenarios. The proposed reduction algorithms determine a subset of the initial scenario set and assign new probabilities to the preserved scenarios. The scenario tree construction algorithms successively reduce the number of nodes of a fan of individual scenarios by modifying the tree structure and by bundling similar scenarios. Numerical experience is reported for constructing scenario trees for the load and spot market prices entering a stochastic portfolio management model of a German utility.
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
Stochastic Programming: The State of the Art In Honor of George B. Dantzig
(2010) · International series in management science/operations research/International series in operations research & management science · doi:10.1007/978-1-4419-1642-6 · Cited by 2,239
Multi-stage stochastic optimization applied to energy planning
Pereira, M. V. F., & Pinto, L. M. V. G. (1991) · Mathematical Programming · doi:10.1007/bf01582895 · Cited by 1,361
Scenario reduction in stochastic programming
Dupa?ov�, J., Gr�we-Kuska, N., & R�misch, W. (2003) · Mathematical Programming · doi:10.1007/s10107-002-0331-0 · Cited by 1,041
Scenario Reduction Algorithms in Stochastic Programming
Heitsch, H., & Römisch, W. (2003) · Computational Optimization and Applications · doi:10.1023/a:1021805924152 · Cited by 982
Self-citationGenerating Scenario Trees for Multistage Decision Problems
Høyland, K., & Wallace, S. W. (2001) · Management Science · doi:10.1287/mnsc.47.2.295.9834 · Cited by 673
Scenario reduction in stochastic programming: An approach using probability metrics
Dupačová, J., Gröwe‐Kuska, N., & Römisch, W. (2000) · doi:10.18452/2876 · Cited by 517
Ruszczyński, A., & Shapiro, A. (2003) · Handbooks in Operations Research and Management Science · doi:10.1016/s0927-0507(03)10001-1 · Cited by 452
Scenario tree generation for multiperiod financial optimization by optimal discretization
Pflug, G. C. (2001) · Mathematical Programming · doi:10.1007/pl00011398 · Cited by 337
Takriti, S., Krasenbrink, B., & Wu, L. S.-Y. (2000) · Operations Research · doi:10.1287/opre.48.2.268.12379 · Cited by 217
Probability Metrics and the Stability of Stochastic Models
Freeman, J. (1992) · Journal of the Operational Research Society · doi:10.1057/jors.1992.135 · Cited by 188
Bacaud, L., Lemaréchal, C., Renaud, A., & Sagastizábal, C. A. (2001) · Computational Optimization and Applications · doi:10.1023/a:1011202900805 · Cited by 81
Cited by
Decision Making Under Uncertainty in Electricity Markets
Conejo, A. J., Carrión, M., & Morales, J. M. (2010) · International Series in Operations Research & Management Science · doi:10.1007/978-1-4419-7421-1 · Cited by 1,231
Security-Constrained Unit Commitment With Volatile Wind Power Generation
Wang, J., Shahidehpour, M., & Li, Z. (2008) · IEEE Transactions on Power Systems · doi:10.1109/tpwrs.2008.926719 · Cited by 914
Stochastic 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
Decision making under uncertainty in electricity markets
Barroso, L. A., & Conejo, A. J. (2006) · 2006 IEEE Power Engineering Society General Meeting · doi:10.1109/pes.2006.1709323 · Cited by 622
Market-Clearing With Stochastic Security— Part I: Formulation
Bouffard, F., Galiana, F. D., & Conejo, A. J. (2005) · IEEE Transactions on Power Systems · doi:10.1109/tpwrs.2005.857016 · Cited by 432
Metadata
- Authors
- Growe-Kuska, N., Heitsch, H., & Romisch, W.
- Venue
- 2003 IEEE Bologna Power Tech Conference Proceedings,
- Publisher
- IEEE
- Published
- 2004-07-09
- Volume
- 3
- Pages
- 152-158
- OpenAlex
- W2110554198
- Cited by
- 804
- References
- 11
- FWCI
- 12.84
- Type
- conference paper
- 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.