방법 비교
선택한 방법을 나란히 검토하세요. 서로 다른 행은 강조 표시됩니다.
| 불확실성 하에서도 좋은 성능을 유지하는 해 찾기: 강건 모의 담금질× | 모의 담금질× | |
|---|---|---|
| 분야≠ | 시뮬레이션 | 최적화 |
| 계열 | Process / pipeline | Process / pipeline |
| 기원 연도≠ | 1983 (SA); robust variant emerged 1990s–2000s | 1983 |
| 창시자≠ | Kirkpatrick, Gelatt & Vecchi (SA basis); robust formulation developed across the operations research community | — |
| 유형≠ | Metaheuristic with robustness evaluation | Probabilistic metaheuristic / local search |
| 원전≠ | Kirkpatrick, S., Gelatt, C. D., Vecchi, M. P. (1983). Optimization by simulated annealing. Science, 220(4598), 671-680. DOI ↗ | Kirkpatrick, S., Gelatt, C.D. & Vecchi, M.P. (1983). Optimization by Simulated Annealing. Science, 220(4598), 671-680. DOI ↗ |
| 별칭≠ | RSA, Robust SA, Uncertainty-robust simulated annealing, Worst-case simulated annealing | Benzetimli Tavlama (Simulated Annealing), SA, probabilistic local search |
| 관련 | 5 | 5 |
| 요약≠ | Robust Simulated Annealing (RSA) adapts the classical simulated annealing metaheuristic to seek solutions that perform well not just under nominal conditions but across the full range of uncertain or adversarial parameter values. By embedding a robustness evaluation — worst-case, expected-case, or regret-based — into the SA acceptance step, RSA trades some nominal optimality for resilience, making it valuable when problem parameters are imprecisely known or subject to environmental variation. | 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데이터셋 ↗ |
|
|