Improved NSGA-II Multi-objective Genetic Algorithm Based on Hybridization-encouraged Mechanism

Abstract To improve performances of multi-objective optimization algorithms, such as convergence and diversity, a hybridization- encouraged mechanism is proposed and realized in elitist nondominated sorting genetic algorithm (NSGA-II). This mechanism uses the normalized distance to evaluate the difference among genes in a population. Three possible modes of crossover operators—“Max Distance”, “Min-Max Distance”, and “Neighboring-Max”—are suggested and analyzed. The mode of “Neighboring-Max”, which not only takes advantage of hybridization but also improves the distribution of the population near Pareto optimal front, is chosen and used in NSGA-II on the basis of hybridization-encouraged mechanism (short for HEM-based NSGA-II). To prove the HEM-based algorithm, several problems are studied by using standard NSGA-II and the presented method. Different evaluation criteria are also used to judge these algorithms in terms of distribution of solutions, convergence, diversity, and quality of solutions. The numerical results indicate that the application of hybridization-encouraged mechanism could effectively improve the performances of genetic algorithm. Finally, as an example in engineering practices, the presented method is used to design a longitudinal flight control system, which demonstrates the obtainability of a reasonable and correct Pareto front.

[1]  Marco Laumanns,et al.  SPEA2: Improving the strength pareto evolutionary algorithm , 2001 .

[2]  Frank Kursawe,et al.  A Variant of Evolution Strategies for Vector Optimization , 1990, PPSN.

[3]  Kalyanmoy Deb,et al.  MULTI-OBJECTIVE FUNCTION OPTIMIZATION USING NON-DOMINATED SORTING GENETIC ALGORITHMS , 1994 .

[4]  Kalyanmoy Deb,et al.  A fast and elitist multiobjective genetic algorithm: NSGA-II , 2002, IEEE Trans. Evol. Comput..

[5]  Gary B. Lamont,et al.  Multiobjective evolutionary algorithms: classifications, analyses, and new innovations , 1999 .

[6]  Carlos A. Coello Coello,et al.  An updated survey of evolutionary multiobjective optimization techniques: state of the art and future trends , 1999, Proceedings of the 1999 Congress on Evolutionary Computation-CEC99 (Cat. No. 99TH8406).

[7]  R. Soland.  MULTICRITERIA OPTIMIZATION: A GENERAL CHARACTERIZATION OF EFFICIENT SOLUTIONS* , 1979 .

[8]  Kalyanmoy Deb,et al.  Muiltiobjective Optimization Using Nondominated Sorting in Genetic Algorithms , 1994, Evolutionary Computation.

[9]  Ling Xu,et al.  Research on Theory and Application of Multidisciplinary Design Optimization of Flight Vehicles , 2006 .

[10]  Kalyanmoy Deb,et al.  A Fast Elitist Non-dominated Sorting Genetic Algorithm for Multi-objective Optimisation: NSGA-II , 2000, PPSN.

[11]  Lothar Thiele,et al.  Multiobjective evolutionary algorithms: a comparative case study and the strength Pareto approach , 1999, IEEE Trans. Evol. Comput..

[12]  David E. Goldberg,et al.  A niched Pareto genetic algorithm for multiobjective optimization , 1994, Proceedings of the First IEEE Conference on Evolutionary Computation. IEEE World Congress on Computational Intelligence.

[13]  Kalyanmoy Deb,et al.  Running performance metrics for evolutionary multi-objective optimizations , 2002 .

[14]  A. Osyczka,et al.  A new method to solve generalized multicriteria optimization problems using the simple genetic algorithm , 1995 .

[15]  J. D. Schaffer,et al.  Some experiments in machine learning using vector evaluated genetic algorithms (artificial intelligence, optimization, adaptation, pattern recognition) , 1984 .

[16]  Peter J. Fleming,et al.  Multiobjective genetic algorithms made easy: selection sharing and mating restriction , 1995 .

[17]  S. S. Rao,et al.  Applications of fuzzy theories to multi-objective system optimization , 1991 .

[18]  Xin Yao,et al.  Performance Scaling of Multi-objective Evolutionary Algorithms , 2003, EMO.

[19]  Kalyanmoy Deb,et al.  Multi-objective Genetic Algorithms: Problem Difficulties and Construction of Test Problems , 1999, Evolutionary Computation.