2021
DOI: 10.3390/app11031286
|View full text |Cite
|
Sign up to set email alerts
|

Binary Spring Search Algorithm for Solving Various Optimization Problems

Abstract: One of the most powerful tools for solving optimization problems is optimization algorithms (inspired by nature) based on populations. These algorithms provide a solution to a problem by randomly searching in the search space. The design’s central idea is derived from various natural phenomena, the behavior and living conditions of living organisms, laws of physics, etc. A new population-based optimization algorithm called the Binary Spring Search Algorithm (BSSA) is introduced to solve optimization problems. … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
4
1

Citation Types

0
36
0

Year Published

2021
2021
2023
2023

Publication Types

Select...
9

Relationship

3
6

Authors

Journals

citations
Cited by 38 publications
(36 citation statements)
references
References 72 publications
0
36
0
Order By: Relevance
“…However, this model has several considerable shortcomings, such as inconsistent architectures for different applications, coupled with the process required to tune and fit a neural network, which is a time-consuming procedure that is largely based on trial and error [27,28]. Conventionally, ANNs have been fitted using a backpropagation (BP) algorithm; however, state-of-the-art approaches using bio-inspired, metaheuristic, optimization algorithms have become increasingly prevalent, including the genetic algorithm (GA) [29], particle swarm optimization (PSO) [30], ant lion optimization (ALO) [31], spotted hyena optimizer (SHO) [32], binary spring search algorithm (BSSA) [33], grey wolf algorithm (GWO) [34], genetic optimization resampling based particle filtering (GORPF) algorithm [35], and ant colony optimization (ACO) [16]-all of which may be hybridized with ANNs to address the aforementioned disadvantages.…”
Section: Introductionmentioning
confidence: 99%
“…However, this model has several considerable shortcomings, such as inconsistent architectures for different applications, coupled with the process required to tune and fit a neural network, which is a time-consuming procedure that is largely based on trial and error [27,28]. Conventionally, ANNs have been fitted using a backpropagation (BP) algorithm; however, state-of-the-art approaches using bio-inspired, metaheuristic, optimization algorithms have become increasingly prevalent, including the genetic algorithm (GA) [29], particle swarm optimization (PSO) [30], ant lion optimization (ALO) [31], spotted hyena optimizer (SHO) [32], binary spring search algorithm (BSSA) [33], grey wolf algorithm (GWO) [34], genetic optimization resampling based particle filtering (GORPF) algorithm [35], and ant colony optimization (ACO) [16]-all of which may be hybridized with ANNs to address the aforementioned disadvantages.…”
Section: Introductionmentioning
confidence: 99%
“…Moreover, the results obtained by BSSA are compared with other standard binary algorithms, namely the grasshopper mechanism, bat algorithm, etc. [20]. The mobile-agent-based system, introduced for IPPS in NMS to prove the consistency of the proposed model comparison, was made with the Controlled Elitist Non-dominated sorting GA [21].…”
Section: Literature Reviewmentioning
confidence: 99%
“…The goal in optimization is to determine the values of the variables according to the constraints in order to optimize the objective functions [1]. Population-based optimization algorithms are one of the most widely used methods in solving optimization problems that search the problem-solving space using random operators [2].…”
Section: Introductionmentioning
confidence: 99%