方法对比
并排查看您选择的方法；存在差异的行会高亮显示。
| 确定性粒子群优化× | 遗传算法× | |
|---|---|---|
| 领域≠ | 仿真 | 优化 |
| 方法族 | Process / pipeline | Process / pipeline |
| 起源年份≠ | 1995 (PSO); deterministic formulation circa 2002 | 1975 |
| 提出者≠ | Kennedy, J., Eberhart, R. (PSO); deterministic variant formalized in convergence analysis literature | John Henry Holland |
| 类型≠ | Swarm intelligence metaheuristic — deterministic variant | Population-based metaheuristic |
| 开创性文献≠ | Kennedy, J., Eberhart, R. (1995). Particle swarm optimization. Proceedings of ICNN'95 — International Conference on Neural Networks, vol. 4, pp. 1942–1948. IEEE. DOI ↗ | Holland, J.H. (1975). Adaptation in Natural and Artificial Systems. University of Michigan Press. link ↗ |
| 别名≠ | DPSO, Deterministic PSO, PSO without stochastic components, Fully Deterministic PSO | GA, evolutionary algorithm, Genetik Algoritma — Evrimsel Optimizasyon |
| 相关≠ | 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. | A genetic algorithm (GA) is a population-based metaheuristic optimization method introduced by John Henry Holland (1975) that mimics the principles of natural selection. It maintains a population of candidate solutions and iteratively improves them through selection, crossover, and mutation operators, making it especially powerful on discontinuous, non-convex, and multi-modal search spaces where classical gradient-based methods fail. |
| ScholarGate数据集 ↗ |
|
|