2009
DOI: 10.1007/s12293-009-0028-5
|View full text |Cite
|
Sign up to set email alerts
|

Hybrid immune algorithm with Lamarckian local search for multi-objective optimization

Abstract: Lamarckian learning has been introduced into evolutionary computation as local search mechanism. The relevant research topic, memetic computation, has received significant amount of interests. In this study, a novel Lamarckian learning strategy is designed for improving the Nondominated Neighbor Immune Algorithm, a novel hybrid multi-objective optimization algorithm, Multi-objective Lamarckian Immune Algorithm (MLIA), is proposed. The Lamarckian learning performs a greedy search which proceeds towards the goal… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
9
0
1

Year Published

2010
2010
2018
2018

Publication Types

Select...
4
3
1

Relationship

1
7

Authors

Journals

citations
Cited by 21 publications
(10 citation statements)
references
References 48 publications
0
9
0
1
Order By: Relevance
“…In the last part of the paper genetic algorithm is used to search for the appropriate line of symmetry of all data sets. Future works include application of some multiobjective optimization techniques [23][24][25][26][27] to find out the line symmetric clusters from the data sets.…”
Section: Discussionmentioning
confidence: 99%
“…In the last part of the paper genetic algorithm is used to search for the appropriate line of symmetry of all data sets. Future works include application of some multiobjective optimization techniques [23][24][25][26][27] to find out the line symmetric clusters from the data sets.…”
Section: Discussionmentioning
confidence: 99%
“…A local optimization can quickly find the local optimum of a small region within the search space, but it is typically poor in global search. 20 Therefore, a hybrid multi-objective algorithm, called Multi-objective Lamarckian Immune Algorithm (MLIA), 20 is implemented. MLIA performs an excellent global exploration characteristics of EAs, meanwhile it also takes a greedy local search along the direction obtained by Chebyshev approach, 21 so improved decision vectors can be generated, that is, the individual will be locally optimized and the nearby areas of the non-dominated individuals in less-crowded regions of the current Pareto-optimal front are further exploited.…”
Section: Multi-objective Optimizationmentioning
confidence: 99%
“…x n (Tsai et al 2010;Gong et al 2010;Tripathi et al 2007) Table 1 lists descriptions of three test functions: SCH (Schaffer 1985), KUR (Kursawe 1991), and ZDT2 (Zitzler et al 2000). Zitzler et al (2000) introduced three major evaluation targets as performance level indicators for algorithms:…”
Section: Test Function and Performance Indicatormentioning
confidence: 99%
“…Tsai et al 2010;Gong et al 2010;Rodr铆guez et al 2009)Gong et al 2010;Wang et al 2009;Salazar-Lechuga, …”
unclassified