方法对比
并排查看您选择的方法；存在差异的行会高亮显示。
| 基于智能体的禁忌搜索× | 基于主体的建模（ABM）× | |
|---|---|---|
| 领域 | 仿真 | 仿真 |
| 方法族 | Process / pipeline | Process / pipeline |
| 起源年份≠ | 1989–1995 | 1970s–1990s (formalized as a field) |
| 提出者≠ | Glover, F. (tabu search); multi-agent extension by various researchers in the 1990s–2000s | Thomas Schelling and Robert Axelrod (foundational contributions, 1970s–1990s) |
| 类型≠ | Hybrid metaheuristic — agent-based distributed tabu search | Computational simulation method |
| 开创性文献≠ | Glover, F. (1989). Tabu search — Part I. ORSA Journal on Computing, 1(3), 190–206. DOI ↗ | Axelrod, R. (1997). The Complexity of Cooperation: Agent-Based Models of Competition and Collaboration. Princeton University Press. DOI ↗ |
| 别名 | ABTS, Multi-Agent Tabu Search, Distributed Tabu Search, Cooperative Tabu Search | ABM, Ajan Tabanlı Modelleme (ABM), multi-agent simulation, individual-based modeling |
| 相关≠ | 4 | 5 |
| 摘要≠ | 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. | Agent-based modeling (ABM) is a computational simulation method, formalized through the work of Thomas Schelling and Robert Axelrod in the 1970s–1990s, that simulates the behavior of complex systems by specifying and running autonomous agents — individuals, firms, cells, or any bounded entity — whose local interactions with each other and with their environment collectively produce global, system-level patterns that could not be predicted from any single agent's rules alone. |
| ScholarGate数据集 ↗ |
|
|