ScholarGate
Βοηθός

Σύγκριση μεθόδων

Εξετάστε τις επιλεγμένες μεθόδους δίπλα-δίπλα· οι γραμμές που διαφέρουν επισημαίνονται.

Αλγόριθμος Μύκητα της Λάσπης×Βελτιστοποίηση Σμήνους Σωματιδίων (PSO)×
ΠεδίοΒελτιστοποίησηΒελτιστοποίηση
ΟικογένειαMachine learningProcess / pipeline
Έτος προέλευσης20201995
ΔημιουργόςShimin Li
ΤύποςNature-inspired metaheuristic algorithmPopulation-based metaheuristic / swarm intelligence
Θεμελιώδης πηγήLi, S., Chen, H., Wang, M., Heidari, A. A., & Chakraborty, S. (2020). Slime mould algorithm: A new method for stochastic optimization. Future Generation Computer Systems, 111, 300-323. DOI ↗Kennedy, J. & Eberhart, R. (1995). Particle Swarm Optimization. IEEE International Conference on Neural Networks (ICNN), 1942-1948. DOI ↗
Εναλλακτικές ονομασίεςSMAPSO, swarm intelligence optimization, Parçacık Sürü Optimizasyonu (PSO)
Συναφείς56
ΣύνοψηThe Slime Mould Algorithm (SMA) is a nature-inspired metaheuristic optimization technique introduced by Li et al. in 2020. It mimics the behavior of slime moulds, which spread and contract to find optimal food sources. SMA addresses complex optimization problems by simulating the adaptive foraging and spatial distribution patterns of these organisms.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Σύνολο δεδομένων
  1. v1
  2. 1 Πηγές
  3. PUBLISHED
  1. v1
  2. 2 Πηγές
  3. PUBLISHED

Μετάβαση στην αναζήτηση Λήψη διαφανειών

ScholarGateΣύγκριση μεθόδων: Slime Mould Algorithm · Particle Swarm Optimization. Ανακτήθηκε στις 2026-06-17 από https://scholargate.app/el/compare