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

被引:3
|
作者
Sun Yijie [1 ]
Shen Gongzhang [1 ]
机构
[1] Beijing Univ Aeronaut & Astronaut, Sch Automat Sci & Elect Engn, Beijing 100191, Peoples R China
关键词
multi-objective optimization; genetic algorithms; diversity; hybridization; crossover;
D O I
暂无
中图分类号
V [航空、航天];
学科分类号
08 ; 0825 ;
摘要
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.
引用
收藏
页码:540 / 549
页数:10
相关论文
共 50 条
  • [2] Improved NSGA-Ⅱ Multi-objective Genetic Algorithm Based on Hybridization-encouraged Mechanism
    Sun YijieShen Gongzhang School of Automation Science and Electrical EngineeringBeijing University of Aeronautics and AstronauticsBeijing China
    [J]. Chinese Journal of Aeronautics., 2008, 21 (06) - 549
  • [3] A improved NSGA-II algorithm for constrained multi-objective optimization problems
    Wang, Maocai
    Wu, Yun
    Dai, Guangming
    Hu, Hanping
    [J]. PROGRESS IN INTELLIGENCE COMPUTATION AND APPLICATIONS, PROCEEDINGS, 2007, : 117 - 119
  • [4] Multi-objective optimization of integrated energy system based on improved NSGA-II algorithm
    Mei, Rui
    Wu, Tao
    Geng, Deji
    Zhang, Minzi
    Liu, Yanan
    Qian, Xusheng
    Sun, Yonghui
    [J]. PROCEEDINGS OF THE 39TH CHINESE CONTROL CONFERENCE, 2020, : 1721 - 1726
  • [5] Multi-objective classification based on NSGA-II
    Zhao, Binping
    Xue, Yu
    Xu, Bin
    Ma, Tinghuai
    Liu, Jingfa
    [J]. INTERNATIONAL JOURNAL OF COMPUTING SCIENCE AND MATHEMATICS, 2018, 9 (06) : 539 - 546
  • [6] Multi-objective Optimization Scheduling Model Based on NSGA-II Algorithm
    Bian, Ruifeng
    Tan, Wenyi
    Li, Yilun
    Hou, Yichen
    [J]. 2020 IEEE THE 3RD INTERNATIONAL CONFERENCE ON ELECTRONICS AND COMMUNICATION ENGINEERING (ICECE), 2020, : 149 - 156
  • [7] Multi-Objective Network Coding Optimization Based On NSGA-II Algorithm
    Hao, Kun
    Wang, Beibei
    Luo, Yongmei
    [J]. 2012 INTERNATIONAL CONFERENCE ON CONTROL ENGINEERING AND COMMUNICATION TECHNOLOGY (ICCECT 2012), 2012, : 843 - 846
  • [8] Research on multi-objective optimization of switched flux motor based on improved NSGA-II algorithm
    Jin, Liying
    Zhao, Shengdun
    Du, Wei
    Yang, Xuesong
    Wang, Wensheng
    Yang, Yuhang
    [J]. PROCEEDINGS OF THE INSTITUTION OF MECHANICAL ENGINEERS PART E-JOURNAL OF PROCESS MECHANICAL ENGINEERING, 2019, 233 (06) : 1268 - 1279
  • [9] An Improved NSGA-II to Solve Multi-Objective Optimization Problem
    Fu, Yaping
    Huang, Min
    Wang, Hongfeng
    Jiang, Guanjie
    [J]. 26TH CHINESE CONTROL AND DECISION CONFERENCE (2014 CCDC), 2014, : 1037 - 1040
  • [10] Multi-objective optimization for materials design with improved NSGA-II
    Zhang, Peng
    Qian, Yiyu
    Qian, Quan
    [J]. MATERIALS TODAY COMMUNICATIONS, 2021, 28