방법 비교
선택한 방법을 나란히 검토하세요. 서로 다른 행은 강조 표시됩니다.
| 결정론적 다목적 최적화× | 다목적 최적화× | |
|---|---|---|
| 분야 | 시뮬레이션 | 시뮬레이션 |
| 계열 | Process / pipeline | Process / pipeline |
| 기원 연도≠ | 1951–1999 | 1896 (concept); 1989–2002 (evolutionary algorithms era) |
| 창시자≠ | Kuhn, H. W., Tucker, A. W. (Pareto optimality formalized); Miettinen, K. (systematic deterministic framework) | Vilfredo Pareto (concept); modern computational formulation by Goldberg and Deb et al. |
| 유형≠ | Optimization framework — deterministic Pareto and scalarization methods | Optimization framework |
| 원전 | Deb, K. (2001). Multi-Objective Optimization Using Evolutionary Algorithms. Wiley, Chichester. ISBN: 978-0-471-87339-6 | Deb, K. (2001). Multi-Objective Optimization Using Evolutionary Algorithms. Wiley, Chichester. ISBN: 9780471873396 |
| 별칭 | Deterministic MOO, Classical Multi-Objective Optimization, Non-Stochastic MOO, Deterministic Pareto Optimization | MOO, Multi-Criteria Optimization, Vector Optimization, Pareto Optimization |
| 관련 | 3 | 3 |
| 요약≠ | Deterministic Multi-Objective Optimization (Deterministic MOO) is a family of classical optimization approaches that simultaneously minimize or maximize multiple conflicting objective functions over a deterministic feasible set. It produces a Pareto front — the set of non-dominated solutions — from which a decision-maker selects the preferred trade-off. Unlike stochastic variants, all objective evaluations and constraints are fixed and noise-free. | 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. |
| ScholarGate데이터셋 ↗ |
|
|