Genetic Algorithms: Two Different Elitism Operators for Stochastic and Deterministic Applications

  • Authors:
  • Juan Seijas;Carmen Morató;José L. Sanz-González

  • Affiliations:
  • -;-;-

  • Venue:
  • PPAM '01 Proceedings of the th International Conference on Parallel Processing and Applied Mathematics-Revised Papers
  • Year:
  • 2001

Quantified Score

Hi-index 0.00

Visualization

Abstract

We present a Genetic Algorithm (GA) capable of optimizing two different applications. Everything (except elitism operator) is the same in both applications, including the values of GA parameters. Whereas the two applications are very different: One of them presents a deterministic behavior during the GA iterations, and the other one presents a stochastic behavior. For this different nature of the applications, a new approach to elitism operator is presented. It provides a more efficient and robust solution. For each application, the efficiency of the optimization process performed by GA is demonstrated by comparison of the results with another classical methods' output. At the same time, our GA presents some characteristics as robustness, convergence to solution, extraordinary capability of generalization and an easiness of being coded for parallel processing architectures, that make our GA very suitable for multiple optimization processes, independently if they are of a deterministic nature or a stochastic one.