Many-objective evolutionary algorithm based on spatial distance and decision vector self-learning

被引:4
作者
Yang, Lei [1 ]
Li, Kangshun [1 ]
Zeng, Chengzhou [1 ]
Liang, Shumin [1 ]
Zhu, Binjie [1 ]
Wang, Dongya [2 ]
机构
[1] South China Agr Univ, Sch Math & Informat, Guangzhou 510642, Peoples R China
[2] Univ Exeter, Coll Engn Math & Phys Sci, Exeter EX4 4QF, England
基金
中国国家自然科学基金;
关键词
Many-objective optimization; Spatial distance; Self-learning; Environmental selection; Distributive vector; OPTIMIZATION ALGORITHM; DECOMPOSITION; STRATEGY; MOEA/D;
D O I
10.1016/j.ins.2022.11.002
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
In this paper, a new many-objective optimization evolutionary algorithm (MaOEA), namely Many-Objective Evolutionary Algorithm Based on Spatial Distance and Decision Vector Self-Learning (DVSLEA), is proposed for many-objective optimization. The core idea of the algorithm is to use spatial distance to influence the value of disturbance ratio and then affect the generation of offspring. In order to make the algorithm have a good distribution, distribution vector is introduced for the procedure of disturbance. Moreover, a self-learning process is corporated to ascertain the value of disturbance ratio. To eval- uate the performance of DVSLEA, the DTLZ and WFG test suites with 3, 5, 8, 10, and 15 objectives are adopted. The experimental results indicate that DVSLEA shows superior performance over nine competitive evolutionary algorithms(MOEA/DD, NSGA-III, VaEA, SPEA2, SPEA2-SDE, MOEADAWA, onebyoneEA, PREA, RVEA), when solving most of the test problems used.(c) 2022 Published by Elsevier Inc.
引用
收藏
页码:94 / 109
页数:16
相关论文
共 50 条
[1]   Evolutionary Many-Objective Algorithms for Combinatorial Optimization Problems: A Comparative Study [J].
Behmanesh, Reza ;
Rahimi, Iman ;
Gandomi, Amir H. .
ARCHIVES OF COMPUTATIONAL METHODS IN ENGINEERING, 2021, 28 (02) :673-688
[2]   The balance between proximity and diversity in multiobjective evolutionary algorithms [J].
Bosman, PAN ;
Thierens, D .
IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION, 2003, 7 (02) :174-188
[3]   A decomposition-based evolutionary algorithm for scalable multi/many-objective optimization [J].
Chen, Jiaxin ;
Ding, Jinliang ;
Tan, Kay Chen ;
Chen, Qingda .
MEMETIC COMPUTING, 2021, 13 (03) :413-432
[4]   A historical solutions based evolution operator for decomposition-based many-objective optimization [J].
Chen, Zefeng ;
Zhou, Yuren ;
Zhao, Xiaorong ;
Xiang, Yi ;
Wang, Jiahai .
SWARM AND EVOLUTIONARY COMPUTATION, 2018, 41 :167-189
[5]   A Reference Vector Guided Evolutionary Algorithm for Many-Objective Optimization [J].
Cheng, Ran ;
Jin, Yaochu ;
Olhofer, Markus ;
Sendhoff, Bernhard .
IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION, 2016, 20 (05) :773-791
[6]   A novel underwater image restoration method based on decomposition network and physical imaging model [J].
Cui, Yanfang ;
Sun, Yujuan ;
Jian, Muwei ;
Zhang, Xiaofeng ;
Yao, Tao ;
Gao, Xin ;
Li, Yiru ;
Zhang, Yan .
INTERNATIONAL JOURNAL OF INTELLIGENT SYSTEMS, 2022, 37 (09) :5672-5690
[7]   Normal-boundary intersection: A new method for generating the Pareto surface in nonlinear multicriteria optimization problems [J].
Das, I ;
Dennis, JE .
SIAM JOURNAL ON OPTIMIZATION, 1998, 8 (03) :631-657
[8]   A fast and elitist multiobjective genetic algorithm: NSGA-II [J].
Deb, K ;
Pratap, A ;
Agarwal, S ;
Meyarivan, T .
IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION, 2002, 6 (02) :182-197
[9]   An Evolutionary Many-Objective Optimization Algorithm Using Reference-Point-Based Nondominated Sorting Approach, Part I: Solving Problems With Box Constraints [J].
Deb, Kalyanmoy ;
Jain, Himanshu .
IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION, 2014, 18 (04) :577-601
[10]   A many-objective evolutionary algorithm based on decomposition with dynamic resource allocation for irregular optimization [J].
Dong, Ming-gang ;
Liu, Bao ;
Jing, Chao .
FRONTIERS OF INFORMATION TECHNOLOGY & ELECTRONIC ENGINEERING, 2020, 21 (08) :1171-1190