SearcharxivSearch

arXiv · 1903.05065

Well control optimization using a two-step surrogate treatment

Abstract

Large numbers of flow simulations are typically required for determining optimal well settings. These simulations are often computationally demanding, which poses challenges for the optimizations. In this paper we present a new two-step surrogate treatment (ST) that reduces the computational expense associated with well control optimization. The method is applicable for oil production via waterflood, with well rates optimized at a single control period. The two-step ST entails two separate optimizations, which can both be performed very efficiently. In the first optimization, optimal well-rate ratios (i.e., the fraction of total injection or production associated with each well) are determined such that a measure of velocity variability over the field is minimized, leading to more uniform sweep. In the second step, overall injection and production rates are determined. The flow physics in the first step is highly simplified, while the actual physical system is simulated in the second step. Near-globally-optimal results can be determined in both cases, as the first optimization is posed as a QP problem, and the second step entails just a single optimization variable. Under full parallelization, the overall elapsed time for the ST corresponds to the runtime for 1-2 full-order simulations. Results are presented for multiple well configurations, for 2D and 3D channelized models, and comparisons with formal optimization procedures (MADS and adjoint-gradient) are conducted. Three different fluid mobility ratios (M = 1, 3 and 5) are considered. Optimization results demonstrate that the two-step ST provides results in reasonable agreement with those from MADS and adjoint-gradient, with speedups of 5x or more. We also show that the ST is applicable in the inner-loop in field development optimization, where it will be especially useful since many different well configurations must be evaluated.

Explore related subjects

Keep this discovery

BibTeXRIS

Daniel Ullmann de Brito, Louis J. Durlofsky. 2019-03-12. Well control optimization using a two-step surrogate treatment. https://arxiv.org/abs/1903.05065

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