Improving the Ensemble-Optimization Method Through Covariance-Matrix Adaptation

SPE Journal ◽  
2014 ◽  
Vol 20 (01) ◽  
pp. 155-168 ◽  
Author(s):  
R.M.. M. Fonseca ◽  
O.. Leeuwenburgh ◽  
P.M.J.. M.J. Van den Hof ◽  
J.D.. D. Jansen

Summary Ensemble optimization (referred to throughout the remainder of the paper as EnOpt) is a rapidly emerging method for reservoir-model-based production optimization. EnOpt uses an ensemble of controls to approximate the gradient of the objective function with respect to the controls. Current implementations of EnOpt use a Gaussian ensemble of control perturbations with a constant covariance matrix, and thus a constant perturbation size, during the entire optimization process. The covariance-matrix-adaptation evolutionary strategy is a gradient-free optimization method developed in the “machine learning” community, which also uses an ensemble of controls, but with a covariance matrix that is continually updated during the optimization process. It was shown to be an efficient method for several difficult but small-dimensional optimization problems and was recently applied in the petroleum industry for well location and production optimization. In this study, we investigate the scope to improve the computational efficiency of EnOpt through the use of covariance-matrix adaptation (referred to throughout the remainder of the paper as CMA-EnOpt). The resulting method is applied to the waterflooding optimization of a small multilayer test model and a modified version of the Brugge benchmark model. The controls used are inflow-control-valve settings at predefined time intervals for injectors and producers with undiscounted net present value as the objective function. We compare EnOpt and CMA-EnOpt starting from identical covariance matrices. For the small model, we achieve only slightly higher (0.7 to 1.8%) objective-function values and modest speedups with CMA-EnOpt compared with EnOpt. Significantly higher objective-function values (10%) are obtained for the modified Brugge model. The possibility to adapt the covariance matrix, and thus the perturbation size, during the optimization allows for the use of relatively large perturbations initially, for fast exploration of the control space, and small perturbations later, for more-precise gradients near the optimum. Moreover, the results demonstrate that a major benefit of CMA-EnOpt is its robustness with respect to the initial choice of the covariance matrix. A poor choice of the initial matrix can be detrimental to EnOpt, whereas the CMA-EnOpt performance is near-independent of the initial choice and produces higher objective-function values at no additional computational cost.

2007 ◽  
Vol 37 (11) ◽  
pp. 2188-2200 ◽  
Author(s):  
Tero Heinonen ◽  
Timo Pukkala

This study presents an optimization method based on cellular automaton (CA) for solving spatial forest planning problems. The CA maximizes stand-level and neighbourhood objectives locally, i.e., separately for different stands or raster cells. Global objectives are dealt with by adding a global part to the objective function and gradually increasing its weight until the global targets are met to a required degree. The method was tested in an area that consisted of 2500 (50 × 50) hexagons 1 ha in size. The CA was used with both parallel and sequential state-updating rules. The method was compared with linear programming (LP) in four nonspatial forest planning problems where net present value (NPV) was maximized subject to harvest constraints. The CA solutions were within 99.6% of the LP solutions in three problems and 97.9% in the fourth problem. The CA was compared with simulated annealing (SA) in three spatial problems where a multiobjective utility function was maximized subject to periodical harvest and ending volume constraints. The nonspatial goal was the NPV and the spatial goals were old forest and cutting area aggregation as well as dispersion of regeneration cuttings. The CA produced higher objective function values than SA in all problems. Especially, the spatial objective variables were better in the CA solutions, whereas differences in NPV were small. There were no major differences in the performance of the parallel and sequential cell state-updating modes of the CA.


2019 ◽  
Vol 2019 ◽  
pp. 1-8 ◽  
Author(s):  
Zhenkai Zhang ◽  
Xinxing Liu ◽  
Bing Zhang ◽  
Hailin Li

In this paper, pattern synthesis through time-modulated linear array is studied, and a novel strategy for harmonic beamforming in time-modulated array is proposed. The peak side lobe level is designed as optimization objective function, and the switch-on time sequence of each element is selected as optimization variable. An improved invasive weed optimization (IWO) algorithm is developed in order to determine the optimal parameters describing the pulse sequence used to modulate the excitation weights of array elements. Representative results are reported and discussed to point out potentialities and advantages of the proposed approach, which can obtain lower objective function values.


SPE Journal ◽  
2016 ◽  
Vol 21 (02) ◽  
pp. 501-521 ◽  
Author(s):  
Fahim Forouzanfar ◽  
Walter E. Poquioma ◽  
Albert C. Reynolds

Summary In this paper, we present both simultaneous and sequential algorithms for the joint optimization of well trajectories and their life-cycle controls. The trajectory of a well is parameterized in terms of six variables that define a straight line in three dimensions. In the simultaneous joint optimization algorithm, the set of controls of a well throughout the life cycle of the reservoir is constructed as a linear combination of the left singular vectors that correspond to the largest singular values of a specified temporal covariance matrix. This covariance matrix is used to impose a temporal correlation on the controls at each well. In this approach, well controls are parameterized in terms of a few optimization parameters to reduce the dimension of the joint optimization problem. Moreover, the imposed smoothness on the well controls will result in temporally smooth well controls. We use an implementation of the covariance matrix adaptation–evolution strategy (CMA-ES) optimization algorithm to solve the defined optimization problem. In the sequential optimization algorithm, first, the trajectories of the wells are optimized with the CMA-ES optimization algorithm whereas the controls of the wells are prespecified. After the optimum trajectories of the wells are obtained, the life-cycle production optimization step is performed to find the optimal well controls for the specified well trajectories. For the production optimization step, we compare the performance of three optimization algorithms that are the standard ensemble-based optimization algorithm (EnOpt), the standard CMA-ES algorithm, and a variant of the CMA-ES algorithm in which we set the initial covariance matrix equal to a prespecified covariance that imposes a temporal correlation on the controls of each well. The performance of the proposed algorithms is tested for the joint optimization of well trajectories and controls of injectors and producers for the PUNQ reservoir model. The proposed simultaneous well placement/well control optimization algorithm obtained better results than did the sequential optimization framework. The CMA-ES algorithm performed well for both well placement and production optimization purposes. Moreover, the CMA algorithm with a prespecified covariance that imposes a temporal correlation on the well controls obtained a higher net present value compared with EnOpt for the life-cycle production optimization step of the sequential framework.


2011 ◽  
Vol 291-294 ◽  
pp. 1589-1592
Author(s):  
Li Ren ◽  
Rui Yang ◽  
Wen Xiao Zhang

A new topology optimization model with holes’ geometric constraints for continuum structure is presented. It is solved by an evolutionary optimization method based on interval relaxation, in which the problem is divided into two subproblems of topology optimization process and size/shape optimization process. The optimal topology of structure can be found gradually by introducing interval relaxation factor to adjust holes’ size constraints, delete noneffective holes and by generating new holes based on the sensitivity analysis of objective function. Interior penalty-function method is employed as an optimization technique for the size/shape optimization of the structure corresponding to the topology. When the holes’ size bounds are the actual values, the optimal solution is the smallest objective function structure in the various topologies. Thus realizes the holes’ geometric size and location design, topology design and layout design together. The optimization results of example shows the method proposed is of good effectiveness and engineering applicability.


Electronics ◽  
2021 ◽  
Vol 10 (12) ◽  
pp. 1452
Author(s):  
Cristian Mateo Castiblanco-Pérez ◽  
David Esteban Toro-Rodríguez ◽  
Oscar Danilo Montoya ◽  
Diego Armando Giral-Ramírez

In this paper, we propose a new discrete-continuous codification of the Chu–Beasley genetic algorithm to address the optimal placement and sizing problem of the distribution static compensators (D-STATCOM) in electrical distribution grids. The discrete part of the codification determines the nodes where D-STATCOM will be installed. The continuous part of the codification regulates their sizes. The objective function considered in this study is the minimization of the annual operative costs regarding energy losses and installation investments in D-STATCOM. This objective function is subject to the classical power balance constraints and devices’ capabilities. The proposed discrete-continuous version of the genetic algorithm solves the mixed-integer non-linear programming model that the classical power balance generates. Numerical validations in the 33 test feeder with radial and meshed configurations show that the proposed approach effectively minimizes the annual operating costs of the grid. In addition, the GAMS software compares the results of the proposed optimization method, which allows demonstrating its efficiency and robustness.


Coatings ◽  
2021 ◽  
Vol 11 (7) ◽  
pp. 774
Author(s):  
Haitao Luo ◽  
Rong Chen ◽  
Siwei Guo ◽  
Jia Fu

At present, hard coating structures are widely studied as a new passive damping method. Generally, the hard coating material is completely covered on the surface of the thin-walled structure, but the local coverage cannot only achieve better vibration reduction effect, but also save the material and processing costs. In this paper, a topology optimization method for hard coated composite plates is proposed to maximize the modal loss factors. The finite element dynamic model of hard coating composite plate is established. The topology optimization model is established with the energy ratio of hard coating layer to base layer as the objective function and the amount of damping material as the constraint condition. The sensitivity expression of the objective function to the design variables is derived, and the iteration of the design variables is realized by the Method of Moving Asymptote (MMA). Several numerical examples are provided to demonstrate that this method can obtain the optimal layout of damping materials for hard coating composite plates. The results show that the damping materials are mainly distributed in the area where the stored modal strain energy is large, which is consistent with the traditional design method. Finally, based on the numerical results, the experimental study of local hard coating composites plate is carried out. The results show that the topology optimization method can significantly reduce the frequency response amplitude while reducing the amount of damping materials, which shows the feasibility and effectiveness of the method.


Author(s):  
Patrick Nwafor ◽  
Kelani Bello

A Well placement is a well-known technique in the oil and gas industry for production optimization and are generally classified into local and global methods. The use of simulation software often deployed under the direct optimization technique called global method. The production optimization of L-X field which is at primary recovery stage having five producing wells was the focus of this work. The attempt was to optimize L-X field using a well placement technique.The local methods are generally very efficient and require only a few forward simulations but can get stuck in a local optimal solution. The global methods avoid this problem but require many forward simulations. With the availability of simulator software, such problem can be reduced thus using the direct optimization method. After optimization an increase in recovery factor of over 20% was achieved. The results provided an improvement when compared with other existing methods from the literatures.


Sign in / Sign up

Export Citation Format

Share Document