Many-objective firefly algorithm for solving large-scale sparse optimization problems

被引：0

作者：

Zhao, Jia ^{[1
,2
]}

Hu, Qiu-Min ^{[1
,2
]}

Xiao, Ren-Bin ^{[3
]}

Pan, Zheng-Xiang ^{[4
]}

Cui, Zhi-Hua ^{[5
]}

Fan, Tang-Huai ^{[1
,2
]}

机构：

[1] School of Information Engineering, Nanchang Institute of Technology, Nanchang

[2] Nanchang Key Laboratory of IoT Perception and Collaborative Computing for Smart City, Nanchang Institute of Technology, Nanchang

[3] School of Artificial Intelligence and Automation, Huazhong University of Science and Technology, Wuhan

[4] Institute of Computer Science and Engineering, Shandong University of Science and Technology, Qingdao

[5] College of Computer Science and Technology, Taiyuan University of Technology, Taiyuan

来源：

Kongzhi yu Juece/Control and Decision | 2024年 / 39卷 / 12期

关键词：

convergence speed; dynamic scoring; firefly algorithm; large-scale sparse optimization; many-objective optimization; sparsity;

D O I：

10.13195/j.kzyjc.2024.0062

中图分类号：

学科分类号：

摘要：

The multi-objective firefly algorithm is difficult to ensure the sparsity of the Pareto optimal solutions when dealing with large-scale sparse multi-objective optimization problems, and when the objective dimension of the optimization problem is too large, it will also lead to the failure of Pareto dominance and the slowdown of convergence. In view of this, this paper proposes a many-objective firefly algorithm based on dynamic scoring and neighborhood search (SMaOFA). The algorithm generates sparse initial population based on the dual-coding hybrid ensemble, and proposes a dynamic scoring strategy, which dynamically updates the decision variable score at each round of iteration to provide prior knowledge for subsequent iterations to ensure the sparsity of the solution set. According to the concept of fuzzy dominance and the Euclidean distance between fireflies, a neighborhood search strategy is proposed, which discards the influence of the full attraction model on the convergence speed of the algorithm, and avoids the failure of Pareto dominance caused by the large objective dimension. The linear adjustment factor is introduced to improve the position update formula of fireflies and improve the search ability of the population. Experimental results show that the proposed algorithm has efficient performance when dealing with large-scale sparse multi-objective optimization problems. © 2024 Northeast University. All rights reserved.

引用

页码：3989 / 3996

页数：7

共 32 条

[1]

Tian Y, Lu C, Zhang X Y, Et al., Solving large-scale multiobjective optimization problems with sparse optimal solutions via unsupervised neural networks, IEEE Transactions on Cybernetics, 51, 6, pp. 3115-3128, (2021)

[2]

Srivastava N, Hinton G, Krizhevsky A, Et al., Dropout: A simple way to prevent neural networks from overfitting, The Journal of Machine Learning Research, 15, 1, pp. 1929-1958, (2014)

[3]

Chu S C, Zhuang Z J, Pan J S, Et al., Enhanced SparseEA for large-scale multi-objective feature selection problems, Complex & Intelligent Systems, 10, 1, pp. 485-507, (2024)

[4]

Lalou M, Tahraoui M A, Kheddouci H., The critical node detection problem in networks: A survey, Computer Science Review, 28, pp. 92-117, (2018)

[5]

Tian Y, Zhang X Y, Wang C, Et al., An evolutionary algorithm for large-scale sparse multiobjective optimization problems, IEEE Transactions on Evolutionary Computation, 24, 2, pp. 380-393, (2020)

[6]

Tian Y, Feng Y D, Zhang X Y, Et al., A fast clustering based evolutionary algorithm for super-large-scale sparse multi-objective optimization, IEEE/CAA Journal of Automatica Sinica, 10, 4, pp. 1048-1063, (2023)

[7]

Su Y S, Jin Z X, Tian Y, Et al., Comparing the performance of evolutionary algorithms for sparse multi-objective optimization via a comprehensive indicator[research frontier], IEEE Computational Intelligence Magazine, 17, 3, pp. 34-53, (2022)

[8]

Zhang Y J, Tian Y, Zhang X Y., Improved SparseEA for sparse large-scale multi-objective optimization problems, Complex & Intelligent Systems, 9, pp. 1127-1142, (2023)

[9]

Zhang X Y, Tian Y, Cheng R, Et al., A decision variable clustering-based evolutionary algorithm for large-scale many-objective optimization, IEEE Transactions on Evolutionary Computation, 22, 1, pp. 97-112, (2018)

[10]

Zille H, Ishibuchi H, Mostaghim S, Et al., A framework for large-scale multiobjective optimization based on problem transformation, IEEE Transactions on Evolutionary Computation, 22, 2, pp. 260-275, (2018)

← 1 2 3 4 →