2023
DOI: 10.3390/app13116628
|View full text |Cite
|
Sign up to set email alerts
|

An Advanced Crow Search Algorithm for Solving Global Optimization Problem

Abstract: The conventional crow search (CS) algorithm is a swarm-based metaheuristic algorithm that has fewer parameters, is easy to apply to problems, and is utilized in various fields. However, it has a disadvantage, as it is easy for it to fall into local minima by relying mainly on exploitation to find approximations. Therefore, in this paper, we propose the advanced crow search (ACS) algorithm, which improves the conventional CS algorithm and solves the global optimization problem. The ACS algorithm has three diffe… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
6
0

Year Published

2023
2023
2024
2024

Publication Types

Select...
4
1

Relationship

2
3

Authors

Journals

citations
Cited by 6 publications
(6 citation statements)
references
References 33 publications
0
6
0
Order By: Relevance
“…To further improve the hybrid algorithm, additional investigations are necessary to enhance the desired population distribution through hybridization. One possible direction is to apply adaptive CSA parameters (fl and AP), which will affect the exploitation and exploration performance of the algorithm [32][33][34].…”
Section: Numerical Resultsmentioning
confidence: 99%
See 1 more Smart Citation
“…To further improve the hybrid algorithm, additional investigations are necessary to enhance the desired population distribution through hybridization. One possible direction is to apply adaptive CSA parameters (fl and AP), which will affect the exploitation and exploration performance of the algorithm [32][33][34].…”
Section: Numerical Resultsmentioning
confidence: 99%
“…Finally, to improve CSA's performance, some authors have applied dynamic algorithm parameters. In [33], the authors proposed dynamic AP and fl, whose values change at each iteration of the algorithm. These dynamic parameters improved the exploitation and exploration performance of the algorithm compared to a set of competing metaheuristic algorithms, not only in the case of both unimodal and multimodal BTFs but also for five real engineering problems.…”
Section: Introductionmentioning
confidence: 99%
“…Table 2 shows the benchmark function used to compare the convergence performance according to parameter changes and the number of qubits used in each benchmark function [39,40]. Here, Min is the minimum value of the function, and t max is the maximum number of generations.…”
Section: Characteristics Of the Qbhs Algorithmmentioning
confidence: 99%
“…Metaheuristics algorithms, which are classified into four categories (Evolutionary, Swarm, Physics, and Human behavior) for imitated natural phenomena, are creating new fields that solve optimization problems by combining them with qubit characteristics [ 10 , 11 , 12 ]. The first case of combination with an evolutionary-based algorithm is the quantum-inspired genetic algorithm (QGA), proposed by Han and Kim in 2000 [ 13 ].…”
Section: Introductionmentioning
confidence: 99%
“…Quantum computers are characterized by being able to express various information at the same time, so they have the expectation that the operation speed is faster than existing computers (supercomputers) [9]. Metaheuristics algorithms, which are classified into four categories (Evolutionary, Swarm, Physics, and Human behavior) for imitated natural phenomena, are creating new fields that solve optimization problems by combining them with qubit characteristics [10][11][12]. The first case of combination with an evolutionary-based algorithm is the quantum-inspired genetic algorithm (QGA), proposed by Han and Kim in 2000 [13].…”
Section: Introductionmentioning
confidence: 99%