Many-objective optimization based on sub-objective evolutionary algorithm

被引：0
作者：
机构：
[1] Department of Ordnance Science and Technology, Naval Aeronautical and Astronautical University, Yantai
来源：
Jiang, Wenzhi (ytjwz@sohu.com) | 1910年 / Beijing University of Aeronautics and Astronautics (BUAA)卷 / 41期
关键词：
Genetic algorithm; Many-objective optimization; Minkowski distance; Pareto non-dominance solution set; Sub-objective evolutionary algorithm;
D O I：
10.13700/j.bh.1001-5965.2014.0706
中图分类号：
O29 [应用数学];
学科分类号：
070104 ;
摘要：
many-objective optimization is widely used in engineering area. There are some flaws to deal with many-objective optimization problem which the number of objectives exceeded three. The method which could chose proper individual solution is very crucial to solve high-dimension many-objective optimization problem. A sub-objective evolutionary algorithm (SOEA) was put forward to solve this problem. It was given in an abstract way to get the non-dominance solutions of high-dimension many-objective optimization problem. Firstly, the value of sub-objective function was sorted, and then partial Pareto non-dominance solutions of evolutional set were obtained quickly. By using the information of sorting, it could reduce the times of solution comparison in evolutional set and could get the solutions quickly. A uniform difference Minkowski distance algorithm and “k-neighbor” strategy were applied to compute fitness function. By using this method, it could improve the convergence speed to approach Pareto non-dominance solutions. Compared with the algorithms which can solve many-objective optimization problem for computing standard testing functions, it was showed the better performance of the SOEA algorithm. ©, 2015, Beijing University of Aeronautics and Astronautics (BUAA). All right reserved.
引用
收藏
页码：1910 / 1917
页数：7
相关论文
共 20 条
  • [1] Kong W.J., Ding J.L., Chai T.Y., Survey on large-dimensional multi-objective evolutionary algorithms, Control and Decision, 25, 3, pp. 321-326, (2010)
  • [2] Gong M.G., Jiao L.C., Yang D.D., Et al., Evolutionary multi-objective optimization algorithm, Journal of Software, 20, 2, pp. 271-289, (2009)
  • [3] Deb K., Pratap A., Agarwal S., Et al., A fast and elitist multiobjective genetic algorithm: NSGA-II, IEEE Transactions on Evolutionary Computation, 6, 2, pp. 182-197, (2002)
  • [4] Zitzler E., Laumanns M., Thiele L., SPEA2: Improving the strength Pareto evolutionary algorithm, TIK-Rep103, (2001)
  • [5] Corne D.W., Jerram N.R., Knowles J.D., Et al., PESA-Ⅱ: Region-based selection in evolutionary multi-objective optimization, Proceeding of the Genetic and Evolutionary Computation Conference, GECCO 2001, pp. 283-290, (2001)
  • [6] Khare V., Yao X., Deb K., Performance scaling of multi-objective evolutionary algorithms, Proceeding of the 2nd Conference on Evolutionary Multi-Criterion Optimization, EMO 2003, pp. 376-390, (2003)
  • [7] Bandyopadhyay S., Bhattacharya R., Solving multi-objective parallel machine scheduling problem by a modified NSGA-II, Applied Mathematical Modelling, 37, 10-11, pp. 6718-6729, (2013)
  • [8] Saxena D.K., Deb K., Non-linear dimensionality reduction procedure for certain large-dimensional multi-objective optimization problems: Employing correntropy and a novel maximum variance unfolding, Proceedings of the 4th International Conference on Evolutionary Multi-Criterion Optimization, pp. 772-787, (2007)
  • [9] Hernandez-Diaz A.G., Santana-Quintero L.V., Coello Coello C.A., Et al., Pareto-adaptiveε-dominance, Evolutionary Computation, 15, 4, pp. 493-517, (2007)
  • [10] Liu L.J., Li X.M., Yan J., Group divided dimensional reduction evolutionary algorithm for multi-objective pptimization, Journal of Sichuan University, 45, 1, pp. 118-122, (2013)
12