ScholarGate
Avustaja

Vertaile menetelmiä

Tarkastele valitsemiasi menetelmiä rinnakkain; eroavat rivit korostetaan.

Aquila Optimizer×Hiukkasparviäly (PSO)×
TieteenalaOptimointiOptimointi
MenetelmäperheMachine learningProcess / pipeline
Syntyvuosi20211995
KehittäjäLaith Abualigah
TyyppiNature-inspired metaheuristic algorithmPopulation-based metaheuristic / swarm intelligence
AlkuperäislähdeAbualigah, L., Yousri, D., Abd Elaziz, M., Ewees, A. A., Al-qaness, M. A., & Gandomi, A. H. (2021). Aquila optimizer: A novel meta-heuristic optimization algorithm. Computers and Industrial Engineering, 157, 107250. DOI ↗Kennedy, J. & Eberhart, R. (1995). Particle Swarm Optimization. IEEE International Conference on Neural Networks (ICNN), 1942-1948. DOI ↗
RinnakkaisnimetAOPSO, swarm intelligence optimization, Parçacık Sürü Optimizasyonu (PSO)
Liittyvät36
TiivistelmäThe Aquila Optimizer (AO) is a nature-inspired metaheuristic algorithm presented by Abualigah et al. in 2021, modeled after the hunting behavior and sensory abilities of golden eagles (aquila chrysaetos). The algorithm captures the exploration and exploitation phases of eagle hunting, including high-altitude soaring, exploration with high-precision vision, and rapid diving attacks. AO is designed to solve both constrained and unconstrained 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.
ScholarGateAineisto
  1. v1
  2. 1 Lähteet
  3. PUBLISHED
  1. v1
  2. 2 Lähteet
  3. PUBLISHED

Siirry hakuun Lataa diat

ScholarGateVertaile menetelmiä: Aquila Optimizer · Particle Swarm Optimization. Haettu 2026-06-18 osoitteesta https://scholargate.app/fi/compare