Porównaj metody
Przeglądaj wybrane metody obok siebie; wiersze, które się różnią, są wyróżnione.
| Agent-Based Tabu Search× | Przeszukiwanie tabu× | |
|---|---|---|
| Dziedzina≠ | Symulacja | Optymalizacja |
| Rodzina | Process / pipeline | Process / pipeline |
| Rok powstania≠ | 1989–1995 | 1989 |
| Twórca≠ | Glover, F. (tabu search); multi-agent extension by various researchers in the 1990s–2000s | Fred Glover |
| Typ≠ | Hybrid metaheuristic — agent-based distributed tabu search | Local-search metaheuristic |
| Źródło pierwotne | Glover, F. (1989). Tabu search — Part I. ORSA Journal on Computing, 1(3), 190–206. DOI ↗ | Glover, F. (1989). Tabu Search — Part I. ORSA Journal on Computing, 1(3), 190–206. link ↗ |
| Inne nazwy≠ | ABTS, Multi-Agent Tabu Search, Distributed Tabu Search, Cooperative Tabu Search | Tabu Araması (Tabu Search), TS, tabu metaheuristic |
| Pokrewne | 4 | 4 |
| Podsumowanie≠ | Agent-Based Tabu Search (ABTS) embeds the tabu search metaheuristic inside a multi-agent framework where autonomous agents each run independent or cooperating tabu search threads, sharing promising solutions to escape local optima and collectively explore large combinatorial or continuous search spaces more effectively than a single-thread implementation. | 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. |
| ScholarGateZbiór danych ↗ |
|
|