2019
DOI: 10.21123/bsj.2019.16.2(si).0445
|View full text |Cite
|
Sign up to set email alerts
|

Taxonomy of Memory Usage in Swarm Intelligence-Based Metaheuristics

Abstract: Metaheuristics under the swarm intelligence (SI) class have proven to be efficient and have become popular methods for solving different optimization problems. Based on the usage of memory, metaheuristics can be classified into algorithms with memory and without memory (memory-less). The absence of memory in some metaheuristics will lead to the loss of the information gained in previous iterations. The metaheuristics tend to divert from promising areas of solutions search spaces which will lead to non-optimal … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
4

Citation Types

0
2
0

Year Published

2023
2023
2024
2024

Publication Types

Select...
5

Relationship

0
5

Authors

Journals

citations
Cited by 6 publications
(4 citation statements)
references
References 34 publications
0
2
0
Order By: Relevance
“…Hence, It has been a research focus to maximize coverage of the region with a small number of sensor nodes, and Swarm Intelligence (SI) Algorithms, which can find an approximate solution to the optimization problem in an acceptable time 4 , provide a means to address the issue of WSN coverage optimization. Currently, SI has produced beneficial achievements in the area of WSN coverage optimization 5 .…”
Section: Introductionmentioning
confidence: 99%
“…Hence, It has been a research focus to maximize coverage of the region with a small number of sensor nodes, and Swarm Intelligence (SI) Algorithms, which can find an approximate solution to the optimization problem in an acceptable time 4 , provide a means to address the issue of WSN coverage optimization. Currently, SI has produced beneficial achievements in the area of WSN coverage optimization 5 .…”
Section: Introductionmentioning
confidence: 99%
“…FJSSP is intensely NP-hard 8 , and is a further complicated form of JSSP. Accordingly, the metaheuristic algorithms are the vital substitute to resolve this kind of problems which give an appropriate solution within a satisfactory time period 9,10 .…”
Section: Introductionmentioning
confidence: 99%
“…Combinatorial optimization algorithms allow solving a large number of practical problems, such as, for example, the traveling salesman problem, assignment problems, scheduling problems, building decision trees, the dimension of which can reach exponential. The authors of the articles [15][16][17] offer an overview of the main directions of metaheuristic approaches (local search, evolutionary algorithms) to solving combinatorial optimization problems. Metaheuristic algorithms in optimal content search problems have a wide range of tasks, including tasks related to model training, are an alternative solution for deep learning of a neural network, and solve the problems of model retraining 16 .…”
Section: Introductionmentioning
confidence: 99%