See discussions, stats, and author profiles for this publication at: [Link]

net/publication/394518404

Sloth Optimization Algorithm

Preprint · August 2025

DOI: 10.13140/RG.2.2.25217.36965

CITATIONS READS

0 25

1 author:

Jincheng Zhang
Rajabhat Maha Sarakham University
192 PUBLICATIONS 341 CITATIONS

SEE PROFILE

All content following this page was uploaded by Jincheng Zhang on 17 August 2025.

The user has requested enhancement of the downloaded file.

 Sloth Optimization Algorithm

Jincheng Zhang*1[0009-0005-1860-0009]
1
Faculty of Science and Technology, Rajabhat Maha Sarakham University, Maha Sarakham
44000, Thailand
zjc1639834588@[Link]

Abstract. Metaheuristic optimization algorithms are widely used in continuous,

discrete, and combinatorial optimization. This paper proposes a novel swarm
intelligence optimization method, the Sloth Optimization Algorithm (SOA),
inspired by the sloth's slow movement, energy-saving strategies, efficient
decision-making, and environmental adaptability. Unlike traditional algorithms,
SOA incorporates three unique mechanisms: a two-layer decision delay
mechanism, a dynamic energy sharing mechanism, and an environment-
sensitive adaptive step size. These mechanisms achieve a balance between local
fine-grained search and global exploration, improving convergence stability
while maintaining swarm diversity. The algorithm has a clear flow and
complete mathematical modeling, making it suitable for complex, high-
dimensional optimization problems. This paper provides a detailed
mathematical formula, pseudocode, and innovative analysis of the algorithm,
providing a foundation for further theoretical research and application.

Keywords: Swarm intelligence optimization, sloth behavior, two-layer decision

delay, energy sharing, adaptive step size.

1 Introduction

With the development of scientific computing, engineering optimization, and artificial

intelligence technologies, modern optimization problems are becoming increasingly
complex. Many practical problems are characterized by high dimensionality,
multimodality, nonlinearity, and complex constraints. This makes traditional
deterministic optimization methods (such as gradient descent, Newton method, and
simplex method) often face huge challenges in solving these problems. Specifically,
traditional methods are prone to falling into local optimality, are sensitive to initial
values, are computationally intensive, and have slow convergence. In high-
dimensional and complex search spaces, algorithm performance is significantly
limited, so more efficient and robust optimization methods are needed [1-41].

Swarm intelligence optimization algorithms, as a randomized, collaborative

optimization strategy, have been widely used in solving complex optimization
problems due to their flexibility, robustness, and global search capabilities. Typical
algorithms include genetic algorithms (GAs), particle swarm optimization algorithms
2 F. Author and S. Author

(PSOs), ant colony optimization algorithms (ACOs), and whale optimization

algorithms (WOAs). These algorithms achieve diverse search and group collaborative
optimization by simulating natural or social behavior. However, despite achieving
some success, existing algorithms still suffer from several issues:

They are prone to falling into local optima, especially in multimodal functions or
high-dimensional search spaces;

They converge slowly, making them inefficient, especially when fine-grained local
search is required;

Algorithm parameters are highly sensitive to performance, making parameter

adjustment complex;

Group diversity tends to decrease with iteration, leading to premature convergence.

To address these issues, this paper proposes a novel swarm intelligence optimization
algorithm, the Sloth Optimization Algorithm (SOA). This algorithm is inspired by the
natural behavior of sloths, which are known for their slow movements, energy-saving
strategies, patient decision-making, and strong environmental adaptability. Mapping
these behavioral characteristics to the optimization algorithm yields the following
corresponding strategies:

Slow movement corresponds to local, precise search: Sloths move slowly but
precisely, mimicking the algorithm's fine-tuning of individuals around the global
optimal direction, achieving high-precision local search.

Energy conservation corresponds to energy constraints and sharing: Sloths can

survive in low-energy states and leverage group collaboration. The algorithm
introduces energy variables and energy sharing mechanisms to prevent low-energy
individuals from being quickly eliminated, improving the group's search capability
and stability.

Patience corresponds to a two-tiered decision-making mechanism: Sloths make

decisions slowly but accurately. The algorithm employs a two-tiered decision-making
delay mechanism of short-term fine-tuning and long-term policy updates to achieve a
balance between local exploration and global exploration.

Environmental adaptability corresponds to adaptive step size adjustment: Sloths are

sensitive to their environment. The algorithm dynamically adjusts step size based on
local gradient changes and neighborhood distribution, ensuring that the search
strategy adapts to the characteristics of the problem.

By combining the behavioral characteristics of sloths with mathematical optimization

methods, SOA forms a unique optimization framework that simultaneously balances
 Contribution Title (shortened if too long) 3

local refined search and global leap exploration. While ensuring swarm diversity,
convergence stability, and adaptability, it provides a new approach and
methodological foundation for solving complex high-dimensional optimization
problems. This paper's algorithm modeling section details the mathematical formulas
and logic for swarm initialization, two-level decision delay, dynamic energy sharing,
and environment-sensitive adaptive step size. Complete pseudocode is also provided,
providing a comprehensive mathematical foundation for theoretical analysis and
subsequent applications.

2 Algorithm Modeling
2.1 Initialization

Assume the optimization problem is a D-dimensional continuous space optimization

problem, with the objective function represented by F(X) and the search space bounds
L_d ≤ X_d ≤ U_d, where d = 1, 2, ..., D. The algorithm employs a swarm search
strategy with a swarm size of N and a maximum number of iterations of T. The
position of the i-th individual at iteration t is denoted by X_i(t), the global optimal
position is X_best(t), and the individual energy is E_i(t) ∈ [0, 1]. The initialization
steps are as follows:

X_i(0) = L + rand() * (U - L), i = 1..N

E_i(0) = 1
Calculate F(X_i(0))
X_best(0) = argmin(F(X_i(0)))

Where rand() is a uniformly distributed random number in the [0,1] range, used to
generate the initial random position. The initial energy E_i(0) = 1 indicates that all
individuals have sufficient energy to participate in the search process.

During the initialization phase, the algorithm also calculates the initial distance
distribution between each individual and its neighbors and the local gradient of the
objective function, providing basic data for subsequent adaptive step size and energy
sharing. This step ensures that the algorithm has a certain degree of diversity and
search capability at the beginning of the iteration.

2.2 Dual-Level Decision Delay (DDD) Mechanism

Sloths make decisions slowly but precisely in nature. To mimic this characteristic,
SOA introduces a dual-level decision delay mechanism. Each iteration consists of two
parts: short-term fine-tuning (local search) and long-term policy update (global
search).

2.2.1 Short-Term Fine-Tuning

Short-term fine-tuning is used for refined local search. The formula is as follows:
4 F. Author and S. Author

X_i_temp = X_i(t) + α_i(t) * randn() * (X_best(t) - X_i(t))

Where:

α_i(t) is the adaptive step size, which is dynamically adjusted based on local gradient
changes;

randn() is a standard normally distributed random number used to simulate the

uncertainty of individual movement;

X_best(t) is the current global optimal individual position.

The step size α_i(t) is adjusted based on the change in the local objective function:

α_i(t) = α_max * exp(-|ΔF_local|)

ΔF_local = F(X_i(t)) - F(X_i(t-1))

This strategy ensures that when local improvement is significant, the step size is
reduced, improving search accuracy; when local improvement is slow or stagnant, the
step size is increased, which helps escape the local optimum.

2.2.2 Long-term Policy Update

Long-term policy update is used for global exploration. When individual energy is
low or local search improvement is insufficient, individuals are allowed to perform
jump exploration:

If rand() > E_i(t):

X_i(t+1) = X_i_temp + γ_i(t) * rand() * (U - L)
Otherwise:
X_i(t+1) = X_i_temp

γ _i(t) is determined by the environment-sensitive adaptive step size mechanism,

ensuring that the global jump direction and magnitude are adapted to the current
search environment. Through this mechanism, the algorithm balances local
development and global exploration, achieving more efficient convergence.

2.3 Dynamic Energy Sharing Mechanism (ESM)

Sloth colonies can maintain the survival of low-energy individuals through

collaboration. SOA maps this behavior to the algorithm, enhancing the colony's
overall search capability through an energy sharing mechanism. The specific formula
is as follows:
 Contribution Title (shortened if too long) 5

E_avg = sum(E_i(t)) / N
If E_i(t+1) < E_avg:
Randomly select k individuals with above-average energy.
Each contributes ΔE.
E_i(t+1) += k * ΔE
E-contributing individuals E_j(t+1) -= ΔE

This mechanism ensures that low-energy individuals can still participate in the search,
improving colony diversity and preventing premature convergence. The energy
sharing mechanism simulates the "mutual assistance" behavior of sloths within the
colony, helping to maintain search equilibrium.

2.4 Environment-Sensitive Adaptive Stepsize (EAS)

The stepsizes α_i(t), β_i(t), and γ_i(t) are dynamically adjusted based on the rate of
change of the local objective function and the neighborhood distribution:

α_i(t) = α_max * exp(-|ΔF_local|)

β_i(t) = β_max * (1 - exp(-|ΔF_local|))
γ_i(t) = γ_max * variance(X_neighborhood)

ΔF_local = F(X_i(t)) - F(X_i(t-1))

X_neighborhood is the set of locations in the neighborhood of individual i.

variance(X_neighborhood) measures the width of the local search distribution.

This mechanism enables stepsize adaptation to the environment, making the algorithm
more stable and efficient in complex search spaces while reducing the dependence of
fixed parameters on algorithm performance.

2.5 Energy Update Rules

Individual energy is updated based on movement distance and improvement:

E_i(t+1) = E_i(t) - δ * ||X_i(t+1) - X_i(t)|| + η * improvement_ratio

improvement_ratio = (F(X_i(t)) - F(X_i(t+1))) / F(X_i(t))
Constraint 0 ≤ E_i(t+1) ≤ 1

Where δ is the movement cost coefficient, and η is the improvement reward

coefficient. This ensures a dynamic energy balance, allowing individual energy to
adapt to changes in search behavior.

2.6 Global Optimization Update

6 F. Author and S. Author

Update the global optimal position after each iteration:

If F(X_i(t+1)) < F(X_best(t)):

X_best(t+1) = X_i(t+1)
Otherwise:
X_best(t+1) = X_best(t)

Through the above mechanism, the algorithm maintains global optimal information at
each iteration, achieving collaborative optimization.

3 Algorithm flow

Pseudo code is as follows:

Input: population size N, maximum number of iterations T, search space L, U,

objective function F(X)
Initialize X_i(0), calculate F_i(0), X_best(0)
Initialize energy E_i(0) = 1

for t = 1 to T:
Calculate local gradient ΔF_local and neighborhood variance

for i = 1 to N:
Short-term fine-tuning:
X_i_temp = X_i(t) + α_i(t) * randn() * (X_best(t) - X_i(t))
Long-term policy update:
If rand() > E_i(t):
X_i(t+1) = X_i_temp + γ_i(t) * rand() * (U - L)
Otherwise:
X_i(t+1) = X_i_temp
Update energy:
E_i(t+1) = E_i(t) - δ * ||X_i(t+1)-X_i(t)|| + η * improvement_ratio
Energy sharing:
If E_i(t+1) < E_avg:
Borrow ΔE from the high-energy individual
Constrain energy 0 ≤ E_i(t+1) ≤ 1
Calculate F(X_i(t+1))
Update the global optimal X_best(t+1)

Output: X_best(T), F(X_best(T))

4. Innovation Analysis
 Contribution Title (shortened if too long) 7

The innovation of the Sloth Optimization Algorithm (SOA) lies in its deep integration
of natural behavioral simulation and optimization algorithm design, specifically in the
following aspects:

Dual-Decision Delay (DDD)

Most traditional optimization algorithms use a single-level decision-making strategy,

whereby individual positions are updated based solely on current information in each
iteration. SOA, on the other hand, introduces a dual-level mechanism of short-term
fine-tuning and long-term policy updates. Short-term fine-tuning ensures that
individuals conduct detailed local searches near the global optimal direction,
effectively capturing small improvements to the local optimal solution. Long-term
policy updates allow individuals to make large leaps in exploration when energy is
insufficient or local search stagnates, increasing search space coverage and reducing
the probability of being trapped in a local optimum. This dual-level decision delay
mechanism strikes a balance between local exploration and global exploration,
enabling the algorithm to achieve both search accuracy and global leapfrogging
capabilities when tackling complex, high-dimensional, and multimodal optimization
problems.

Dynamic Energy Sharing Mechanism (ESM)

In nature, sloths survive through collaboration and energy sharing. SOA maps this
behavior to a group energy-sharing mechanism within the algorithm: when an
individual's energy falls below the group average, it can borrow energy from higher-
energy individuals, ensuring that weak individuals are not prematurely eliminated.
This mechanism not only maintains group diversity but also enhances the group's
overall search capability, reduces the risk of early convergence, and improves the
algorithm's adaptability to complex search spaces. The mathematical implementation
of energy sharing ensures that each energy-borrowing operation strictly adheres to the
principle of energy conservation, allowing the algorithm to maintain theoretical rigor
while mimicking natural behavior.

Environment-Aware Step (EAS) Mechanism

Sloths are highly sensitive to environmental changes. SOA dynamically adjusts the
step sizes α, β, and γ based on the local objective function gradient and neighborhood
variance, enabling the search step size to adapt to the environment. When local
improvement is significant, the step size is reduced to improve search accuracy. When
local improvement stagnates or the gradient changes are small, the step size is
increased to enhance global exploration. This mechanism enables the algorithm to
automatically balance exploration and exploitation in high-dimensional, multimodal,
or irregular optimization spaces, eliminating the need for manual parameter tuning
and improving the algorithm's adaptability and robustness.

Integration of Behavioral Strategies

8 F. Author and S. Author

SOA combines the behavioral characteristics of sloths, such as slow movement,

energy-saving strategies, patient decision-making, and environmental adaptability,
with mathematical models of swarm intelligence optimization to form a unique
optimization framework. This integration not only provides a new approach to
algorithm design but also expands the theoretical boundaries of swarm intelligence
optimization, allowing optimization algorithm design to draw inspiration from natural
behavior, thereby developing more innovative metaheuristic algorithms.

Overall, SOA's innovation lies not only in the unique design of its individual
mechanisms but also in the synergistic effect between them. Specifically, the two-
layer decision delay, dynamic energy sharing, and context-sensitive adaptive step size
work together to achieve a dynamic balance between maintaining swarm diversity,
enhancing global exploration capabilities, and localized fine-grained search
capabilities, forming a new and scalable swarm intelligence optimization strategy.

5 Application Scenarios and Potential Value

Due to its unique mechanism design and highly adaptive nature, the Sloth Optimizer
(SOA) has broad potential applications in multiple fields:

Continuous Optimization Problems

For minimization or maximization problems involving high-dimensional nonlinear
functions, SOA can achieve precise local search through short-term fine-tuning while
simultaneously leveraging long-term policy updates to escape local optima. This
makes it suitable for solving complex mathematical models. For example, scenarios
such as function optimization, continuous parameter tuning, and solving complex
mathematical models can fully leverage SOA's ability to balance exploration and
exploitation.

Combinatorial Optimization Problems

SOA can be used in combinatorial optimization scenarios such as path planning,
scheduling, and permutation optimization. Its two-level decision-making mechanism
enables local fine-tuning within the search space to optimize the permutation order,
while global policy hopping helps the algorithm skip local optima, improving search
efficiency and solution quality. A dynamic energy sharing mechanism ensures that
low-energy individuals in the group can still participate in the search, enhancing the
algorithm's diversity and stability in the combinatorial space.

Engineering Optimization
SOA can be applied to engineering problems such as structural optimization, system
design optimization, and parameter tuning. Engineering optimization often involves
multiple objective functions and constraints, resulting in complex and high-
dimensional search spaces. SOA's adaptive step-size mechanism automatically adjusts
the search amplitude based on local gradient changes, ensuring the algorithm quickly
 Contribution Title (shortened if too long) 9

approaches the optimal solution while satisfying constraints, thereby improving

engineering optimization efficiency.

Theoretical Research and Algorithm Extensions

As a new swarm intelligence algorithm, SOA provides a theoretical foundation for
exploring the integration of behavioral and mathematical optimization. Its innovative
mechanisms can inspire subsequent algorithmic research, such as mapping behavioral
features into other intelligent optimization algorithms or extending them to multi-
objective optimization and multi-swarm collaborative optimization problems. SOA
offers a new perspective and actionable modeling paradigm for metaheuristic
algorithm research.

Overall, SOA provides a novel approach to constructing optimization strategies.

Through behaviorally inspired mechanism design, it can be widely applied in fields
such as continuous optimization, combinatorial optimization, engineering
optimization, and theoretical research. Its potential value lies not only in improving
the efficiency of solving practical optimization problems but also in expanding the
scope of optimization algorithm design, providing a new theoretical and practical
foundation for the future development of metaheuristic optimization algorithms.

6 Conclusions

This paper proposes the Sloth Optimization Algorithm (SOA). By emulating the slow
movement, energy-saving strategies, efficient decision-making, and environmental
adaptation of sloths, it constructs three unique mechanisms: a two-tier decision delay
mechanism (DDD), a dynamic energy sharing mechanism (ESM), and an
environment-sensitive adaptive step size (EAS). The algorithm's mathematical
modeling is complete and rich in formulas. A detailed pseudocode implementation
framework is provided, facilitating theoretical analysis and subsequent applications.

SOA has the following features and advantages:

Strong population diversity protection: The dynamic energy sharing mechanism

ensures that low-energy individuals can still participate in the search, reducing the
risk of early convergence and improving overall search stability.

Good balance between local refined search and global exploration: The two-tier
decision delay mechanism achieves an effective combination of local refined search
and global jump exploration through short-term fine-tuning and long-term policy
updates.

Strong adaptability: The environment-sensitive adaptive step size mechanism enables

the algorithm to automatically adjust the search step size based on local gradient
changes and neighborhood distribution, eliminating the need for manual parameter
10 F. Author and S. Author

tuning. This makes it highly adaptable to complex high-dimensional optimization

problems.

High theoretical value and innovation: The integration of sloth behavioral

characteristics with swarm intelligence optimization algorithms forms a unique
optimization framework, providing new insights into algorithm design and scalable to
multi-objective, multi-swarm optimization research.

SOA can be widely applied to continuous optimization, combinatorial optimization,

and engineering optimization problems, and provides a new theoretical foundation
and application demonstration for metaheuristic optimization algorithm research.
Through behaviorally inspired mechanism design, SOA not only improves the
efficiency and stability of algorithms in complex search spaces, but also expands the
design of swarm intelligence algorithms, providing a new perspective and innovative
approach to theoretical research on optimization algorithms.

References
1. Fu, Y., Liu, D., Chen, J., & He, L. (2024). Secretary bird optimization algorithm: a new
metaheuristic for solving global optimization problems. Artificial Intelligence Review,
57(5), 123.
2. Oladejo, S. O., Ekwe, S. O., & Mirjalili, S. (2024). The Hiking Optimization Algorithm: A
novel human-based metaheuristic approach. Knowledge-Based Systems, 296, 111880.
3. Srivastava, A., & Das, D. K. (2022). Criminal search optimization algorithm: a population-
based meta-heuristic optimization technique to solve real-world optimization problems.
Arabian Journal for Science and Engineering, 47(3), 3551-3571.
4. Zafar, M. H., Khan, N. M., Mirza, A. F., Mansoor, M., Akhtar, N., Qadir, M. U., ... &
Moosavi, S. K. R. (2021). A novel meta-heuristic optimization algorithm based MPPT
control technique for PV systems under complex partial shading condition. Sustainable
Energy Technologies and Assessments, 47, 101367.
5. Xi, B., Huang, Z., Al-Obaidi, S., & Ferrara, L. (2023). Predicting ultra high-performance
concrete self-healing performance using hybrid models based on metaheuristic
optimization techniques. Construction and Building Materials, 381, 131261.
6. Balderas, D., Ortiz, A., Méndez, E., Ponce, P., & Molina, A. (2021). Empowering Digital
Twin for Industry 4.0 using metaheuristic optimization algorithms: case study PCB drilling
optimization. The International Journal of Advanced Manufacturing Technology, 113(5),
1295-1306.
7. Pan, J. S., Zhang, L. G., Wang, R. B., Snášel, V., & Chu, S. C. (2022). Gannet
optimization algorithm: A new metaheuristic algorithm for solving engineering
optimization problems. Mathematics and Computers in Simulation, 202, 343-373.
8. Hashim, F. A., & Hussien, A. G. (2022). Snake Optimizer: A novel meta-heuristic
optimization algorithm. Knowledge-Based Systems, 242, 108320.
9. Abdel-Basset, M., Mohamed, R., Jameel, M., & Abouhawwash, M. (2023). Spider wasp
optimizer: A novel meta-heuristic optimization algorithm. Artificial Intelligence Review,
56(10), 11675-11738.
 Contribution Title (shortened if too long) 11

10. Zhang, J. (2025). ACP-MO: A Novel Metaheuristic Optimization Algorithm Based on an

Advanced Ceramic Processing Metaphor for Optimization. Applied Engineering Letters,
10(2), 109-124. [Link]
11. Agushaka, J. O., Ezugwu, A. E., & Abualigah, L. (2023). Gazelle optimization algorithm:
a novel nature-inspired metaheuristic optimizer. Neural Computing and Applications,
35(5), 4099-4131.
12. El-Kenawy, E. S. M., Abdelhamid, A. A., Ibrahim, A., Mirjalili, S., Khodadad, N.,
Alduailij, M. A., ... & Khafaga, D. S. (2023). Al-Biruni Earth Radius (BER) Metaheuristic
Search Optimization Algorithm. Comput. Syst. Sci. Eng., 45(2), 1917-1934.
13. Abualigah, 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
& Industrial Engineering, 157, 107250.
14. Gupta, S., Abderazek, H., Yıldız, B. S., Yildiz, A. R., Mirjalili, S., & Sait, S. M. (2021).
Comparison of metaheuristic optimization algorithms for solving constrained mechanical
design optimization problems. Expert Systems with Applications, 183, 115351.
15. Javed, M. F., Siddiq, B., Onyelowe, K., Khan, W. A., & Khan, M. (2024). Metaheuristic
optimization algorithms-based prediction modeling for titanium dioxide-assisted
photocatalytic degradation of air contaminants. Results in Engineering, 23, 102637.
16. Zhang, J., & Zhang, J. (2025). Duck Foraging Algorithm (DFA): A Metaheuristic
Algorithm Inspired by Duck Foraging. Control Systems and Optimization Letters, 3(2),
228-233. [Link]
17. Tian, Z., & Gai, M. (2024). Football team training algorithm: A novel sport-inspired meta-
heuristic optimization algorithm for global optimization. Expert Systems with
Applications, 245, 123088.
18. Cikan, M., & Kekezoglu, B. (2022). Comparison of metaheuristic optimization techniques
including Equilibrium optimizer algorithm in power distribution network reconfiguration.
Alexandria Engineering Journal, 61(2), 991-1031.
19. Zhou, J., Shen, X., Qiu, Y., Shi, X., & Khandelwal, M. (2022). Cross-correlation stacking-
based microseismic source location using three metaheuristic optimization algorithms.
Tunnelling and Underground Space Technology, 126, 104570.
20. Sultan, H. M., Menesy, A. S., Alqahtani, M., Khalid, M., & Diab, A. A. Z. (2023).
Accurate parameter identification of proton exchange membrane fuel cell models using
different metaheuristic optimization algorithms. Energy Reports, 10, 4824-4848.
21. Li, J., Li, C., & Zhang, S. (2022). Application of Six Metaheuristic Optimization
Algorithms and Random Forest in the uniaxial compressive strength of rock prediction.
Applied Soft Computing, 131, 109729.
22. Matoušová, I., Trojovský, P., Dehghani, M., Trojovská, E., & Kostra, J. (2023). Mother
optimization algorithm: A new human-based metaheuristic approach for solving
engineering optimization. Scientific Reports, 13(1), 10312.
23. Ayyarao, T. S., Ramakrishna, N. S. S., Elavarasan, R. M., Polumahanthi, N., Rambabu,
M., Saini, G., ... & Alatas, B. (2022). War strategy optimization algorithm: a new effective
metaheuristic algorithm for global optimization. Ieee Access, 10, 25073-25105.
24. Ghani, S., & Kumari, S. (2022). Liquefaction behavior of Indo-Gangetic region using
novel metaheuristic optimization algorithms coupled with artificial neural network.
Natural Hazards, 111(3), 2995-3029.
25. Altay, E. V., Gurgenc, E., Altay, O., & Dikici, A. (2022). Hybrid artificial neural network
based on a metaheuristic optimization algorithm for the prediction of reservoir temperature
using hydrogeochemical data of different geothermal areas in Anatolia (Turkey).
Geothermics, 104, 102476.
12 F. Author and S. Author

26. Desuky, A. S., Cifci, M. A., Kausar, S., Hussain, S., & El Bakrawy, L. M. (2022). Mud
Ring Algorithm: A new meta-heuristic optimization algorithm for solving mathematical
and engineering challenges. IEEE Access, 10, 50448-50466.
27. Abualigah, L., Almotairi, K. H., & Elaziz, M. A. (2023). Multilevel thresholding image
segmentation using meta-heuristic optimization algorithms: Comparative analysis, open
challenges and new trends. Applied Intelligence, 53(10), 11654-11704.
28. Mahajan, S., Abualigah, L., Pandit, A. K., Al Nasar, M. R., Alkhazaleh, H. A., & Altalhi,
M. (2022). Fusion of modern meta-heuristic optimization methods using arithmetic
optimization algorithm for global optimization tasks. Soft Computing, 26(14), 6749-6763.
29. Tran-Ngoc, H., Khatir, S., Ho-Khac, H., De Roeck, G., Bui-Tien, T., & Wahab, M. A.
(2021). Efficient Artificial neural networks based on a hybrid metaheuristic optimization
algorithm for damage detection in laminated composite structures. Composite Structures,
262, 113339.
30. Pluhacek, M., Kazikova, A., Kadavy, T., Viktorin, A., & Senkerik, R. (2023, July).
Leveraging large language models for the generation of novel metaheuristic optimization
algorithms. In Proceedings of the Companion Conference on Genetic and Evolutionary
Computation (pp. 1812-1820).
31. Zhang, J., Jantakoon, T., Laoha, R., & Limpinan, P. (2025). PHUA: A phone-handling
user algorithm inspired by human mobile usage behavior for global optimization. Buletin
Ilmiah Sarjana Teknik Elektro, 7(2), 242–252. [Link]
32. Akinola, O. O., Ezugwu, A. E., Agushaka, J. O., Zitar, R. A., & Abualigah, L. (2022).
Multiclass feature selection with metaheuristic optimization algorithms: a review. Neural
Computing and Applications, 34(22), 19751-19790.
33. Suresh, V., Janik, P., Jasinski, M., Guerrero, J. M., & Leonowicz, Z. (2023). Microgrid
energy management using metaheuristic optimization algorithms. Applied Soft
Computing, 134, 109981.
34. Grisales-Noreña, L. F., Ocampo-Toro, J. A., Montoya-Giraldo, O. D., Montano, J., &
Hernandéz, J. C. (2023). Optimal operation of battery storage systems in standalone and
grid-connected DC microgrids using parallel metaheuristic optimization algorithms.
Journal of Energy Storage, 65, 107240.
35. Talatahari, S., Azizi, M., Tolouei, M., Talatahari, B., & Sareh, P. (2021). Crystal structure
algorithm (CryStAl): a metaheuristic optimization method. IEEE Access, 9, 71244-71261.
36. Chen, D., Ge, Y., Wan, Y., Deng, Y., Chen, Y., & Zou, F. (2022). Poplar optimization
algorithm: A new meta-heuristic optimization technique for numerical optimization and
image segmentation. Expert Systems with Applications, 200, 117118.
37. Zhang, J. Introducing CCOA (Clothing Context-Aware Optimization Algorithm): A Novel
Metaheuristic Approach for Context-Aware Multi-Objective Optimization. change, 1, 8.
[Link]
38. Mohammadzadeh, A., Masdari, M., Gharehchopogh, F. S., & Jafarian, A. (2021). A hybrid
multi-objective metaheuristic optimization algorithm for scientific workflow scheduling.
Cluster Computing, 24(2), 1479-1503.
39. Özbay, F. A. (2023). A modified seahorse optimization algorithm based on chaotic maps
for solving global optimization and engineering problems. Engineering Science and
Technology, an International Journal, 41, 101408.
40. Minh, H. L., Sang-To, T., Khatir, S., Wahab, M. A., & Cuong-Le, T. (2023). Damage
identification in high-rise concrete structures using a bio-inspired meta-heuristic
optimization algorithm. Advances in Engineering Software, 176, 103399.
 Contribution Title (shortened if too long) 13

41. Rodriguez, M., Arcos – Aviles, D., & Martinez, W. (2023). Fuzzy logic-based energy
management for isolated microgrid using meta-heuristic optimization algorithms. Applied
Energy, 335, 120771.

View publication stats