Caitong Yue
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Caitong Yue has a total of 126 co-authors. Here are the top co-authors by number of shared publications:
- Jing Liang
Zhengzhou University
54 shared publications - Kunjie Yu
Zhengzhou University
33 shared publications - Boyang Qu
School of Automation and Electrical Engineering, Zhongyuan University of Technology, Zhengzhou, China
28 shared publications - Kangjia Qiao
School of Electrical and Information Engineering, Zhengzhou University, Zhengzhou, China
18 shared publications - Ke Chen
School of Electrical and Information Engineering, Zhengzhou University, Zhengzhou, China
11 shared publications - Ying Bi
Zhengzhou University
8 shared publications
Latest Publications
- 1 October 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE/CAA Journal of Automatica Sinica
- Vol. 13 (10) , 2327-2342
A Weight-Guided Multimodal Multiobjective Ant Colony Optimization Algorithm for Traveling Salesman Problems
- 1 October 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE/CAA Journal of Automatica Sinica
- Vol. 13 (10) , 2327-2342
A Weight-Guided Multimodal Multiobjective Ant Colony Optimization Algorithm for Traveling Salesman Problems
- 1 July 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE/CAA Journal of Automatica Sinica
- Vol. 13 (7) , 1584-1599
A Two-Step Iterative Local Search for the Harvester Scheduling Problem with Splittable Workloads
- 1 July 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE/CAA Journal of Automatica Sinica
- Vol. 13 (7) , 1584-1599
A Two-Step Iterative Local Search for the Harvester Scheduling Problem with Splittable Workloads
- 15 May 2026
- Published by Elsevier in Expert Systems with Applications
- Vol. 327
Sector -scanning with energy-aware anchoring algorithm for task allocation of electric multi-robot systems
- 15 May 2026
- Published by Elsevier in Expert Systems with Applications
- Vol. 327
Sector -scanning with energy-aware anchoring algorithm for task allocation of electric multi-robot systems
- 30 March 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Industrial Informatics
- Vol. 22 (7) , 5807-5818
Expensive Multimodal Simulation Optimization via Surrogate Model-Driven Particle Swarm Optimizer
Many real-world optimization problems are multimodal with multiple globally optimal solutions, yet their evaluations are often computationally expensive—defining expensive multimodal optimization problems. Surrogate-assisted evolutionary algorithms reduce costs but often fail to balance global optima discovery with solution precision under limited budgets. To address these challenges, this article proposes surrogate-assisted particle swarm algorithm (SAPSO). Its three key innovations are: first, a ring-topology global-local search framework that simultaneously refines known solutions and explores new regions; second, an archive selection strategy to eliminate redundant searches and prioritize unexplored promising regions; and finally, an improved multimodal detection strategy that identifies distinct optima using existing data without additional expensive evaluations. To validate its practical utility, SAPSO is first applied to optimize the parameters of a permanent magnet synchronous motor, yielding three reliable solutions for different operational needs. Furthermore, the extensive experiment is carried out on the CEC2013 test set. In terms of the global optimal solution indicators, SAPSO outperformed MaMPSO in 10 functions, DSCPSO-MMO in 19 functions, and MHS-QPSO in 11 functions. For the valley ratio, SAPSO achieved better results than MaMPSO in 12 functions, DSCPSO-MMO in 18 functions, and MHS-QPSO in 17 functions. These results demonstrate SAPSO’s ability to consistently discover multiple high-quality solutions.
- 30 March 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Industrial Informatics
- Vol. 22 (7) , 5807-5818
Expensive Multimodal Simulation Optimization via Surrogate Model-Driven Particle Swarm Optimizer
Many real-world optimization problems are multimodal with multiple globally optimal solutions, yet their evaluations are often computationally expensive—defining expensive multimodal optimization problems. Surrogate-assisted evolutionary algorithms reduce costs but often fail to balance global optima discovery with solution precision under limited budgets. To address these challenges, this article proposes surrogate-assisted particle swarm algorithm (SAPSO). Its three key innovations are: first, a ring-topology global-local search framework that simultaneously refines known solutions and explores new regions; second, an archive selection strategy to eliminate redundant searches and prioritize unexplored promising regions; and finally, an improved multimodal detection strategy that identifies distinct optima using existing data without additional expensive evaluations. To validate its practical utility, SAPSO is first applied to optimize the parameters of a permanent magnet synchronous motor, yielding three reliable solutions for different operational needs. Furthermore, the extensive experiment is carried out on the CEC2013 test set. In terms of the global optimal solution indicators, SAPSO outperformed MaMPSO in 10 functions, DSCPSO-MMO in 19 functions, and MHS-QPSO in 11 functions. For the valley ratio, SAPSO achieved better results than MaMPSO in 12 functions, DSCPSO-MMO in 18 functions, and MHS-QPSO in 17 functions. These results demonstrate SAPSO’s ability to consistently discover multiple high-quality solutions.
- 19 March 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Industrial Informatics
- Vol. 22 (5) , 4361-4372
Multiparameters Motors Optimization Using Ensemble Surrogate-Assisted Multiobjective Differential Evolution Algorithm
Permanent magnet synchronous motors (PMSMs) are extensively utilized in industrial automation, transportation, and various other sectors owing to their superior efficiency, stability, and dynamic capabilities. Optimizing motor parameters is crucial for improving motor performance. Nonetheless, this optimization process often involves numerous time-intensive simulations, categorizing it as a costly optimization challenge. To address the issues of high computational costs and low optimization efficiency in motor parameter optimization, this study proposes an ensemble surrogate-assisted multiobjective differential evolution (ESMODE) algorithm. Initially, a framework for an ensemble surrogate model is established to reduce computational expenses and improve prediction accuracy. Subsequently, a population evolution strategy based on neighborhood field dynamics is implemented as the optimizer to speed up convergence. Furthermore, a criterion for infill sampling is designed to identify promising candidate solutions for training the model. The effectiveness of ESMODE is evaluated through experiments on standard benchmark test suites and comparisons with state-of-the-art expensive multiobjective optimization algorithms. Results demonstrate that the proposed method delivers superior performance. Ultimately, the ESMODE algorithm is applied to the optimization design of PMSMs. Comparative analysis of motor performance preoptimization and postoptimization confirms that the algorithm addresses key challenges in motor parameter optimization.
- 19 March 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Industrial Informatics
- Vol. 22 (5) , 4361-4372
Multiparameters Motors Optimization Using Ensemble Surrogate-Assisted Multiobjective Differential Evolution Algorithm
Permanent magnet synchronous motors (PMSMs) are extensively utilized in industrial automation, transportation, and various other sectors owing to their superior efficiency, stability, and dynamic capabilities. Optimizing motor parameters is crucial for improving motor performance. Nonetheless, this optimization process often involves numerous time-intensive simulations, categorizing it as a costly optimization challenge. To address the issues of high computational costs and low optimization efficiency in motor parameter optimization, this study proposes an ensemble surrogate-assisted multiobjective differential evolution (ESMODE) algorithm. Initially, a framework for an ensemble surrogate model is established to reduce computational expenses and improve prediction accuracy. Subsequently, a population evolution strategy based on neighborhood field dynamics is implemented as the optimizer to speed up convergence. Furthermore, a criterion for infill sampling is designed to identify promising candidate solutions for training the model. The effectiveness of ESMODE is evaluated through experiments on standard benchmark test suites and comparisons with state-of-the-art expensive multiobjective optimization algorithms. Results demonstrate that the proposed method delivers superior performance. Ultimately, the ESMODE algorithm is applied to the optimization design of PMSMs. Comparative analysis of motor performance preoptimization and postoptimization confirms that the algorithm addresses key challenges in motor parameter optimization.
- 12 March 2026
- Published by Elsevier in Expert Systems with Applications
- Vol. 317
Multiobjective harvester scheduling with splittable workloads: A diversity-guided iterated local search approach
- 12 March 2026
- Published by Elsevier in Expert Systems with Applications
- Vol. 317
Multiobjective harvester scheduling with splittable workloads: A diversity-guided iterated local search approach
- 3 March 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Systems, Man, and Cybernetics: Systems
- Vol. 56 (5) , 3220-3234
A Robustness Indicator-Based Dual-Population Evolutionary Algorithm for Multimodal Multiobjective Optimization
In practical scenarios, there may be solutions in the decision space with close objective values but located far apart, a characteristic known as multimodal multiobjective problems (MMOPs). While most multimodal multiobjective evolutionary algorithms (MMEAs) focus on finding global Pareto optimal solution sets (PSs) and local PSs demonstrating satisfactory convergence performance, decision-makers in real-world scenarios are often also interested in local PSs that exhibit strong robustness. In this study, we propose several benchmark functions in which the global and local PSs have varying levels of robustness. Then, we introduce an innovative dual-population evolutionary algorithm, termed GLR-MMEA, designed to simultaneously find both global PSs and local PSs with strong robustness. In GLR-MMEA, the convergence population focuses on identifying global PSs, providing convergence information to the diversity population. Meanwhile, the diversity population manages the detection of both global PSs and local PSs with strong robustness. In the process of updating the diversity population, a robustness indicator is proposed to access the robustness of solutions. Furthermore, a selection mechanism founded on this robustness indicator is applied to identify local PSs with high robustness. The experimental results show that GLR-MMEA performs competitively against other leading MMEAs in working on the selected benchmark functions.
- 3 March 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Systems, Man, and Cybernetics: Systems
- Vol. 56 (5) , 3220-3234
A Robustness Indicator-Based Dual-Population Evolutionary Algorithm for Multimodal Multiobjective Optimization
In practical scenarios, there may be solutions in the decision space with close objective values but located far apart, a characteristic known as multimodal multiobjective problems (MMOPs). While most multimodal multiobjective evolutionary algorithms (MMEAs) focus on finding global Pareto optimal solution sets (PSs) and local PSs demonstrating satisfactory convergence performance, decision-makers in real-world scenarios are often also interested in local PSs that exhibit strong robustness. In this study, we propose several benchmark functions in which the global and local PSs have varying levels of robustness. Then, we introduce an innovative dual-population evolutionary algorithm, termed GLR-MMEA, designed to simultaneously find both global PSs and local PSs with strong robustness. In GLR-MMEA, the convergence population focuses on identifying global PSs, providing convergence information to the diversity population. Meanwhile, the diversity population manages the detection of both global PSs and local PSs with strong robustness. In the process of updating the diversity population, a robustness indicator is proposed to access the robustness of solutions. Furthermore, a selection mechanism founded on this robustness indicator is applied to identify local PSs with high robustness. The experimental results show that GLR-MMEA performs competitively against other leading MMEAs in working on the selected benchmark functions.
- 30 January 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Evolutionary Computation
- Vol. PP (1089778X) , 1
An adaptive multi-objective task splitting algorithm for agricultural multi-robot task allocation
In smart farming, the development of multi-robot systems is essential for improving harvesting efficiency and addressing labor shortages, yet achieving optimal coordination presents significant scheduling complexities. This paper investigates a critical multi-robot task allocation problem in the context of orchard harvesting, focusing on multi-objective optimization (makespan and energy consumption) while considering task divisibility, robot re-utilization for multiple routes, and load-dependent energy consumption. Balancing these conflicting objectives across transport and operations, while managing the immensely expanded decision space due to task splitting, poses severe challenges to algorithm efficiency. To deal with these issues, we propose an adaptive multi-objective task splitting algorithm (AMTSA), which employs a hybrid encoding method to clearly demonstrate robot-route assignments and task-splitting information. Regarding the search modes, AMTSA adopts an adaptive strategy: the early phase emphasizes diverse exploration through route structural optimization, while the later phase shifts computational resources towards in-depth task splitting optimization (TSO) to accelerate convergence. Furthermore, the TSO process integrates two coordinated splitting mechanisms to collaboratively optimize the spatial layout and temporal balance of the task allocation by targeting the bottleneck robot, thereby addressing multi-objective conflicts. The effectiveness and robustness of AMTSA have been validated through comparative experiments on one real-world case study and 15 newly constructed test instances. Generally, this research advances the theoretical comprehension of multi-robot coordination and provides practical insights relevant to agricultural automation.
- 30 January 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Evolutionary Computation
- Vol. PP (1089778X) , 1
An adaptive multi-objective task splitting algorithm for agricultural multi-robot task allocation
In smart farming, the development of multi-robot systems is essential for improving harvesting efficiency and addressing labor shortages, yet achieving optimal coordination presents significant scheduling complexities. This paper investigates a critical multi-robot task allocation problem in the context of orchard harvesting, focusing on multi-objective optimization (makespan and energy consumption) while considering task divisibility, robot re-utilization for multiple routes, and load-dependent energy consumption. Balancing these conflicting objectives across transport and operations, while managing the immensely expanded decision space due to task splitting, poses severe challenges to algorithm efficiency. To deal with these issues, we propose an adaptive multi-objective task splitting algorithm (AMTSA), which employs a hybrid encoding method to clearly demonstrate robot-route assignments and task-splitting information. Regarding the search modes, AMTSA adopts an adaptive strategy: the early phase emphasizes diverse exploration through route structural optimization, while the later phase shifts computational resources towards in-depth task splitting optimization (TSO) to accelerate convergence. Furthermore, the TSO process integrates two coordinated splitting mechanisms to collaboratively optimize the spatial layout and temporal balance of the task allocation by targeting the bottleneck robot, thereby addressing multi-objective conflicts. The effectiveness and robustness of AMTSA have been validated through comparative experiments on one real-world case study and 15 newly constructed test instances. Generally, this research advances the theoretical comprehension of multi-robot coordination and provides practical insights relevant to agricultural automation.