An Improved Nondominated Sorting Genetic Algorithm for Multiobjective Problem

Citations of this article
Mendeley users who have this article in their library.


In this paper, an improved NSGA2 algorithm is proposed, which is used to solve the multiobjective problem. For the original NSGA2 algorithm, the paper made one improvement: joining the local search strategy into the NSGA2 algorithm. After each iteration calculation of the NSGA2 algorithm, a kind of local search strategy is performed in the Pareto optimal set to search better solutions, such that the NSGA2 algorithm can gain a better local search ability which is helpful to the optimization process. Finally, the proposed modified NSGA2 algorithm (MNSGA2) is simulated in the two classic multiobjective problems which is called KUR problem and ZDT3 problem. The calculation results show the modified NSGA2 outperforms the original NSGA2, which indicates that the improvement strategy is helpful to improve the algorithm.




Wang, R. (2016). An Improved Nondominated Sorting Genetic Algorithm for Multiobjective Problem. Mathematical Problems in Engineering, 2016.

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