Comparar métodos
Examine os métodos selecionados lado a lado; as linhas que diferem ficam destacadas.
| Otimização Multiobjetivo× | Algoritmo Genético× | |
|---|---|---|
| Área≠ | Simulação | Otimização |
| Família | Process / pipeline | Process / pipeline |
| Ano de origem≠ | 1896 (concept); 1989–2002 (evolutionary algorithms era) | 1975 |
| Autor original≠ | Vilfredo Pareto (concept); modern computational formulation by Goldberg and Deb et al. | John Henry Holland |
| Tipo≠ | Optimization framework | Population-based metaheuristic |
| Fonte seminal≠ | Deb, K. (2001). Multi-Objective Optimization Using Evolutionary Algorithms. Wiley, Chichester. ISBN: 9780471873396 | Holland, J.H. (1975). Adaptation in Natural and Artificial Systems. University of Michigan Press. link ↗ |
| Outros nomes≠ | MOO, Multi-Criteria Optimization, Vector Optimization, Pareto Optimization | GA, evolutionary algorithm, Genetik Algoritma — Evrimsel Optimizasyon |
| Relacionados≠ | 3 | 5 |
| Resumo≠ | Multi-Objective Optimization (MOO) is a mathematical and computational framework for finding solutions that simultaneously optimize two or more conflicting objective functions. Rather than collapsing all goals into a single scalar, MOO produces a set of trade-off solutions — the Pareto front — from which a decision-maker selects according to preference. It is widely used in engineering design, operations research, logistics, economics, and policy analysis. | A genetic algorithm (GA) is a population-based metaheuristic optimization method introduced by John Henry Holland (1975) that mimics the principles of natural selection. It maintains a population of candidate solutions and iteratively improves them through selection, crossover, and mutation operators, making it especially powerful on discontinuous, non-convex, and multi-modal search spaces where classical gradient-based methods fail. |
| ScholarGateConjunto de dados ↗ |
|
|