2009 | OriginalPaper | Buchkapitel
Genetic Algorithms
verfasst von : Baoding Liu
Erschienen in: Theory and Practice of Uncertain Programming
Verlag: Springer Berlin Heidelberg
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
Genetic algorithm (GA) is a stochastic search method for optimization problems based on the mechanics of natural selection and natural genetics (i.e., survival of the fittest). GA has 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 GA is just able to obtain the global optimal solution fairly. In addition, GA does not require the specific mathematical analysis of optimization problems, which makes GA easily coded by users who are not necessarily good at mathematics and algorithms.