TY - JOUR
T1 - Archery Algorithm
T2 - A Novel Stochastic Optimization Algorithm for Solving Optimization Problems
AU - Zeidabadi, Fatemeh Ahmadi
AU - Dehghani, Mohammad
AU - Trojovský, Pavel
AU - Hubálovský, Štěpán
AU - Leiva, Victor
AU - Dhiman, Gaurav
N1 - Publisher Copyright:
© 2022 Tech Science Press. All rights reserved.
PY - 2022
Y1 - 2022
N2 - Finding a suitable solution to an optimization problem designed in science is a major challenge. Therefore, these must be addressed utilizing proper approaches. Based on a random search space, optimization algorithms can find acceptable solutions to problems. Archery Algorithm (AA) is a new stochastic approach for addressing optimization problems that is discussed in this study. The fundamental idea of developing the suggested AA is to imitate the archer’s shooting behavior toward the target panel. The proposed algorithm updates the location of each member of the population in each dimension of the search space by a member randomly marked by the archer. The AA is mathematically described, and its capacity to solve optimization problems is evaluated on twenty-three distinct types of objective functions. Furthermore, the proposed algorithm’s performance is compared vs. eight approaches, including teaching-learning based optimization, marine predators algorithm, genetic algorithm, grey wolf optimization, particle swarm optimization, whale optimization algorithm, gravitational search algorithm, and tunicate swarm algorithm. According to the simulation findings, the AA has a good capacity to tackle optimization issues in both unimodal and multimodal scenarios, and it can give adequate quasi-optimal solutions to these problems. The analysis and comparison of competing algorithms’ performance with the proposed algorithm demonstrates the superiority and competitiveness of the AA.
AB - Finding a suitable solution to an optimization problem designed in science is a major challenge. Therefore, these must be addressed utilizing proper approaches. Based on a random search space, optimization algorithms can find acceptable solutions to problems. Archery Algorithm (AA) is a new stochastic approach for addressing optimization problems that is discussed in this study. The fundamental idea of developing the suggested AA is to imitate the archer’s shooting behavior toward the target panel. The proposed algorithm updates the location of each member of the population in each dimension of the search space by a member randomly marked by the archer. The AA is mathematically described, and its capacity to solve optimization problems is evaluated on twenty-three distinct types of objective functions. Furthermore, the proposed algorithm’s performance is compared vs. eight approaches, including teaching-learning based optimization, marine predators algorithm, genetic algorithm, grey wolf optimization, particle swarm optimization, whale optimization algorithm, gravitational search algorithm, and tunicate swarm algorithm. According to the simulation findings, the AA has a good capacity to tackle optimization issues in both unimodal and multimodal scenarios, and it can give adequate quasi-optimal solutions to these problems. The analysis and comparison of competing algorithms’ performance with the proposed algorithm demonstrates the superiority and competitiveness of the AA.
KW - Archer
KW - Meta-heuristic algorithm
KW - Population-based algorithm
KW - Population-based optimization
KW - Stochastic programming
KW - Swarm intelligence
KW - Wilcoxon statistical test
UR - http://www.scopus.com/inward/record.url?scp=85125854487&partnerID=8YFLogxK
U2 - 10.32604/cmc.2022.024736
DO - 10.32604/cmc.2022.024736
M3 - Article
AN - SCOPUS:85125854487
SN - 1546-2218
VL - 72
SP - 399
EP - 416
JO - Computers, Materials and Continua
JF - Computers, Materials and Continua
IS - 1
ER -