পদ্ধতির তুলনা করুন
নির্বাচিত পদ্ধতিগুলো পাশাপাশি পর্যালোচনা করুন; যে সারিগুলোয় পার্থক্য আছে সেগুলো চিহ্নিত করা হয়।
| এজেন্ট-ভিত্তিক টাবু সার্চ× | এজেন্ট-ভিত্তিক মডেলিং (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ডেটাসেট ↗ |
|
|