2023
DOI: 10.1016/j.swevo.2023.101289
|View full text |Cite
|
Sign up to set email alerts
|

On the elusivity of dynamic optimisation problems

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2024
2024
2024
2024

Publication Types

Select...
1

Relationship

0
1

Authors

Journals

citations
Cited by 1 publication
(1 citation statement)
references
References 51 publications
(124 reference statements)
0
1
0
Order By: Relevance
“…Recently, research has indicated that simplistic, simple restarts of the optimizer or plainly specialized optimization algorithms might be sufficient to solve many dynamic optimization problems [36]. We therefore include a GA geared toward static optimization problems in our analysis.…”
Section: Open-ended Evolutionary Algorithmsmentioning
confidence: 99%
“…Recently, research has indicated that simplistic, simple restarts of the optimizer or plainly specialized optimization algorithms might be sufficient to solve many dynamic optimization problems [36]. We therefore include a GA geared toward static optimization problems in our analysis.…”
Section: Open-ended Evolutionary Algorithmsmentioning
confidence: 99%