2016
DOI: 10.13053/rcs-116-1-4
|View full text |Cite
|
Sign up to set email alerts
|

Aprendizaje incremental basado en población como buena alternativa al uso de algoritmos genéticos

Abstract: Resumen. En la actualidad han surgido nuevos modelos computacionales que intentan superar a los modelos clásicos de optimización, este es el caso de la Computación Evolutiva, la cual se ha popularizado por los Algoritmos Genéticos y sus diferentes variantes que prometen ser mejores. En este artículo analizaremos las bondades y/o deficiencias del Algoritmo Genético básico y del algoritmo de Aprendizaje Incremental Basado en Población, el cual es un algoritmo de estimación de distribuciones que forma parte del p… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1

Citation Types

0
3
0

Year Published

2018
2018
2024
2024

Publication Types

Select...
3

Relationship

0
3

Authors

Journals

citations
Cited by 3 publications
(3 citation statements)
references
References 14 publications
(17 reference statements)
0
3
0
Order By: Relevance
“…The metaheuristics are not the solution to everything and many times are often less efficient tan specific heuristics, in several orders of magnitude, in problems that accept this type of pure heuristics; however, the advantage of metaheuristics is exploited, when are applied in problems that do not have a specific algorithm or heuristic to obtain a satisfactory solution, or when it is not feasible to implement an optimal method. Metaheuristics are widely recognized as one of the best approaches to tackle combinatorial optimization problems [14], so they have become popular in the last couple of decades for its characteristics of simplicity, flexibility, by having free bypass mechanism and that can avoid falling into local optima.…”
Section: Metaheuristicsmentioning
confidence: 99%
“…The metaheuristics are not the solution to everything and many times are often less efficient tan specific heuristics, in several orders of magnitude, in problems that accept this type of pure heuristics; however, the advantage of metaheuristics is exploited, when are applied in problems that do not have a specific algorithm or heuristic to obtain a satisfactory solution, or when it is not feasible to implement an optimal method. Metaheuristics are widely recognized as one of the best approaches to tackle combinatorial optimization problems [14], so they have become popular in the last couple of decades for its characteristics of simplicity, flexibility, by having free bypass mechanism and that can avoid falling into local optima.…”
Section: Metaheuristicsmentioning
confidence: 99%
“…Self-tuning PID controller is required, because of the variation when changing different vehicles, is here where de adaptability and evolution in a GA allows getting a tuning method for any car [20].…”
Section: Introductionmentioning
confidence: 99%
“…The selection of a GA as tuning method it is the advantage that represents at the moment to find results in an optimization problem, where the solution presents a nonlinear behavior and in a multi-objective solution, gives a robustness method [20].…”
Section: Introductionmentioning
confidence: 99%