ScholarGate
Assistent

Compara mètodes

Revisa els mètodes seleccionats l'un al costat de l'altre; les files que difereixen es ressalten.

Algorisme d'Optimització Aritmètica×Algorisme genètic×
CampOptimitzacióOptimització
FamíliaMachine learningProcess / pipeline
Any d'origen20201975
Autor originalLaith AbualigahJohn Henry Holland
TipusMathematical metaheuristic algorithmPopulation-based metaheuristic
Font seminalAbualigah, L., Yousri, D., Abd Elaziz, M., Ewees, A. A., Al-qaness, M. A., & Gandomi, A. H. (2021). Arithmetic optimization algorithm: A new metaheuristic algorithm for solving optimization problems. Applied Mathematics and Computation, 392, 125450. link ↗Holland, J.H. (1975). Adaptation in Natural and Artificial Systems. University of Michigan Press. link ↗
ÀliesAOAGA, evolutionary algorithm, Genetik Algoritma — Evrimsel Optimizasyon
Relacionats55
ResumThe Arithmetic Optimization Algorithm (AOA) is a metaheuristic optimization approach introduced by Abualigah et al. in 2020 that leverages mathematical operators (multiplication, division, addition, subtraction) as the inspiration for search strategies. Unlike nature-inspired algorithms, AOA uses the inherent properties of arithmetic operations to balance exploration and exploitation, making it particularly effective for mathematical 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.
ScholarGateConjunt de dades
  1. v1
  2. 1 Fonts
  3. PUBLISHED
  1. v1
  2. 2 Fonts
  3. PUBLISHED

Ves a la cerca Download slides

ScholarGateCompara mètodes: Arithmetic Optimization Algorithm · Genetic Algorithm. Recuperat el 2026-06-15 de https://scholargate.app/ca/compare