Binary Coded Genetic Algorithm (BCGA) with Multi-Point Cross-Over for Magnetotelluric (MT) 1D Data Inversion

1Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

The magnetotelluric (MT) 1D modelling has been continuously receiving interest due to its effectiveness in obtaining overall subsurface resistivity image of an investigated area. The advances in computational resources allow increasing implementations of non-linear inversion using global search approach, such as Genetic Algorithm (GA). The genetic algorithm adopts the process of natural selection (survival for the fittest) and genetic transformation, i.e. selection, reproduction, mutation and population change, to solve the optimization problem. This paper discusses GA application in MT 1D modelling using binary coding representation with multi-point cross-over, i.e. one for every model parameter. The model parameters are resistivity and thickness of homogenously horizontal layers. The algorithm parameters need to be set to work properly, i.e. population size, number of genes, number of bits, crossover probability, mutation probability and number of generations. Despite binary coded GA (BCGA) drawbacks discussed in the literatures, we found that binary representation allows relatively extensive exploration of the search space. Test using synthetic data from three-layered synthetic models lead to satisfactory results, in terms of synthetic model recovery and data misfit comparable with the noise level contained the synthetic data.

Cite

CITATION STYLE

APA

Wijanarko, E., & Grandis, H. (2019). Binary Coded Genetic Algorithm (BCGA) with Multi-Point Cross-Over for Magnetotelluric (MT) 1D Data Inversion. In IOP Conference Series: Earth and Environmental Science (Vol. 318). Institute of Physics Publishing. https://doi.org/10.1088/1755-1315/318/1/012029

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free