방법 비교
선택한 방법을 나란히 검토하세요. 서로 다른 행은 강조 표시됩니다.
| Agent-Based Tabu Search× | 에이전트 기반 유전 알고리즘× | |
|---|---|---|
| 분야 | 시뮬레이션 | 시뮬레이션 |
| 계열 | Process / pipeline | Process / pipeline |
| 기원 연도≠ | 1989–1995 | 1990s |
| 창시자≠ | Glover, F. (tabu search); multi-agent extension by various researchers in the 1990s–2000s | Adamidis, P. & Petridis, V. (early formal treatment); broader community development in 1990s |
| 유형≠ | Hybrid metaheuristic — agent-based distributed tabu search | Hybrid evolutionary-agent simulation |
| 원전≠ | Glover, F. (1989). Tabu search — Part I. ORSA Journal on Computing, 1(3), 190–206. DOI ↗ | Adamidis, P., & Petridis, V. (1996). Co-operating populations with different evolution behaviors. Proceedings of the IEEE International Conference on Evolutionary Computation (ICEC 1996), 188-191. IEEE. link ↗ |
| 별칭 | ABTS, Multi-Agent Tabu Search, Distributed Tabu Search, Cooperative Tabu Search | ABGA, Agent-Based GA, Multi-Agent Genetic Algorithm, Distributed Agent GA |
| 관련≠ | 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. | An Agent-Based Genetic Algorithm (ABGA) partitions a genetic algorithm's population across a network of autonomous agents, each maintaining a local sub-population and evolving it independently. Agents periodically exchange individuals (migration) based on proximity or communication rules, enabling parallel exploration of the search space while preserving population diversity and avoiding premature convergence. |
| ScholarGate데이터셋 ↗ |
|
|