2015
DOI: 10.1007/s10589-015-9774-0
|View full text |Cite
|
Sign up to set email alerts
|

The directed search method for multi-objective memetic algorithms

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
11
0

Year Published

2018
2018
2020
2020

Publication Types

Select...
4
3
2
1

Relationship

1
9

Authors

Journals

citations
Cited by 45 publications
(11 citation statements)
references
References 34 publications
0
11
0
Order By: Relevance
“…Since convergence rates can be relatively slow for MOEAs, they can be coupled with locally fast methods close to the Pareto set. These approaches are known as memetic algorithms; see, e.g., [23][24][25][26].…”
Section: Solution Methodsmentioning
confidence: 99%
“…Since convergence rates can be relatively slow for MOEAs, they can be coupled with locally fast methods close to the Pareto set. These approaches are known as memetic algorithms; see, e.g., [23][24][25][26].…”
Section: Solution Methodsmentioning
confidence: 99%
“…Since convergence rates can be relatively slow for MOEAs, they can be coupled with locally fast methods close to the Pareto set. These approaches are known as memetic algorithms, see, e.g., [23][24][25][26].…”
Section: Solution Methodsmentioning
confidence: 99%
“…Since convergence rates can be relatively slow for MOEAs, they can be coupled with locally fast methods close to the Pareto set. These approaches are known as memetic algorithms, see, e.g., [19][20][21].…”
Section: Solution Methodsmentioning
confidence: 99%