[1]XING Wenlai,WU Runxiu,XIAO Renbin,et al.A multi-objective firefly algorithm with group optimization of decision variables[J].CAAI Transactions on Intelligent Systems,2025,20(4):838-857.[doi:10.11992/tis.202406005]
Copy
CAAI Transactions on Intelligent Systems[ISSN 1673-4785/CN 23-1538/TP] Volume:
20
Number of periods:
2025 4
Page number:
838-857
Column:
学术论文—机器学习
Public date:
2025-08-05
- Title:
-
A multi-objective firefly algorithm with group optimization of decision variables
- Author(s):
-
XING Wenlai1; 2; 3; WU Runxiu1; 2; 3; XIAO Renbin4; ZHONG Jinwen1; 2; 3; ZHAO Jia1; 2; 3
-
1. School of Information Engineering, Jiangxi University of Water Resources and Electric Power, Nanchang 330099, China;
2. Jiangxi Province Engineering Research Center for Intelligent Processing and Early Warning Technology of Water Conservancy Big Data, Nanchang 330099, China;
3. Nanchang Key Laboratory of IoT Perception and Collaborative Computing for Smart City, Nanchang 330099, China;
4. School of Artificial Intelligence and Automation, Huazhong University of Science and Technology, Wuhan 430074, China
-
- Keywords:
-
multi-objective optimization problems; multi-objective firefly algorithm; variable grouping; learning behaviour; mutation operator; archive truncation; convergence speed; optimization accuracy
- CLC:
-
TP18
- DOI:
-
10.11992/tis.202406005
- Abstract:
-
Multi-objective firefly algorithm adopts an overall dimension update strategy, which often results in slow convergence and poor optimization accuracy due to inadequate optimization effects on certain dimensions. To address these problems, this paper proposes a multi-objective firefly algorithm with group optimization of decision variables(MOFA-GD). Firstly, it introduces a decision variable grouping mechanism, dividing the entire set of decision variables into a convergence variable group and a diversity variable group based on different impacts of each variable on the algorithm’s performance. Secondly, it designs a decision variable grouping optimization model, utilizing learning behavior to optimize the convergence variable group to accelerate the population’s convergence speed, while using a non-uniform mutation operator to optimize the diversity variable group to prevent premature convergence. A gradually decreasing mutation amplitude guides local exploitation by the population, thereby enhancing the algorithm’s optimization accuracy. Finally, it adopts an archive truncation strategy to maintain the external archive, accurately removing crowded individuals to preserve diversity of the external archive. Experimental results show that MOFA-GD demonstrates excellent convergence speed and optimization accuracy, achieving a uniformly distributed Pareto optimal solution set. The proposed algorithm provides a high-efficiency and reliable solution for solving multi-objective optimization problems.