Porovnat metody
Prohlédněte si vybrané metody vedle sebe; řádky, které se liší, jsou zvýrazněny.
| Multi-Objective Simulated Annealing (MOSA)× | Vícecílový Genetický Algoritmus (MOGA)× | |
|---|---|---|
| Obor | Simulace | Simulace |
| Rodina | Process / pipeline | Process / pipeline |
| Rok vzniku≠ | 1992–1998 | 1984 |
| Tvůrce≠ | Serafini, P.; Czyzak, P. and Jaszkiewicz, A. | Schaffer, J. D. (early MOGA); Goldberg, D. E. (GA foundations) |
| Typ≠ | Metaheuristic / Pareto-based optimizer | Population-based evolutionary optimizer |
| Původní zdroj≠ | Czyzak, P., Jaszkiewicz, A. (1998). Pareto simulated annealing — a metaheuristic technique for multiple-objective combinatorial optimization. Journal of Multi-Criteria Decision Analysis, 7(1), 34–47. DOI ↗ | Goldberg, D. E. (1989). Genetic algorithms in search, optimization, and machine learning. Addison-Wesley. ISBN: 9780201157673 |
| Další názvy | MOSA, Multi-Criteria Simulated Annealing, Pareto Simulated Annealing, PSA | MOGA, Multi-objective GA, Evolutionary multi-objective optimization, EMO |
| Příbuzné≠ | 5 | 4 |
| Shrnutí≠ | Multi-Objective Simulated Annealing (MOSA) extends the classical simulated annealing metaheuristic to problems with two or more conflicting objective functions. Instead of converging to a single optimum, MOSA explores the solution space stochastically and maintains an archive of non-dominated (Pareto-optimal) solutions, offering decision-makers a diverse trade-off front rather than one prescribed answer. | 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. |
| ScholarGateDatová sada ↗ |
|
|