Salīdzināt metodes
Apskatiet izvēlētās metodes blakus; rindas, kas atšķiras, ir izceltas.
| Daudzobjektīvu ģenētisks algoritms (MOGA)× | Daudzobjektīvu optimizācija× | |
|---|---|---|
| Nozare | Simulācija | Simulācija |
| Saime | Process / pipeline | Process / pipeline |
| Izcelsmes gads≠ | 1984 | 1896 (concept); 1989–2002 (evolutionary algorithms era) |
| Autors≠ | Schaffer, J. D. (early MOGA); Goldberg, D. E. (GA foundations) | Vilfredo Pareto (concept); modern computational formulation by Goldberg and Deb et al. |
| Tips≠ | Population-based evolutionary optimizer | Optimization framework |
| Pirmavots≠ | Goldberg, D. E. (1989). Genetic algorithms in search, optimization, and machine learning. Addison-Wesley. ISBN: 9780201157673 | Deb, K. (2001). Multi-Objective Optimization Using Evolutionary Algorithms. Wiley, Chichester. ISBN: 9780471873396 |
| Citi nosaukumi | MOGA, Multi-objective GA, Evolutionary multi-objective optimization, EMO | MOO, Multi-Criteria Optimization, Vector Optimization, Pareto Optimization |
| Saistītās≠ | 4 | 3 |
| Kopsavilkums≠ | A Multi-Objective Genetic Algorithm (MOGA) is an evolutionary computation method that evolves a population of candidate solutions toward a Pareto-optimal front, simultaneously optimizing two or more conflicting objective functions. It avoids collapsing trade-offs into a single score, instead producing a set of non-dominated solutions for the decision-maker to choose among. | 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. |
| ScholarGateDatu kopa ↗ |
|
|