방법 비교
선택한 방법을 나란히 검토하세요. 서로 다른 행은 강조 표시됩니다.
| 다목적 시뮬레이티드 어닐링 (MOSA)× | 모의 담금질× | |
|---|---|---|
| 분야≠ | 시뮬레이션 | 최적화 |
| 계열 | Process / pipeline | Process / pipeline |
| 기원 연도≠ | 1992–1998 | 1983 |
| 창시자≠ | Serafini, P.; Czyzak, P. and Jaszkiewicz, A. | — |
| 유형≠ | Metaheuristic / Pareto-based optimizer | Probabilistic metaheuristic / local search |
| 원전≠ | 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 ↗ | Kirkpatrick, S., Gelatt, C.D. & Vecchi, M.P. (1983). Optimization by Simulated Annealing. Science, 220(4598), 671-680. DOI ↗ |
| 별칭≠ | MOSA, Multi-Criteria Simulated Annealing, Pareto Simulated Annealing, PSA | Benzetimli Tavlama (Simulated Annealing), SA, probabilistic local search |
| 관련 | 5 | 5 |
| 요약≠ | 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. | Simulated annealing is a probabilistic local-search metaheuristic introduced by Kirkpatrick, Gelatt, and Vecchi in 1983. It models the physical annealing process in metallurgy — where a material is heated and then slowly cooled to reach a low-energy crystalline state — and uses this analogy to escape local optima in combinatorial and continuous optimization problems. |
| ScholarGate데이터셋 ↗ |
|
|