2013
DOI: 10.1016/j.ins.2012.11.017
|View full text |Cite
|
Sign up to set email alerts
|

Parallel memetic structures

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
56
0

Year Published

2013
2013
2020
2020

Publication Types

Select...
6
3
1

Relationship

8
2

Authors

Journals

citations
Cited by 99 publications
(56 citation statements)
references
References 48 publications
0
56
0
Order By: Relevance
“…In particular, a coordination of multiple local search components is used to tackle LSOPs in (23). This logic, a part or a modification of it has been coupled and integrated within other algorithmic frameworks in (24), (25), (26), (27), and (28). It must be remarked that these algorithms tend to use a simple local search component that exploits the decision space by perturbing the candidate solution along the axes.…”
Section: Introductionmentioning
confidence: 99%
“…In particular, a coordination of multiple local search components is used to tackle LSOPs in (23). This logic, a part or a modification of it has been coupled and integrated within other algorithmic frameworks in (24), (25), (26), (27), and (28). It must be remarked that these algorithms tend to use a simple local search component that exploits the decision space by perturbing the candidate solution along the axes.…”
Section: Introductionmentioning
confidence: 99%
“…It should also be noted that the DE/rand/1 has been proved to be efficient to improve the algorithm's performances on complicated MOPs, it helps the MOEA/D winning unconstrained multi-objective evolutionary algorithm competition in the congress of evolutionary computation (CEC 2009) [50] . Different from the above two operators, the LocalSearch1 in MTS for large scale global optimization searches along each axis of the decision space one by one rather than along the current PS [51][52][53] . This operator is a short distance exploration operator that can be seen as a modification of hill-descend search .…”
Section: Adaptive Genetic Operator Selection In Moea/dmentioning
confidence: 99%
“…In this paper, the initial local search is performed by the so-called Short Distance Exploration or simply S algorithm, see [30], [31], and [32]. The S algorithm is a simple greedy local search that performs moves along the axes and halves its radius when it is unable to detect a better solution.…”
Section: B Super-fit Dementioning
confidence: 99%