방법 비교
선택한 방법을 나란히 검토하세요. 서로 다른 행은 강조 표시됩니다.
| 수학적 휴리스틱: 수학적 계획법과 메타휴리스틱의 결합× | 하이퍼휴리스틱× | |
|---|---|---|
| 분야 | 최적화 | 최적화 |
| 계열 | Process / pipeline | Process / pipeline |
| 기원 연도≠ | 2009 | 2013 |
| 창시자≠ | Maniezzo, Stützle & Voß | Burke et al. |
| 유형≠ | Hybrid optimization framework | High-level search methodology |
| 원전≠ | Maniezzo, V., Stützle, T., & Voß, S. (Eds.). (2009). Matheuristics: Hybridizing Metaheuristics and Mathematical Programming. Springer. ISBN: 978-1-4419-1305-0 | Burke, E. K., et al. (2013). Hyper-heuristics: A survey of the state of the art. Journal of the Operational Research Society, 64(12), 1695–1724. DOI ↗ |
| 별칭 | Hybrid Metaheuristics, MIP-based Heuristics, Math-Programming Hybrids, Matematiksel Sezgisel Yöntemler | Heuristic of Heuristics, Algorithm Selection Hyper-Heuristic, Selection Hyper-Heuristic, Hiyer-Sezgisel |
| 관련 | 3 | 3 |
| 요약≠ | Matheuristics is a class of hybrid optimization methods that tightly couple exact mathematical programming components—such as mixed-integer programming (MIP) solvers—with metaheuristic search procedures. Formally introduced and named by Maniezzo, Stützle, and Voß in 2009, the framework leverages the global-search capability of metaheuristics and the structural exploitation of mathematical programming to tackle large-scale combinatorial optimization problems that neither approach can solve effectively alone. | Hyper-heuristics are high-level methodologies that search over a space of heuristics rather than directly over the space of solutions. Introduced systematically by Burke et al. (2013) in their landmark survey, hyper-heuristics operate by selecting or generating low-level heuristics to solve hard combinatorial optimisation and search problems, aiming to automate the design of optimisation algorithms across diverse problem domains without requiring deep problem-specific knowledge. |
| ScholarGate데이터셋 ↗ |
|
|