Proceedings of the Genetic and Evolutionary Computation Conference 2018
DOI: 10.1145/3205455.3205466
|View full text |Cite
|
Sign up to set email alerts
|

Termination detection strategies in evolutionary algorithms

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1

Citation Types

0
3
0

Year Published

2019
2019
2025
2025

Publication Types

Select...
3
3
2

Relationship

2
6

Authors

Journals

citations
Cited by 13 publications
(3 citation statements)
references
References 47 publications
0
3
0
Order By: Relevance
“…In particular, two types of approaches seem to be worth exploring in this context: multimodal optimization methods (Li et al, 2017) and heuristic methods for constrained optimization (Kulkarni et al, 2021). On the other hand, optimization procedures that are employing different kinds of regularization (Liu et al, 2018) should be used very carefully. That is because their main strength, namely, to obtain any satisfactory solution as fast as possible, could do a disservice in the situation when we want to explore the variability of possible solutions.…”
Section: Figurementioning
confidence: 99%
“…In particular, two types of approaches seem to be worth exploring in this context: multimodal optimization methods (Li et al, 2017) and heuristic methods for constrained optimization (Kulkarni et al, 2021). On the other hand, optimization procedures that are employing different kinds of regularization (Liu et al, 2018) should be used very carefully. That is because their main strength, namely, to obtain any satisfactory solution as fast as possible, could do a disservice in the situation when we want to explore the variability of possible solutions.…”
Section: Figurementioning
confidence: 99%
“…They are all shown in Table II. Stop criteria are non-trivial for these methods, however, they are always different [40]. Therefore a maximum fitness evaluation and a time budget are both used for the termination detection.…”
Section: A Implementation Detailsmentioning
confidence: 99%
“…The main iteration of the algorithm is described in lines 6-14. While the stopping criteria are not met [24], the new candidate solution is generated with a search operator (line 9…”
Section: Algorithm Frameworkmentioning
confidence: 99%