中文摘要：

Multi-objective optimization is a new focus of evolutionary computation research. This paper puts forward a new algorithm, which can not only converge quickly, but also keep diversity among population efficiently, in order to find the Pareto-optimal set. This new algorithm replaces the worst individual with a newly-created one by "multi-parent crossover" , so that the population could converge near the true Pareto-optimal solutions in the end. At the same time, this new algorithm adopts niching and fitness-sharing techniques to keep the population in a good distribution. Numerical experiments show that the algorithm is rather effective in solving some Benchmarks. No matter whether the Pareto front of problems is convex or non-convex, continuous or discontinuous, and the problems are with constraints or not, the program turns out to do well.