方法对比
并排查看您选择的方法；存在差异的行会高亮显示。
| 粒子群优化 (PSO)× | 蚁群优化× | |
|---|---|---|
| 领域 | 优化 | 优化 |
| 方法族 | Process / pipeline | Process / pipeline |
| 起源年份≠ | 1995 | 1992 (foundational thesis); 1997 (Ant Colony System formalization) |
| 提出者 | — | — |
| 类型≠ | Population-based metaheuristic / swarm intelligence | Metaheuristic — swarm intelligence |
| 开创性文献≠ | Kennedy, J. & Eberhart, R. (1995). Particle Swarm Optimization. IEEE International Conference on Neural Networks (ICNN), 1942-1948. DOI ↗ | 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 ↗ |
| 别名 | PSO, swarm intelligence optimization, Parçacık Sürü Optimizasyonu (PSO) | ACO, Karınca Kolonisi Optimizasyonu (ACO), ant colony system |
| 相关≠ | 6 | 5 |
| 摘要≠ | 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. | 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数据集 ↗ |
|
|