2016
DOI: 10.1007/s00500-016-2331-7
|View full text |Cite
|
Sign up to set email alerts
|

A stopping criterion for decomposition-based multi-objective evolutionary algorithms

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

0
4
0

Year Published

2017
2017
2023
2023

Publication Types

Select...
7

Relationship

0
7

Authors

Journals

citations
Cited by 11 publications
(4 citation statements)
references
References 26 publications
0
4
0
Order By: Relevance
“…Specific stopping criteria must be established to determine when a satisfactory solution has been reached. Common stopping conditions described in the literature include reaching a certain number of generations (𝐺 𝑛 ), reaching a threshold fitness value, or observing improvement over the iteration period [80]. This study used a fixed number of generations as the stopping criterion and concluded that the GA had elapsed after 800 generations.…”
Section: F Stopping Criteriamentioning
confidence: 99%
“…Specific stopping criteria must be established to determine when a satisfactory solution has been reached. Common stopping conditions described in the literature include reaching a certain number of generations (𝐺 𝑛 ), reaching a threshold fitness value, or observing improvement over the iteration period [80]. This study used a fixed number of generations as the stopping criterion and concluded that the GA had elapsed after 800 generations.…”
Section: F Stopping Criteriamentioning
confidence: 99%
“…Although different variants of MOEA/D are available in literature, a powerful single version of MOEA/D that integrates different advantages of the current versions is not yet in place. With the aim of developing an efficient version of MOEA/D for real-life problems, a powerful MOEA/D version is therefore developed in this study that is a combination of MOEA/D-DE [22], an adaptive replacement strategy [23], a stopping condition criterion [24], and a constraint-handling technique [25]. The general framework of MOEA/D is presented in Algorithm 1.…”
Section: Moea/d Algorithmmentioning
confidence: 99%
“…The general framework of MOEA/D is presented in Algorithm 1. For more details, readers are encouraged to refer to [22][23][24][25]32].…”
Section: Moea/d Algorithmmentioning
confidence: 99%
See 1 more Smart Citation