Multicomponent Seismic Waveform Inversion Using a Nondominated Sorting Genetic Algorithm for VTI Media Parameters

Author(s):  
A. Padhi ◽  
S. Mallick
2021 ◽  
pp. 1-97
Author(s):  
Lingxiao Jia ◽  
Subhashis Mallick ◽  
Cheng Wang

The choice of an initial model for seismic waveform inversion is important. In matured exploration areas with adequate well control, we can generate a suitable initial model using well information. However, in new areas where well control is sparse or unavailable, such an initial model is compromised and/or biased by the regions with more well controls. Even in matured exploration areas, if we use time-lapse seismic data to predict dynamic reservoir properties, an initial model, that we obtain from the existing preproduction wells could be incorrect. In this work, we outline a new methodology and workflow for a nonlinear prestack isotropic elastic waveform inversion. We call this method a data driven inversion, meaning that we derive the initial model entirely from the seismic data without using any well information. By assuming a locally horizonal stratification for every common midpoint and starting from the interval P-wave velocity, estimated entirely from seismic data, our method generates pseudo wells by running a two-pass one-dimensional isotropic elastic prestack waveform inversion that uses the reflectivity method for forward modeling and genetic algorithm for optimization. We then use the estimated pseudo wells to build the initial model for seismic inversion. By applying this methodology to real seismic data from two different geological settings, we demonstrate the usefulness of our method. We believe that our new method is potentially applicable for subsurface characterization in areas where well information is sparse or unavailable. Additional research is however necessary to improve the compute-efficiency of the methodology.


Complexity ◽  
2018 ◽  
Vol 2018 ◽  
pp. 1-16 ◽  
Author(s):  
Jing Xiao ◽  
Jing-Jing Li ◽  
Xi-Xi Hong ◽  
Min-Mei Huang ◽  
Xiao-Min Hu ◽  
...  

As it is becoming extremely competitive in software industry, large software companies have to select their project portfolio to gain maximum return with limited resources under many constraints. Project portfolio optimization using multiobjective evolutionary algorithms is promising because they can provide solutions on the Pareto-optimal front that are difficult to be obtained by manual approaches. In this paper, we propose an improved MOEA/D (multiobjective evolutionary algorithm based on decomposition) based on reference distance (MOEA/D_RD) to solve the software project portfolio optimization problems with optimizing 2, 3, and 4 objectives. MOEA/D_RD replaces solutions based on reference distance during evolution process. Experimental comparison and analysis are performed among MOEA/D_RD and several state-of-the-art multiobjective evolutionary algorithms, that is, MOEA/D, nondominated sorting genetic algorithm II (NSGA2), and nondominated sorting genetic algorithm III (NSGA3). The results show that MOEA/D_RD and NSGA2 can solve the software project portfolio optimization problem more effectively. For 4-objective optimization problem, MOEA/D_RD is the most efficient algorithm compared with MOEA/D, NSGA2, and NSGA3 in terms of coverage, distribution, and stability of solutions.


Sign in / Sign up

Export Citation Format

Share Document