Self-adaptive differential evolution based multi-objective optimization incorporating local search and indicator-based selection

1Citations
Citations of this article
1Readers
Mendeley users who have this article in their library.
Get full text

Abstract

As an efficient and effective evolutionary algorithm, Differential evolution (DE) has received ever-increasing attention over recent years. However, how to make DE suitable for multi-objective optimization is still worth further studying. Moreover, various means from different perspectives are promising to promote the performance of the algorithm. In this study, we propose a novel multi-objective evolutionary algorithm, ILSDEMO, which incorporates indicator-based selection and local search with a self-adaptive DE. In this algorithm, we also use orthogonal design to initialize the population. In addition, the k-nearest neighbor rule is employed to eliminate the most crowded solution while a new solution is ready to join the archive population. The performance of ILSDEMO is investigated on three test instances in terms of three indicators. Compared with NSGAII, IBEA, and DEMO, the results indicate that ILSDEMO can approximate the true Pareto front more accurately and evenly. © 2012 Springer-Verlag.

Cite

CITATION STYLE

APA

Xie, D., Ding, L., Wang, S., Guo, Z., Hu, Y., & Xie, C. (2012). Self-adaptive differential evolution based multi-objective optimization incorporating local search and indicator-based selection. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7389 LNCS, pp. 25–33). https://doi.org/10.1007/978-3-642-31588-6_4

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free