A Graph-theoretic Approach to Scenario Reduction for Stochastic Generation Expansion Problems
Files
Date
2025-01-07
Authors
Contributor
Advisor
Department
Instructor
Depositor
Speaker
Researcher
Consultant
Interviewer
Narrator
Transcriber
Annotator
Journal Title
Journal ISSN
Volume Title
Publisher
Volume
Number/Issue
Starting Page
3107
Ending Page
Alternative Title
Abstract
In operations research and optimization, stochastic programming plays a pivotal role in decision-making under uncertainty. However, solving complex stochastic programs, especially with many scenarios, is computationally challenging. This paper introduces a novel graph-based scenario reduction approach, using bipartite graph theory and community detection algorithms to create a smaller, representative set of scenarios. Unlike many traditional methods, this approach determines the optimal number of scenarios endogenously, improving computational efficiency and robustness. We applied this graph-based method to a two-stage stochastic programming model for power generation expansion planning (GEP), initially comprising 2000 scenarios. Our approach successfully reduced the scenario set while maintaining solution quality. We compare our method with four other techniques—K-means clustering, the Approximate Latent Factor Algorithm (ALFA), Backward Reduction, and Forward Selection. On the GEP problem, the graph-based method yields improved robustness as compared to other methods.
Description
Keywords
Policy, Markets, and Analytics, bipartite graphs, generation expansion planning, stochastic programming
Citation
Extent
10
Format
Geographic Location
Time Period
Related To
Proceedings of the 58th Hawaii International Conference on System Sciences
Related To (URI)
Table of Contents
Rights
Attribution-NonCommercial-NoDerivatives 4.0 International
Rights Holder
Local Contexts
Collections
Email libraryada-l@lists.hawaii.edu if you need this content in ADA-compliant format.