Porównaj metody
Przeglądaj wybrane metody obok siebie; wiersze, które się różnią, są wyróżnione.
| Agent-Based Tabu Search× | Multi-objective Tabu Search (MOTS)× | |
|---|---|---|
| Dziedzina | Symulacja | Symulacja |
| Rodzina | Process / pipeline | Process / pipeline |
| Rok powstania≠ | 1989–1995 | 1997 |
| Twórca≠ | Glover, F. (tabu search); multi-agent extension by various researchers in the 1990s–2000s | Hansen, M. P.; building on Glover (1989) Tabu Search |
| Typ≠ | Hybrid metaheuristic — agent-based distributed tabu search | Metaheuristic multi-objective optimization |
| Źródło pierwotne≠ | Glover, F. (1989). Tabu search — Part I. ORSA Journal on Computing, 1(3), 190–206. DOI ↗ | Hansen, M. P. (1997). Tabu search for multiobjective optimization: MOTS. Presented at the 13th International Conference on Multiple Criteria Decision Making (MCDM), Cape Town, South Africa. link ↗ |
| Inne nazwy | ABTS, Multi-Agent Tabu Search, Distributed Tabu Search, Cooperative Tabu Search | MOTS, Multi-criteria Tabu Search, Pareto Tabu Search, TSMOO |
| Pokrewne≠ | 4 | 5 |
| 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. | Multi-objective Tabu Search (MOTS) is a metaheuristic algorithm that extends the classic Tabu Search framework to simultaneously optimize two or more conflicting objective functions. Instead of a single optimum, it seeks to approximate the Pareto front — the set of solutions where no objective can be improved without worsening another — making it suitable for complex combinatorial and continuous optimization problems in engineering, logistics, and operations research. |
| ScholarGateZbiór danych ↗ |
|
|