A novel diversity maintenance scheme for evolutionary multi-objective optimization

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

Abstract

Recently, decomposition-based multi-objective evolutionary algorithm (MOEA/D) has received increasing attentions due to its simplicity and decent optimization performance. In the presence of the deceptive optimum, the weight vector approach used in MOEA/D may not be able to prevent the population traps into local optimum. In this paper, we propose a new algorithm, namely Diversity Preservation Multi-objective Evolutionary Algorithm based on Decomposition (DivPre-MOEA/D), which uses novel diversity maintenance scheme to enhance the performance of MOEA/D. The proposed algorithm relaxes the dependency of the weight vector approach on approximated ideal vector to maintain diversity of the population. The proposed algorithm is evaluated on CEC-09 test suite and compared the optimization performance with MOEA/D. The experiment results show that DivPre-MOEA/D can provide better solutions spread along the Pareto front. © 2013 Springer-Verlag.

Cite

CITATION STYLE

APA

Gee, S. B., Qiu, X., & Tan, K. C. (2013). A novel diversity maintenance scheme for evolutionary multi-objective optimization. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8206 LNCS, pp. 270–277). https://doi.org/10.1007/978-3-642-41278-3_33

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