Genetic algorithm (GA) uses a directed random search technique applied on global optimization of functions. In this paper we show the application of continuous GA to the inversion of reflected travel time curve. In this algorithm a number of sub-populations are generated to widely explore the search space. Then a new population is created in the neighborhood of best result extracted from these sub-populations. The genetic operators (selection, crossover and mutation) are applied on each population. We have also used an exponentially decreasing mutation probability for better exploration of the search space. This modified GA, when applied on noise free and noise corrupted synthetic data indicates a good convergence to the optimum results.


Article metrics loading...

Loading full text...

Full text loading...


  1. Chelouah, R. and Siarry, P.
    [2000] A continuous genetic algorithm designed for the global optimization of multimodal functions. J. Heuristics, 6.
    [Google Scholar]
  2. Bessaou, M. and Siarry, P.
    [2000] A genetic algorithm with real-value coding to optimize multimodal continuous functions. Structural and multidisciplinary optimization, 23, 2001, 63–74.
    [Google Scholar]
  3. Goldberg, D.E.
    [1989] Genetic algorithm in search, optimization and machine learning. Addison-Wesley.
    [Google Scholar]
  4. Taner, M.T. and Koehler, F.
    [1969] Velocity spectra digital computer derivation and application of velocity functions. Geophysics, 34, 859–881.
    [Google Scholar]
  5. Holland, J.H.
    [1962] Outline for logical theory of adaptive systems. J. ACM, 9(3), 297–314.
    [Google Scholar]
  6. [1975] Adaptation in natural and artificial systems. University of Michigan Press, Ann Arbor, MI, Internal Report.
    [Google Scholar]

Data & Media loading...

This is a required field
Please enter a valid email address
Approval was a Success
Invalid data
An Error Occurred
Approval was partially successful, following selected items could not be processed due to error