Genetic Algorithms

  • Baoding Liu
Part of the Studies in Fuzziness and Soft Computing book series (STUDFUZZ, volume 102)


Genetic algorithms (GAs) are a stochastic search method for optimization problems based on the mechanics of natural selection and natural genetics (i.e., survival of the fittest). GAs have demonstrated considerable success in providing good solutions to many complex optimization problems and received more and more attentions during the past three decades. When the objective functions to be optimized in the optimization problems are multimodal or the search spaces are particularly irregular, algorithms need to be highly robust in order to avoid getting stuck at a local optimal solution. The advantage of GAs is just able to obtain the global optimal solution fairly. In addition, GAs do not require the specific mathematical analysis of optimization problems, which makes GAs themselves easily coded by users who are not necessarily good at mathematics and algorithms.


Genetic Algorithm Nash Equilibrium Genetic Operator Soft Constraint Roulette Wheel 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2002

Authors and Affiliations

  • Baoding Liu
    • 1
  1. 1.Uncertain Systems Laboratory, Department of Mathematical SciencesTsinghua UniversityBeijingChina

Personalised recommendations