Xiang Fang
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Xiang Fang has a total of 6 co-authors. Here are the top co-authors by number of shared publications:
- Benyue Su
Tongling University
1 shared publication - Fei Han
Jiangsu University
1 shared publication - Huoyuan Wang
School of Computer and Information, Anqing Normal University, Anqing, Anhui, China
1 shared publication - Jing Jiang
School of Computer and Information, Anqing Normal University, Anqing, Anhui, China
1 shared publication - Pingping Tong
School of Computer and Information, Anqing Normal University, Anqing, Anhui, China
1 shared publication - Zhe Liu
Institute of Energy, Hefei Comprehensive National Science Center, hefei, anhui, CHINA
1 shared publication
Latest Publications
- 20 October 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Evolutionary Computation
- Vol. 30 (3) , 1314-1328
Turning Sparse Large-Scale Multiobjective Optimization Into Evolutionary Multitasking
Sparse large-scale multiobjective optimization problems (SLSMOPs) frequently emerge in diverse artificial intelligence applications. They are characterized by a high-dimensional search space where only a small subset of decision variables are non-zero. Many existing algorithms aim to concurrently identify zero-valued variables and optimize the non-zero subset within a reduced search space. However, striking an effective balance between these two aspects often proves elusive. To address this, we propose turning SLSMOPs into evolutionary multitasking, culminating in the development of a novel optimization framework, SparseEMT. This framework organizes the optimization process into three interrelated tasks based on the importance of variables. The first auxiliary task emphasizes fine-grained exploration of both zero and non-zero variables within a low-dimensional space. The second auxiliary task narrows the focus to a detailed search of only non-zero variables in an even lower-dimensional space. Finally, the main task concentrates on searching within the original high-dimensional space. In this framework, the entire population is divided into three segments, each dedicated to a specific task. Individuals undergo crossover and mutation both within their assigned tasks and across different tasks, facilitated by a specialized knowledge transfer strategy. Extensive empirical studies show that SparseEMT outperforms state-of-the-art algorithms on both the benchmark test suite and real-world applications, making it an effective solution for SLSMOPs.
- 20 October 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Evolutionary Computation
- Vol. 30 (3) , 1314-1328
Turning Sparse Large-Scale Multiobjective Optimization Into Evolutionary Multitasking
Sparse large-scale multiobjective optimization problems (SLSMOPs) frequently emerge in diverse artificial intelligence applications. They are characterized by a high-dimensional search space where only a small subset of decision variables are non-zero. Many existing algorithms aim to concurrently identify zero-valued variables and optimize the non-zero subset within a reduced search space. However, striking an effective balance between these two aspects often proves elusive. To address this, we propose turning SLSMOPs into evolutionary multitasking, culminating in the development of a novel optimization framework, SparseEMT. This framework organizes the optimization process into three interrelated tasks based on the importance of variables. The first auxiliary task emphasizes fine-grained exploration of both zero and non-zero variables within a low-dimensional space. The second auxiliary task narrows the focus to a detailed search of only non-zero variables in an even lower-dimensional space. Finally, the main task concentrates on searching within the original high-dimensional space. In this framework, the entire population is divided into three segments, each dedicated to a specific task. Individuals undergo crossover and mutation both within their assigned tasks and across different tasks, facilitated by a specialized knowledge transfer strategy. Extensive empirical studies show that SparseEMT outperforms state-of-the-art algorithms on both the benchmark test suite and real-world applications, making it an effective solution for SLSMOPs.