Improved strategies and researches of NSGA-II algorithm
Wanru Lin
Abstract
Wanru Lin
Abstract
Non-dominated Sorting Genetic Algorithm with elitism(NSGA-Ⅱ) is widely used in multi-objective optimization fields.Uneven distribution of population convergence,poor performance in global search and low running efficiency of this algorithm are analyzed in this paper.Four improved strategies are proposed according to these limitations:improved sorting strategy,arithmetic cross operator strategy,sorting rank according to the demand strategy and selecting strategy with the given threshold.The simulations prove that the non-dominated Pareto optimal solutions have better distribution and faster convergence at the same time in typical functions.
OpenAlex reports 1 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
Non-dominated Sorting Genetic Algorithm with elitism(NSGA-Ⅱ) is widely used in multi-objective optimization fields.Uneven distribution of population convergence,poor performance in global search and low running efficiency of this algorithm are analyzed in this paper.Four improved strategies are proposed according to these limitations:improved sorting strategy,arithmetic cross operator strategy,sorting rank according to the demand strategy and selecting strategy with the given threshold.The simulations prove that the non-dominated Pareto optimal solutions have better distribution and faster convergence at the same time in typical functions.
Key concepts: Sorting, Mathematical optimization, Convergence (economics), Population, Genetic algorithm, Computer science, Sorting algorithm, Elitism