方法对比
并排查看您选择的方法；存在差异的行会高亮显示。
| 基于智能体的蚁群优化× | 蚁群优化× | |
|---|---|---|
| 领域≠ | 仿真 | 优化 |
| 方法族 | Process / pipeline | Process / pipeline |
| 起源年份≠ | 1992-2004 | 1992 (foundational thesis); 1997 (Ant Colony System formalization) |
| 提出者≠ | Dorigo, M. and colleagues; agent-based framing developed in swarm intelligence community | — |
| 类型≠ | Metaheuristic optimization — agent-based swarm simulation | Metaheuristic — swarm intelligence |
| 开创性文献≠ | Dorigo, M., Stutzle, T. (2004). Ant Colony Optimization. MIT Press, Cambridge, MA. ISBN: 9780262042192 | Dorigo, M. & Gambardella, L.M. (1997). Ant Colony System: A Cooperative Learning Approach to the Traveling Salesman Problem. IEEE Transactions on Evolutionary Computation, 1(1), 53-66. DOI ↗ |
| 别名≠ | AB-ACO, Agent-Based ACO, Multi-Agent Ant Colony Optimization, MAACO | ACO, Karınca Kolonisi Optimizasyonu (ACO), ant colony system |
| 相关 | 5 | 5 |
| 摘要≠ | Agent-Based Ant Colony Optimization (AB-ACO) models individual ants as autonomous agents that probabilistically construct solutions by following and depositing pheromone trails on a search graph. By coupling agent-level behavioral rules with a shared pheromone environment, the collective system converges on high-quality solutions to hard combinatorial and simulation-embedded optimization problems without central coordination. | Ant Colony Optimization (ACO) is a metaheuristic algorithm introduced by Marco Dorigo and colleagues in the early 1990s that solves combinatorial optimisation problems by simulating the collective foraging behaviour of ants. Real ants lay pheromone trails on paths and preferentially follow stronger trails; ACO turns this positive-feedback mechanism into a search procedure that finds high-quality solutions to graph-structured problems such as the Travelling Salesman Problem, vehicle routing, and scheduling. |
| ScholarGate数据集 ↗ |
|
|