Learnable self-supervised support vector machine based individual selection strategy for multimodal multi-objective optimization

被引:11
作者
Gao, Xiaochuan [1 ]
Bai, Weiting [1 ]
Dang, Qianlong [1 ]
Yang, Shuai [2 ]
Zhang, Guanghui [3 ]
机构
[1] Northwest A&F Univ, Coll Sci, Yangling 712100, Shaanxi, Peoples R China
[2] Anhui Agr Univ, Sch Informat & Artificial Intelligence, Hefei 230036, Peoples R China
[3] Hebei Agr Univ, Sch Informat Sci & Technol, Baoding 071001, Peoples R China
关键词
Multimodal multi-objective optimization; Learnable self-supervised support vector machine; Individual selection; Manhattan distance; Crowding distance; ALGORITHM;
D O I
10.1016/j.ins.2024.121553
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Multimodal multi-objective optimization problem (MMOP) is a frontier research problem, which can provide decision makers with more choices without making trade-offs. Many multimodal multi-objective evolutionary algorithms (MMOEAs) have been proposed to solve MMOP. However, most MMOEAs tend to prioritize the objective dominance of individuals in the process of individual selection, and only individuals with the same objective dominance will be considered the diversity, which leads to the loss of many promising solutions. To solve the above problem, this paper proposes a learnable self-supervised support vector machine (SVM) based multimodal multi-objective optimization algorithm (SVMEA). Support vector machine can learn the knowledge about distinguishing the advantages and disadvantages of individuals from the data in the existing training set and select individuals, in which the objective dominance of individuals is as important as diversity. Moreover, a crowding distance calculation method based on Manhattan distance is designed. Compared with the traditional method using Euclidean distance to calculate crowding distance, it can better evaluate the diversity of individuals in the decision space and assist the selection of elite solutions. Experimental results show that the proposed SVMEA is competitive with seven other advanced MMOEAs on 34 benchmark problems and a practical application problem.
引用
收藏
页数:19
相关论文
共 46 条
[1]  
Alsajri A., 2023, Babylonian J. Mach. Learn., V2024, P15
[2]  
Boser B. E., 1992, Proceedings of the Fifth Annual ACM Workshop on Computational Learning Theory, P144, DOI 10.1145/130385.130401
[3]   A Generative Adversarial Networks Model Based Evolutionary Algorithm for Multimodal Multi-Objective Optimization [J].
Dang, Qianlong ;
Zhang, Guanghui ;
Wang, Ling ;
Yang, Shuai ;
Zhan, Tao .
IEEE TRANSACTIONS ON EMERGING TOPICS IN COMPUTATIONAL INTELLIGENCE, 2024, :1-10
[4]   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
[5]  
Deb K., 2016, Decision Sciences, P161
[6]  
Gao W., 2022, IEEE Trans. Evol. Comput., P1
[7]   A decomposition-based evolutionary algorithm using an estimation strategy for multimodal multi-objective optimization [J].
Gao, Weifeng ;
Xu, Wei ;
Gong, Maoguo ;
Yen, Gary G. .
INFORMATION SCIENCES, 2022, 606 :531-548
[8]   Evolutionary Multiobjective Blocking Lot-Streaming Flow Shop Scheduling With Machine Breakdowns [J].
Han, Yuyan ;
Gong, Dunwei ;
Jin, Yaochu ;
Pan, Quanke .
IEEE TRANSACTIONS ON CYBERNETICS, 2019, 49 (01) :184-197
[9]  
Ilwani M., 2023, MESOP J COMPUT SCI, P106
[10]  
Ishibuchi H, 2011, GECCO-2011: PROCEEDINGS OF THE 13TH ANNUAL GENETIC AND EVOLUTIONARY COMPUTATION CONFERENCE, P649