Secretary bird optimization algorithm

Secretary bird optimization algorithm (SBOA) is a metaheuristic optimization algorithm introduced in 2024. It is a population-based method inspired by the hunting and predator-evasion behaviour of the secretarybird (Sagittarius serpentarius). In the published formulation, the search process is divided into two main stages: an exploration phase based on hunting behaviour and an exploitation phase based on escape behaviour.[1]

A 2025 review described SBOA as a recent bio-inspired optimizer and surveyed its variants and application areas.[2]

Background

Metaheuristic optimization algorithms are widely used for solving nonlinear, multimodal, and high-dimensional problems for which exact mathematical optimization methods may be difficult or expensive to apply.[1] SBOA was proposed within the broader family of nature-inspired algorithms and bio-inspired computing methods.[1]

In the original paper, SBOA was presented as a population-based optimizer in which each search agent represents a candidate solution. The algorithm was designed around two broad behavioural themes attributed to secretary birds in nature: hunting prey, especially snakes, and avoiding predators.[1]

Biological inspiration

The secretarybird (Sagittarius serpentarius) is a large terrestrial bird of prey native to sub-Saharan Africa and associated with open grasslands and savannas.[3] It is noted for ground-based hunting, especially against reptiles and other small prey, and for its distinctive kicking and stamping behaviour when attacking prey.[4]

In the SBOA paper, this biological inspiration is mapped to the search process as follows: preparatory behaviour corresponds to initialization, hunting behaviour corresponds to exploration, and predator-evasion behaviour corresponds to exploitation.[1]

Algorithm overview

SBOA is a population-based optimization method. Each secretary bird in the population corresponds to one candidate solution in the search space, and the position of a bird determines the values of the decision variables.[1]

The algorithm begins with a randomly initialized population bounded by lower and upper search limits. Candidate solutions are then iteratively updated through two major stages:

  • Exploration phase, modeled on hunting behaviour;
  • Exploitation phase, modeled on escape behaviour.[1]

At each iteration, the objective function is evaluated for all candidate solutions, and the current best solution is retained.[1]

Mathematical model

Initialization

In the original formulation, the position of each search agent is initialized within problem bounds as

where and are the lower and upper bounds of the -th variable, is a random number in , is the population size, and is the dimension of the problem.[1]

The population matrix is expressed as

and the vector of objective-function values is written as

[1]

Exploration phase

In the SBOA paper, hunting behaviour is divided into three stages: searching for prey, consuming prey, and attacking prey.[1]

Stage 1: Searching for prey

The first stage is associated with broad search and is modeled using a differential-update mechanism:

where is the maximum number of iterations and is a random vector.[1]

Stage 2: Consuming prey

The second stage introduces a Brownian-motion-based local search around the best solution found so far:

where denotes the current best solution.[1]

Stage 3: Attacking prey

The third stage uses a Lévy flight-based perturbation to improve global search and reduce premature convergence:

where

[1]

Exploitation phase

The exploitation stage models two predator-evasion strategies: camouflage and escape by running or flying away.[1]

These alternatives are represented as two cases:

where is a normally distributed random vector and is a randomly selected integer defined by

[1]

Search process

The overall SBOA workflow consists of initialization, iterative position updating, fitness evaluation, and retention of the best solution found so far.[1] In the original article, the search process is presented through both a flowchart and pseudocode, with the exploration stage occupying the earlier part of the update cycle and the exploitation stage refining candidate solutions afterward.[1]

Exploration and exploitation

Like many population-based optimizers, SBOA is organized around the balance between exploration and exploitation.[1] In the original article, exploration is associated with broader search over the solution space, while exploitation is associated with local refinement near promising solutions.[1]

The paper also introduced diversity-based expressions for reporting exploration and exploitation percentages during the run of the algorithm.[1]

Computational complexity

The original paper analyzed SBOA using Big O notation. Let denote the population size, the number of decision variables, and the maximum number of iterations. The time complexity of initialization is given as , while the solution-update process is described as . The total computational complexity is summarized as

[1]

Applications

In the original publication, SBOA was evaluated on benchmark suites including CEC 2017 and CEC 2022, and was also applied to constrained engineering design problems and three-dimensional path planning for unmanned aerial vehicles.[1] Later work and reviews have described additional variants and applications of the method.[2]

SBOA has also been used as an optimizer for training multilayer perceptron models by encoding network weights and biases as candidate solutions and minimizing mean squared error.[5]

See also

References

  1. 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 Fu, Youfa; Liu, Dan; Chen, Jiadui; He, Ling (2024). "Secretary bird optimization algorithm: a new metaheuristic for solving global optimization problems". Artificial Intelligence Review. 57 (5): 123. doi:10.1007/s10462-024-10729-y.
  2. 1 2 Sanjalawe, Yousef; Al-E'mari, Salam; Abualhaj, Mosleh; Makhadmeh, Sharif Naser; Alsharaiah, Mohammad A.; Hijazi, Duaa H. (2025). "Recent advances in secretary bird optimization algorithm, its variants and applications". Evolutionary Intelligence. 18 (3): 65. doi:10.1007/s12065-025-01054-6.
  3. ↑ Hofmeyr, Sally D.; Symes, Craig T.; Underhill, Leslie G. (2014). "Secretarybird Sagittarius serpentarius population trends and ecology: insights from South African citizen science data". PLOS ONE. 9 (5) e96772. doi:10.1371/journal.pone.0096772. PMC 4016007.
  4. ↑ Portugal, Steven J.; Myrvold, Nathan P.; Aung, Htet; Song, Yang (2016). "The fast and forceful kicking strike of the secretary bird". Current Biology. 26 (2): R58–R59. doi:10.1016/j.cub.2015.12.004.
  5. ↑ Dilber, Burak; Özdemir, A. Fırat (2026). "A novel approach to training feed-forward multi-layer perceptrons with recently proposed secretary bird optimization algorithm". Neural Computing and Applications. 38: 100. doi:10.1007/s00521-026-11874-x.