Pingping Tong

Pingping Tong

Auto-generated profile, based on publicly available information

Pingping Tong

School of Computer and Information, Anqing Normal University, Anqing, Anhui, China

Research Focus & Metrics

Academic Career Length

2Years (2025-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
10 September 2025 in IEEE Transactions on Emerging Topics in Computational Intelligence
Verified
Journal Article
Closed access
JJJing Jiang
Jing Jiang
PTPingping Tong
Pingping Tong
HWHuoyuan Wang
Huoyuan Wang
JHJuanjuan Hong
Juanjuan Hong
ZLZhe Liu
Zhe Liu
FHFei Han
Fei Han
Problem transformation-based multiobjective evolutionary algorithms (MOEAs) face the risk of losing optimal solutions when transforming a large-scale multiobjective optimization problem into a low-dimensional variant. One possible solution is to conduct concurrent multivariation searches, where the original space is treated as the original task, and the transformed spaces are treated as auxiliary tasks. However, determining reasonable dimensions for these transformed spaces remains a challenge. To address this, we propose a novel multivariation multifactorial evolutionary algorithm that dynamically adjusts the auxiliary tasks, with each corresponding to a transformed space with an optimal dimension for the current evolutionary stage. The approach begins by initializing a pool of candidate tasks with varying dimensions, allowing them to participate in the evolutionary process. It then quantifies each candidate's contribution and selects the most efficient ones as auxiliary tasks at each evolutionary stage. Additionally, we propose a novel knowledge transfer strategy that enables accurate cross-task and cross-dimensional transfer by integrating high-dimensional and low-dimensional information, thereby enhancing information sharing efficiency among multiple optimization tasks. Experimental results from a benchmark test suite and various real-world problems indicate the superior performance of the proposed algorithm in the majority of cases, demonstrating strong competitiveness when compared to state-of-the-art MOEAs.

20 October 2025 in IEEE Transactions on Evolutionary Computation
Verified
Journal Article
Closed access
JJJing Jiang
Jing Jiang
XFXiang Fang
Xiang Fang
HWHuoyuan Wang
Huoyuan Wang
PTPingping Tong
Pingping Tong
ZLZhe Liu
Zhe Liu
FHFei Han
Fei Han
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.