Сравнение методов
Просматривайте выбранные методы рядом; строки с различиями подсвечены.
| Агентно-ориентированная муравьиная оптимизация× | Оптимизация роем частиц (PSO)× | |
|---|---|---|
| Область≠ | Имитационное моделирование | Оптимизация |
| Семейство | Process / pipeline | Process / pipeline |
| Год появления≠ | 1992-2004 | 1995 |
| Автор метода≠ | Dorigo, M. and colleagues; agent-based framing developed in swarm intelligence community | — |
| Тип≠ | Metaheuristic optimization — agent-based swarm simulation | Population-based metaheuristic / swarm intelligence |
| Основополагающий источник≠ | Dorigo, M., Stutzle, T. (2004). Ant Colony Optimization. MIT Press, Cambridge, MA. ISBN: 9780262042192 | Kennedy, J. & Eberhart, R. (1995). Particle Swarm Optimization. IEEE International Conference on Neural Networks (ICNN), 1942-1948. DOI ↗ |
| Другие названия≠ | AB-ACO, Agent-Based ACO, Multi-Agent Ant Colony Optimization, MAACO | PSO, swarm intelligence optimization, Parçacık Sürü Optimizasyonu (PSO) |
| Связанные≠ | 5 | 6 |
| Сводка≠ | 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. | Particle Swarm Optimization (PSO) is a population-based metaheuristic algorithm introduced by Kennedy and Eberhart in 1995, inspired by the collective movement of bird flocks and fish schools. Each candidate solution — called a particle — moves through the search space by updating its velocity and position based on its own best experience and the best experience of the entire swarm, enabling fast convergence across continuous optimization problems. |
| ScholarGateНабор данных ↗ |
|
|