- Library Home /
- Search Collections /
- Open Collections /
- Browse Collections /
- BIRS Workshop Lecture Videos /
- Multistage Stochastic Capacity Planning Using JuDGE
Open Collections
BIRS Workshop Lecture Videos
BIRS Workshop Lecture Videos
Multistage Stochastic Capacity Planning Using JuDGE Philpott, Andy
Description
Julia Dynamic Generation Expansion (JuDGE) is a Julia package for solving stochastic capacity expansion problems formulated in a "coarse-grained" scenario tree that models long-term uncertainties. The user provides JuDGE with a coarse-grained tree and a JuMP formulation of a stage problem to be solved in each node of this tree. JuDGE then applies Dantzig-Wolfe decomposition to this framework based on the general model of Singh et al. (2009). The stage problems are themselves single-stage capacity expansion problems with integer capacity variables, but quite general constraints that can model, for example, operations in random environments, or even equilibrium constraints, as long as they can be solved exactly (e.g. via reformulation as mixed integer programs). This presentation outlines the theoretical background for JuDGE, and shows the results of applying it to several problem instances: i. a knapsack problem with expanding capacity; ii. optimal capacity expansion in an electricity distribution network subject to reliability constraints; iii. national capacity expansion to meet renewable energy targets; iv. optimal transmission expansion for an electricity wholesale market with imperfectly competitive agents. References Singh, K., Philpott, A.B. and Wood, K., Dantzig-Wolfe decomposition for solving multi-stage stochastic capacity planning problems, Operations Research, 57, 1271-1286, 2009.
Item Metadata
Title |
Multistage Stochastic Capacity Planning Using JuDGE
|
Creator | |
Publisher |
Banff International Research Station for Mathematical Innovation and Discovery
|
Date Issued |
2019-09-23T11:00
|
Description |
Julia Dynamic Generation Expansion (JuDGE) is a Julia package for solving stochastic capacity expansion problems formulated in a "coarse-grained" scenario tree that models long-term uncertainties. The user provides JuDGE with a coarse-grained tree and a JuMP formulation of a stage problem to be solved in each node of this tree. JuDGE then applies Dantzig-Wolfe decomposition to this framework based on the general model of Singh et al. (2009). The stage problems are themselves single-stage capacity expansion problems with integer capacity variables, but quite general constraints that can model, for example, operations in random environments, or even equilibrium constraints, as long as they can be solved exactly (e.g. via reformulation as mixed integer programs).
This presentation outlines the theoretical background for JuDGE, and shows the results of applying it to several problem instances:
i. a knapsack problem with expanding capacity;
ii. optimal capacity expansion in an electricity distribution network subject to reliability constraints;
iii. national capacity expansion to meet renewable energy targets;
iv. optimal transmission expansion for an electricity wholesale market with imperfectly competitive agents.
References
Singh, K., Philpott, A.B. and Wood, K., Dantzig-Wolfe decomposition for solving multi-stage stochastic capacity planning problems, Operations Research, 57, 1271-1286, 2009.
|
Extent |
46.0 minutes
|
Subject | |
Type | |
File Format |
video/mp4
|
Language |
eng
|
Notes |
Author affiliation: University of Auckland
|
Series | |
Date Available |
2021-01-16
|
Provider |
Vancouver : University of British Columbia Library
|
Rights |
Attribution-NonCommercial-NoDerivatives 4.0 International
|
DOI |
10.14288/1.0395617
|
URI | |
Affiliation | |
Peer Review Status |
Unreviewed
|
Scholarly Level |
Faculty
|
Rights URI | |
Aggregated Source Repository |
DSpace
|
Item Media
Item Citations and Data
Rights
Attribution-NonCommercial-NoDerivatives 4.0 International