方法对比
并排查看您选择的方法；存在差异的行会高亮显示。
| 确定性粒子群优化× | 蚁群优化× | |
|---|---|---|
| 领域≠ | 仿真 | 优化 |
| 方法族 | Process / pipeline | Process / pipeline |
| 起源年份≠ | 1995 (PSO); deterministic formulation circa 2002 | 1992 (foundational thesis); 1997 (Ant Colony System formalization) |
| 提出者≠ | Kennedy, J., Eberhart, R. (PSO); deterministic variant formalized in convergence analysis literature | — |
| 类型≠ | Swarm intelligence metaheuristic — deterministic variant | Metaheuristic — swarm intelligence |
| 开创性文献≠ | Kennedy, J., Eberhart, R. (1995). Particle swarm optimization. Proceedings of ICNN'95 — International Conference on Neural Networks, vol. 4, pp. 1942–1948. IEEE. 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 ↗ |
| 别名≠ | DPSO, Deterministic PSO, PSO without stochastic components, Fully Deterministic PSO | ACO, Karınca Kolonisi Optimizasyonu (ACO), ant colony system |
| 相关≠ | 6 | 5 |
| 摘要≠ | Deterministic Particle Swarm Optimization (DPSO) removes the stochastic random coefficients from classical PSO, replacing them with fixed cognitive and social acceleration parameters. Particles move through the search space following fully predictable trajectories, enabling reproducible convergence analysis and guaranteed termination behavior in continuous and combinatorial 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数据集 ↗ |
|
|