Search arXivSearch

arXiv · 0912.4798

Demand-Supply Optimization with Risk Management for a Multi-Connection Water Reservoir Network

Abstract

In this paper, we propose a framework to solve a demand-supply optimization problem of long-term water resource allocation on a multi-connection reservoir network which, in two aspects, is different to the problem considered in previous works. First, while all previous works consider a problem where each reservoir can transfer water to only one fixed reservoir, we consider a multi-connection network being constructed in Thailand in which each reservoir can transfer water to many reservoirs in one period of time. Second, a demand-supply plan considered here is static, in contrast to a dynamic policy considered in previous works. Moreover, in order to efficiently develop a long-term static plan, a severe loss (a risk) is taken into account, i.e. a risk occurs if the real amount of water stored in each reservoir in each time period is less than what planned by the optimizer. The multi-connection function and the risk make the problem rather complex such that traditional stochastic dynamic programming and deterministic/heuristic approaches are inappropriate. Our framework is based on a novel convex programming formulation in which stochastic information can be naturally taken into account and an optimal solution is guaranteed to be found efficiently. Extensive experimental results show promising results of the framework.

Explore related subjects

Keep this discovery

BibTeXRIS

Ratthachat Chatpatanasiri, Thavivongse Sriburi. 2009-12-24. Demand-Supply Optimization with Risk Management for a Multi-Connection Water Reservoir Network. https://arxiv.org/abs/0912.4798

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

KEEP EXPLORING

Related papers

Quasi-Monte Carlo Beyond Hardy-Krause II: $(1 + \varepsilon)n$ Samples Suffice

Numerical integration studies how well one can estimate the integral of a function $f$ over $[0,1)^d$ using $n$ sample points. The two classical methods, Monte Carlo (MC) and quasi-Monte Carlo (QMC), have complementary strengths and weaknesses, and a fundamental question is to design an approach that combines the benefits of both. Recently, building on the transference principle in discrepancy theory, Bansal and Jiang~\cite{BJ25a} gave a randomized QMC method that bridges MC and QMC guarantees using only i.i.d.\ samples. Their method also goes beyond the classical Koksma--Hlawka inequality: it achieves integration error $\widetilde{O}_d(\sigma_{\mathsf{SO}}(f)/n)$, where the smoothed-out variation $\sigma_{\mathsf{SO}}(f)$ can be substantially smaller than the Hardy--Krause variation that governs the classical bound. However, their algorithm requires $n^2$ i.i.d.\ samples as input, and this quadratic blowup is inherent to any method based on the transference principle. In this work, we bypass the quadratic blowup: for any constant $\varepsilon > 0$, we show that $(1+\varepsilon)n$ i.i.d.\ samples suffice to both obtain the beyond-Hardy--Krause guarantee of~\cite{BJ25a}, resolving an open problem posed there, and to produce low-discrepancy point sequences. Our algorithms are variants of the online Haar-thinning method of Dwivedi, Feldheim, Gurel-Gurevich, and Ramdas~\cite{DFG+19}.

cs.DS

Single-Exponential Algorithms and a Polynomial Kernel for Strong Connectivity Augmentation

Strong Connectivity Augmentation (SCA) asks whether a directed acyclic graph can be made strongly connected by adding at most $k$ prescribed links whose total weight is within a given budget. Klinkby, Misra, and Saurabh (SODA 2021) gave an $O^*(2^{O(k\log k)})$-time algorithm and asked whether the problem admits a single-exponential parameterized algorithm and a polynomial kernel. We answer both questions affirmatively: SCA can be solved in $O^*(9^k)$ time and admits a polynomial kernel with $O(k^4)$ vertices and $O(k^{16})$ bits. For unweighted SCA, we obtain $O^*(4^k)$ time and a kernel with $O(k^3)$ vertices. Our algorithms are based on a particularly simple reduction to Strongly Connected Spanning Subgraph with two edge costs.

cs.DS