Arithmetic Optimization Algorithm
Also known as: AOA
The 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.
Key highlights
- Simple mathematical foundation without requiring biological inspiration or complex behavioral modeling
- Mathematical operations are computationally efficient, reducing per-iteration overhead
- Strong balance between exploration and exploitation through operator selection probabilities
- Demonstrates competitive performance on diverse benchmark functions and real-world problems
Intuition
This section is available to Pro members. Upgrade to Pro
How it works
This section is available to Pro members. Upgrade to Pro
When to use it
Apply AOA to both continuous and discrete optimization problems, particularly when mathematical properties of the problem are well-understood. Effective for engineering design, machine learning hyperparameter tuning, and combinatorial problems. Preferred when computational simplicity and rapid convergence are priorities.
Strengths & limitations
- Simple mathematical foundation without requiring biological inspiration or complex behavioral modeling
- Mathematical operations are computationally efficient, reducing per-iteration overhead
- Strong balance between exploration and exploitation through operator selection probabilities
- Demonstrates competitive performance on diverse benchmark functions and real-world problems
- Mathematical abstraction may be less intuitive than nature-inspired approaches for some practitioners
- Limited theoretical analysis of convergence properties compared to classical optimization methods
- Performance on high-dimensional problems shows variable results across different problem landscapes
Common pitfalls
This section is available to Pro members. Upgrade to Pro
Applications
This section is available to Pro members. Upgrade to Pro
Frequently asked
Why are multiplication and division used for exploration in AOA?
Multiplication and division operations produce larger magnitudes and wider dispersions of values, causing solutions to spread across the search space. This natural divergence supports exploration by preventing premature concentration around a single region.
How does AOA differ from genetic algorithms?
While GA uses selection, crossover, and mutation inspired by biology, AOA uses arithmetic operators directly as search mechanisms. AOA typically converges faster with fewer hyperparameters, though GA may explore more effectively on highly irregular landscapes.
Can AOA handle discrete optimization problems?
Yes, AOA can be adapted for discrete problems through discretization methods such as rounding continuous solutions or mapping to discrete variable indices. However, careful design of the operator application strategy is necessary to maintain algorithm effectiveness.
What is the computational complexity of AOA per iteration?
AOA has linear computational complexity O(N*D) per iteration, where N is population size and D is problem dimensionality. This makes it computationally efficient compared to algorithms requiring pairwise distance calculations.
Sources
- 1.Abualigah, 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.
You have read it. What now?
Cite this page
ScholarGate. (2026, June 3). Arithmetic Optimization Algorithm. ScholarGate. https://scholargate.app/optimization/arithmetic-optimization-algorithm