So sánh phương pháp
Xem các phương pháp đã chọn cạnh nhau; những hàng khác biệt được làm nổi bật.
| Tối ưu hóa Đàn Hạt Xác định× | Tối ưu hóa Bầy đàn Hạt (PSO)× | |
|---|---|---|
| Lĩnh vực≠ | Mô phỏng | Tối ưu hóa |
| Họ | Process / pipeline | Process / pipeline |
| Năm ra đời≠ | 1995 (PSO); deterministic formulation circa 2002 | 1995 |
| Người khởi xướng≠ | Kennedy, J., Eberhart, R. (PSO); deterministic variant formalized in convergence analysis literature | — |
| Loại≠ | Swarm intelligence metaheuristic — deterministic variant | Population-based metaheuristic / swarm intelligence |
| Công trình gốc≠ | Kennedy, J., Eberhart, R. (1995). Particle swarm optimization. Proceedings of ICNN'95 — International Conference on Neural Networks, vol. 4, pp. 1942–1948. IEEE. DOI ↗ | Kennedy, J. & Eberhart, R. (1995). Particle Swarm Optimization. IEEE International Conference on Neural Networks (ICNN), 1942-1948. DOI ↗ |
| Tên gọi khác≠ | DPSO, Deterministic PSO, PSO without stochastic components, Fully Deterministic PSO | PSO, swarm intelligence optimization, Parçacık Sürü Optimizasyonu (PSO) |
| Liên quan | 6 | 6 |
| Tóm tắt≠ | 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. | 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. |
| ScholarGateBộ dữ liệu ↗ |
|
|