Comparison of genetic algorithm with linear programming for the optimization of an underground gas-storage field

Date

1999-01-01

Author

Guyaguler, B
Gumrah, F

Metadata

Show full item record

This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.

Item Usage Stats

247
views

0
downloads

Linear Programming (LP) methods have previously been proposed for the optimization of underground storage fields. As the name implies, these methods necessitate many assumptions for the linearization of the constraints and the objective function, reducing accuracy of the results. A new approach for field optimization is developed that eliminates these assumptions. Genetic Algorithm (GA) is used as the optimization tool. A population consisting of individuals that encode a set of well rates for the field is created and evolved into new generations through a stochastic though structured algorithm that models some natural phenomena. The three-dimensional finite-difference model of the field is used as the GA's evaluation function. Individuals that return higher field cumulative production are given higher chance to reproduce. Individuals that cause a flowing well pressure lower than the minimum allowable are penalized. It is observed that the LP method gives significantly different results than those of the GA approach because of the assumptions it bears.

URI

https://hdl.handle.net/11511/64928

Journal

IN SITU

Collections

Department of Petroleum and Natural Gas Engineering, Article

Suggestions

OpenMETU
Core

Optimization of nonuniform array geometry for DOA estimation with the constraint on gross error probability Birinci, Toygar; Tanık, Yalçın (2007-10-01) In this work, a novel method is proposed to optimize the array geometry for DOA estimation. The method is based on minimization of fine error variances with the constraint that the gross error probability is below a certain threshold. For this purpose, a metric function that reflects the gross and fine error characteristics of the array is proposed. Theoretical analyses show that the minimization of this metric function leads to small DOA estimation error variance and small gross error probability. Analyses...
Optimization of non-uniform planar array geometry for direction of arrival estimation Birinci, Toygar; Tanık, Yalçın; Department of Electrical and Electronics Engineering (2006) In this work, a novel method is proposed to optimize the array geometry for DOA estimation. The method is based on minimization of fine error variances with the constraint that the gross error probability is below a certain threshold. For this purpose, a metric function that reflects the gross and fine error characteristics of the array is offered. Theoretical analyses show that the minimization of this metric function leads to small DOA estimation error variance and small gross error probability. Analyses ...
A 2-D unsteady Navier-Stokes solution method with overlapping/overset moving grids Tuncer, İsmail Hakkı (1996-01-01) A simple, robust numerical algorithm to localize intergrid boundary points and to interpolate unsteady solution variables across 2-D, overset/overlapping, structured computational grids is presented. Overset/ overlapping grids are allowed to move in time relative to each other. The intergrid boundary points are localized in terms of three grid points on the donor grid by a directional search algorithm. The final parameters of the search algorithm give the interpolation weights at the interpolation point. Th...
A 2-0 navier-stokes solution method with overset moving grids Tuncer, İsmail Hakkı (1996-01-01) A simple, robust numerical algorithm to localize moving boundary points and to interpolate uniteady solution variables across 2-D, arbitrarily overset computational grids is presented. Overset grids are allowed to move in time relative to each other. The intergrid boundary points are localized in terms of three grid points on the donor grid by a directional search algorithm. The parameters of the search algorithm give the interpolation weights at the localized boundary point. The method is independent of nu...
An integrated approach to computational vision - The edge strength function and the nested symmetries Tarı, Zehra Sibel (1999-01-01) A new development in local symmetry extraction and its connections to segmentation functionals and the fronts propagating with curvature-dependent speed are examined. The basic tool is a new distance function that attains its maximum value at the shape boundary and decays rapidly away from there. It is shown that the Hessian of the distance function captures perceptual information that can be extracted easily, efficiently, and robustly in the form of nested local shape symmetries at multiple scales. The mos...

Citation Formats

B. Guyaguler and F. Gumrah, “Comparison of genetic algorithm with linear programming for the optimization of an underground gas-storage field,” IN SITU, pp. 131–149, 1999, Accessed: 00, 2020. [Online]. Available: https://hdl.handle.net/11511/64928.