A reference point constrained dominance-based NSGA-Ⅲ algorithm

被引:0
|
作者
Bi X.-J. [1 ]
Wang C. [1 ]
机构
[1] College of Information and Communication Engineering, Harbin Engineering University, Harbin
来源
Kongzhi yu Juece/Control and Decision | 2019年 / 34卷 / 02期
关键词
Constrained many-objective optimization; Constraint handling; Convergence; Diversity; Feasibility; NSGA-Ⅲ; Reference point;
D O I
10.13195/j.kzyjc.2017.1067
中图分类号
学科分类号
摘要
For constrained many-objective optimization problems, a reference point-based constrained dominance principle (RPCDP) is designed, regareding the feasible solutions and infeasible solutions as a whole and considering the convergence, the diversity and the feasibility simultaneously. Then on this basis, an improved NSGA-Ⅲ algorithm is proposed. The experimental results on CDTLZ test suite show that compared with three state-of-the-art constrained many-objective evolutionary algorithms, the proposed algorithm has better performance on convergence and distribution. © 2019, Editorial Office of Control and Decision. All right reserved.
引用
收藏
页码:369 / 376
页数:7
相关论文
共 17 条
  • [1] Li B., Li J., Tang K., Many-objective evolutionary algorithms: A survey, ACM Computing Surveys (CSUR), 48, 1, pp. 1-35, (2015)
  • [2] Zheng J.H., Shen R.M., Li M.Q., Evolutionary algorithm based on information separation for many-objective optimization, J of Software, 26, 5, pp. 1013-1036, (2015)
  • [3] Von Lucken C., Baran B., Brizuela C., A survey on multi-objective evolutionary algorithms for many-objective problems, Computational optimization and Applications, 58, 3, pp. 707-756, (2014)
  • [4] Garcia J., Berlanga A., Lopez J.M.M., Effective evolutionary algorithms for many-specifications attainment: Application to air traffic control tracking filters, IEEE Trans on Evolutionary Computation, 13, 1, pp. 151-168, (2009)
  • [5] Jain H., Deb K., An evolutionary many-objective optimization algorithm using reference-point based nondominated sorting approach, Part Ⅰ: Handling constraints and extending to an adaptive approach, IEEE Trans on Evolutionary Computation, 18, 4, pp. 602-622, (2014)
  • [6] Deb K., Jain H., An evolutionary many-objective optimization algorithm using reference-point-based nondominated sorting approach, Part Ⅰ: Solving problems with box constraints, IEEE Trans on Evolutionary Computation, 18, 4, pp. 577-601, (2014)
  • [7] Li K., Deb Q., Zhang Q., An evolutionary many-objective optimization algorithm based on dominance and decomposition, IEEE Trans on Evolutionary Computation, 19, 5, pp. 694-716, (2015)
  • [8] Cheng R., Jin Y., Olhofer M., A reference vector guided evolutionary algorithm for many-objective optimization, IEEE Trans on Evolutionary Computation, 20, 5, pp. 773-791, (2016)
  • [9] Deb K., Pratap A., Agarwal S., A fast and elitist multiobjective genetic algorithm: Nsga-Ii, IEEE Trans on Evolutionary Computation, 6, 2, pp. 182-197, (2002)
  • [10] Long W., Liang X.M., Xu S.J., A hybrid evolutionary algorithm based on clustering good-point set crossover for constrained optimization, J of Computer Research & Development, 49, 8, pp. 1753-1761, (2012)