2019
DOI: 10.1504/ijbic.2019.10018955
|View full text |Cite
|
Sign up to set email alerts
|

A review of techniques for online control of parameters in swarm intelligence and evolutionary computation algorithms

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
2

Citation Types

0
7
0

Year Published

2021
2021
2024
2024

Publication Types

Select...
2
2
1
1

Relationship

0
6

Authors

Journals

citations
Cited by 9 publications
(7 citation statements)
references
References 0 publications
0
7
0
Order By: Relevance
“…Being gradient‐free and population‐based, these algorithms find optimal and multiple near‐optimal solutions of complex problems that otherwise would be hard to obtain using traditional optimization methods. [ 24,153 ] The involvement of heuristics and populations of candidates can, however, be time‐consuming in obtaining solutions. [ 5 ]…”
Section: Common Ai‐based Process Control Technologiesmentioning
confidence: 99%
See 2 more Smart Citations
“…Being gradient‐free and population‐based, these algorithms find optimal and multiple near‐optimal solutions of complex problems that otherwise would be hard to obtain using traditional optimization methods. [ 24,153 ] The involvement of heuristics and populations of candidates can, however, be time‐consuming in obtaining solutions. [ 5 ]…”
Section: Common Ai‐based Process Control Technologiesmentioning
confidence: 99%
“…[ 159 ] Memetic algorithms [ 160 ] and differential evolution algorithm [ 161 ] are variants of GAs that include additional domain‐specific search heuristics. [ 24 ] On the other hand, PSO algorithms move or transform candidates using formulas based on the best‐known positions of individual candidates as well as the swarm or population in the search domain. Similarly, ACO algorithms mimic ants in finding the solution as the optimum cost path in the search domain.…”
Section: Common Ai‐based Process Control Technologiesmentioning
confidence: 99%
See 1 more Smart Citation
“…Meta-heuristic algorithms heavily rely on the values of their parameters, and finding appropriate parameter settings is a complex task that has received a lot of attention. There are two main approaches to parameter tuning: offline (Eryoldaş and Durmuşoglu, 2022) and online (Parpinelli et al, 2019) procedures. Offline tuning (Eryoldaş and Durmuşoglu, 2022) aims to find suitable parameter settings before deploying the algorithm, but traditionally it has been done through trial and error, which is time-consuming, error-prone, and uneven across different algorithms.…”
Section: Introductionmentioning
confidence: 99%
“…However, these methods typically provide a fixed parameter setting for a particular instance. An alternative approach is online tuning (Parpinelli et al, 2019), which involves modifying the parameter settings while solving a problem instance. This approach has the potential advantage of adapting better to the particular instance's characteristics and identifying the best settings for exploratory and exploitative search phases.…”
Section: Introductionmentioning
confidence: 99%