Сравнение методов
Просматривайте выбранные методы рядом; строки с различиями подсвечены.
| Матевристика: гибридизация математического программирования и метаэвристик× | Tabu Search× | |
|---|---|---|
| Область | Оптимизация | Оптимизация |
| Семейство | Process / pipeline | Process / pipeline |
| Год появления≠ | 2009 | 1989 |
| Автор метода≠ | Maniezzo, Stützle & Voß | Fred Glover |
| Тип≠ | Hybrid optimization framework | Local-search metaheuristic |
| Основополагающий источник≠ | Maniezzo, V., Stützle, T., & Voß, S. (Eds.). (2009). Matheuristics: Hybridizing Metaheuristics and Mathematical Programming. Springer. ISBN: 978-1-4419-1305-0 | Glover, F. (1989). Tabu Search — Part I. ORSA Journal on Computing, 1(3), 190–206. link ↗ |
| Другие названия≠ | Hybrid Metaheuristics, MIP-based Heuristics, Math-Programming Hybrids, Matematiksel Sezgisel Yöntemler | Tabu Araması (Tabu Search), TS, tabu metaheuristic |
| Связанные≠ | 3 | 4 |
| Сводка≠ | 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. | Tabu Search is a local-search metaheuristic introduced by Fred Glover in 1989 that uses a tabu list — a short-term memory of recently visited solutions — to prevent cycling and escape local optima. By explicitly forbidding moves that reverse recent decisions, the algorithm explores the search space more broadly and, through long-term memory structures such as aspiration criteria, aims to approach the global optimum even in large, complex combinatorial problems. |
| ScholarGateНабор данных ↗ |
|
|