A micro multi-objective genetic algorithm for multi-objective optimizations

被引:0
|
作者
Liu, G. P. [1 ]
Han, X. [1 ]
机构
[1] Hunan Univ, Coll Mech & Automot Engn, State Key Lab Adv Design & Manufacture Vehicle Bo, Changsha 410082, Peoples R China
关键词
multi-objective optimizations; genetic algorithm; Parelo-optimal solutions; non-dominated sorting;
D O I
暂无
中图分类号
TH [机械、仪表工业];
学科分类号
0802 ;
摘要
A micro multi-objective genetic algorithm based on the micro genetic algorithm is suggested for the multi-objective 14 optimization problems. An external elite archive is used to store Pareto-optimal solutions of the evolutionary process. A non-dominated sorting is employed to classify the combinational population of the evolutionary population and the external elite population into several different non-dominated levels. A crowded-comparison approach is used in each level to keep the diversity of the population. All solutions from the first non-dominated level make up of the current non-dominated set. Once the small population converges, an exploratory operator will be applied to the external elite population to explore more non-dominated solutions near the current non-dominated set, and a restart strategy will be subsequently adopted. Simulation results for several difficult test functions indicate that the present method has higher efficiency and better convergence near the globally Pareto-optimal set for all test functions, and a better spread of solutions for some test functions compared to NSGA II.
引用
收藏
页码:419 / 424
页数:6
相关论文
共 50 条
  • [31] An improved genetic algorithm for multi-objective optimization
    Chen, GL
    Guo, WZ
    Tu, XZ
    Chen, HW
    Progress in Intelligence Computation & Applications, 2005, : 204 - 210
  • [32] A Modified micro Genetic Algorithm for undertaking Multi-Objective Optimization Problems
    Tan, Choo Jun
    Lim, Chee Peng
    Cheah, Yu-N
    JOURNAL OF INTELLIGENT & FUZZY SYSTEMS, 2013, 24 (03) : 483 - 495
  • [33] Multi-objective genetic algorithm for solving multi-objective flow-shop inverse scheduling problems
    Mou J.
    Guo Q.
    Gao L.
    Zhang W.
    Mou J.
    Mou, Jianhui (mjhcr@163.com), 1600, Chinese Mechanical Engineering Society (52): : 186 - 197
  • [34] A rough multi-objective genetic algorithm for uncertain constrained multi-objective solid travelling salesman problem
    Samir Maity
    Arindam Roy
    Manoanjan Maiti
    Granular Computing, 2019, 4 : 125 - 142
  • [35] A rough multi-objective genetic algorithm for uncertain constrained multi-objective solid travelling salesman problem
    Maity, Samir
    Roy, Arindam
    Maiti, Manoanjan
    GRANULAR COMPUTING, 2019, 4 (01) : 125 - 142
  • [36] An imprecise Multi-Objective Genetic Algorithm for uncertain Constrained Multi-Objective Solid Travelling Salesman Problem
    Maity, Samir
    Roy, Arindam
    Maiti, Manoranjan
    EXPERT SYSTEMS WITH APPLICATIONS, 2016, 46 : 196 - 223
  • [37] Multi-objective Jaya Algorithm for Solving Constrained Multi-objective Optimization Problems
    Naidu, Y. Ramu
    Ojha, A. K.
    Devi, V. Susheela
    ADVANCES IN HARMONY SEARCH, SOFT COMPUTING AND APPLICATIONS, 2020, 1063 : 89 - 98
  • [38] A Multi-objective Evolutionary Algorithm based on Decomposition for Constrained Multi-objective Optimization
    Martinez, Saul Zapotecas
    Coello, Carlos A. Coello
    2014 IEEE CONGRESS ON EVOLUTIONARY COMPUTATION (CEC), 2014, : 429 - 436
  • [39] A new hybrid memetic multi-objective optimization algorithm for multi-objective optimization
    Luo, Jianping
    Yang, Yun
    Liu, Qiqi
    Li, Xia
    Chen, Minrong
    Gao, Kaizhou
    INFORMATION SCIENCES, 2018, 448 : 164 - 186
  • [40] A Niching Multi-objective Harmony Search Algorithm for Multimodal Multi-objective Problems
    Qu, B. Y.
    Li, G. S.
    Guo, Q. Q.
    Yan, L.
    Chai, X. Z.
    Guo, Z. Q.
    2019 IEEE CONGRESS ON EVOLUTIONARY COMPUTATION (CEC), 2019, : 1267 - 1274