SearcharxivSearch

arXiv · 2111.02099

Large-scale hydropower models in StochasticPrograms.jl

Abstract

We present three large-scale hydropower planning models implemented in our open-source software framework StochasticPrograms.jl developed using the Julia programming langugage. The framework provides an expressive syntax for formulating stochastic programming models and has distributed capabilities that can handle large-scale instances. The three models describe different case studies of the hydroelectric power plants in the Swedish river Skellefte\"alven. The models are two-stage stochastic programs with sampled scenarios that describe uncertain electricity prices and local water inflows. The first model is a day-ahead planning problem that concerns how to determine optimal order strategies in a day-ahead energy market. We pose this problem from the perspective of a hydropower producer, who participates in the Nordic day-ahead market and operates in the Swedish river Skellefte\"alven. We implement the day-ahead model using our computational tools and then solve large-scale instances of the problem in a distributed environment. A statistically significant value of running stochastic planning is obtained using a sample-based algorithm. Next, we consider a variation of the day-ahead problem that includes preventive maintenance scheduling. We show how intricate coordination between the submitteed market orders and the maintenance schedule results in a larger value of the stochastic solution than the day-ahead problem. The final model is a capacity expansion problem with a long planning horizon. The same methodology is applied as when solving the first two hydropower problems. However, the planning horizon is considerably longer, from one year up to 20 years compared to a 24 hour horizon. We note that the relative significance of the value of the stochastic solution is much greater when comparing to the extra profits incurred from the capacity expansion instead of the total profit.

Explore related subjects

Keep this discovery

BibTeXRIS

Martin Biel. 2021-11-03. Large-scale hydropower models in StochasticPrograms.jl. https://arxiv.org/abs/2111.02099

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Deterministic and Random Bipartite Matching on General Networks: Convex Flow Reformulation, Asymptotic Properties, and Fast Algorithms

Minimum-distance bipartite matching on general networks has numerous applications various fields. This paper first focuses on deterministic problems and presents an exact edgewise-separable convex-flow reformulation. By introducing a smooth monotone rearrangement approximation of the edge-wise imbalance profiles, the convex-flow reformulation's can be solved efficiently. If we further conduct a first-order resistance-based approximation of the convex program, a one-step Laplacian-based estimator can be analytically derived in closed forms. The paper also studies random problems where supply and demand points are randomly distributed. We show that the expected optimal matching distance scales with the square root of the number of points if the supply/demand point distributions are identical, or linearly otherwise. In the former case, the optimal flow is proven to be centered, symmetric, and sub-Gaussian. In the latter case, the limiting resistance network characterizes how supply-demand imbalance is redistributed and motivates a fast algorithm that approximate the optimal flow based on the limiting resistance. Numerical experiments show that the proposed estimators closely approximate the exact matching cost while substantially reducing computation time. The proven theoretical properties of the random matching solution are numerically verified by large-scale Monte Carlo simulations.

math.OC

Conformal-DRO: Distributionally Robust Optimization with Conformalized Ambiguity Set

Data-driven distributionally robust optimization (DRO) typically treats the conditional outcome law as fixed and uses ambiguity sets to capture estimation error. This paper studies latent distributional heterogeneity, where each instance has an unobserved law but contributes only one observation, so uncertainty persists even if the mixture law is known. We propose Conformal-DRO, which uses nested conformal regions to construct an ambiguity set for the future latent law. Under exchangeability, the set covers this law with probability at least $1-\alpha$ in finite samples, without estimating underlying latent laws or their mixing mechanism. The conformal path induces a data-driven transport geometry, while $\alpha$ determines the radius. The worst-case problem reduces to a finite linear program over conformal shells and admits sparse adversarial solutions. The resulting robust value provides a finite-sample certificate for the selected decision's expected cost.

math.OC

The best approximation tuple: an extension of the Cheney-Goldstein algorithm and results to the multiple sets case

In this paper we extend the algorithm and several results published in the celebrated 1959 paper of Cheney and Goldstein about the best approximation pair (BAP) problem in two separate directions. One is the consideration of more than two sets. The other is the ability to handle each set as an intersections of a finite family of sets. We call the resulting problem the "Best Approximation Tuple (BAT) problem". The fundamental observation that leads to this generalizations is to recognize and handle one set (the "pivot set") as different from the remaining sets (the "satellite sets") instead of seeking cycles as the minimizers of a target functional. This enable us to overcome a certain theoretical obstacle related to cycles and minimizers of general functionals. We prove the convergence of the algorithm to the unique solution of the problem in the Euclidean case with strictly convex and compact satellite sets. Because of the lack of Fej\'er monotonicity, our convergence analysis is not standard, and is based on almost unknown properties of orthogonal projections regarding equality and inequality in the definition of nonexpansiveness.

math.OC