Yue Zhang
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Yue Zhang has a total of 81 co-authors. Here are the top co-authors by number of shared publications:
- Yanjie Song
School of Information Science and Technology Dalian Maritime University Dalian China
11 shared publications - Shenghan Zhou
School of Reliability and Systems Engineering, Beihang University, Beijing 100191, China
6 shared publications - Houxiang Liu
School of Reliability and Systems Engineering, Beihang University, Beijing 100191, China
5 shared publications - Ponnuthurai Nagaratnam Suganthan
Department of Computer Science and Engineering, College of Engineering, Qatar University, Doha, Qatar
5 shared publications - Wenbing Chang
School of Reliability and Systems Engineering, Beihang University, Beijing 100191, China
5 shared publications - Xinpeng Ji
School of Reliability and Systems Engineering, Beihang University, Beijing 100191, China
5 shared publications
Latest Publications
- Top Cited PapersOpen Access
- 18 April 2026
- Published by MDPI AG in Mathematics
- Vol. 14 (8) , 1365
A Survey on Preference-Based Multi-Objective Evolutionary Algorithms
Multi-objective optimization problems (MOPs) are ubiquitous in scientific research and engineering applications, where multiple conflicting objectives must be optimized simultaneously. Unlike traditional multi-objective evolutionary algorithms, which aim to approximate the entire Pareto front, preference-based multi-objective evolutionary algorithms (PBMOEAs) incorporate decision maker preferences to guide the search toward a region of interest (ROI). This paper presents a focused survey of PBMOEAs using a three-dimensional analytical framework consisting of preference articulation mode, preference modeling approach, and preference incorporation mechanism. Under this framework, the survey reviews major preference modeling approaches and preference incorporation mechanisms, and further discusses three practical issues critical to PBMOEA design: the effectiveness of preference incorporation, the practical limits of interactive methods, and the role of visualization in ROI-oriented decision support. Findings indicate that while PBMOEAs enhance decision-making efficiency, their performance hinges on preference quality, problem characteristics, cognitive load, and method suitability. Future directions include unified modeling, comprehensive evaluation, human-centered design, and integrating surrogate models, explainable learning, and LLM-assisted interfaces.
- 18 April 2026
- Published by MDPI AG in Mathematics
- Vol. 14 (8) , 1365
Top Cited PapersOpen AccessA Survey on Preference-Based Multi-Objective Evolutionary Algorithms
Multi-objective optimization problems (MOPs) are ubiquitous in scientific research and engineering applications, where multiple conflicting objectives must be optimized simultaneously. Unlike traditional multi-objective evolutionary algorithms, which aim to approximate the entire Pareto front, preference-based multi-objective evolutionary algorithms (PBMOEAs) incorporate decision maker preferences to guide the search toward a region of interest (ROI). This paper presents a focused survey of PBMOEAs using a three-dimensional analytical framework consisting of preference articulation mode, preference modeling approach, and preference incorporation mechanism. Under this framework, the survey reviews major preference modeling approaches and preference incorporation mechanisms, and further discusses three practical issues critical to PBMOEA design: the effectiveness of preference incorporation, the practical limits of interactive methods, and the role of visualization in ROI-oriented decision support. Findings indicate that while PBMOEAs enhance decision-making efficiency, their performance hinges on preference quality, problem characteristics, cognitive load, and method suitability. Future directions include unified modeling, comprehensive evaluation, human-centered design, and integrating surrogate models, explainable learning, and LLM-assisted interfaces.
- Top Cited Papers
- 12 January 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Systems, Man, and Cybernetics: Systems
- Vol. 56 (2) , 1354-1368
An Evolutionary Algorithm With Memory Guidance for Data Transmission Scheduling Optimization in Communication Satellite Network
With the rapid development of satellite technology, communication satellites have become an indispensable part of modern infrastructure. They serve as a key pillar for the future integrated communication satellite network (CSN). However, the increasing number of communication satellites presents significant challenges for data transmission between the satellite and ground station. This article focuses on transmitting communication data by scheduling resources for communication tasks. The goal of data transmission scheduling optimization in CSN (DTSOCSN) is to design a scheduling scheme that maximizes task profit across satellite–ground links, considering the constraints of the two working modes of communication satellites. To solve DTSOCSN, a mixed-integer programming model is developed, which incorporates various constraints such as the conditions for feed switching operation and the limitations of task execution windows. Based on the complexity of the problem, we propose an evolutionary algorithm with memory guidance (MGEA). The algorithm takes into account the memory dependence of Caputo fractional-order differential and innovatively designs a crossover operator, called Caputo crossover (CX). This crossover method uses the genetic information stored in memory to guide the crossover operation of the next generation, thereby forming a smooth optimization path and improving the search efficiency of the algorithm. In addition, an elite opposition-based heuristic initialization method and a tracking variation strategy are designed to enhance the algorithm’s ability to find high-quality initial solutions and perform local optimization. Experimental validation proceeds in two stages: first, multiscale simulations demonstrate MGEA’s superior performance over existing mainstream algorithms in task profit, convergence speed, resource utilization, and search efficiency. Second, to verify the contribution of the CX operator, it is integrated into several classical algorithms for comparative testing on benchmark problems. The results consistently show that algorithms using the CX operator achieve significant performance advantages compared with those relying on traditional crossover operators. This study not only provides an effective solution for DTSOCSN but also offers new idea for solving other types of satellite scheduling problems.
- 12 January 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Systems, Man, and Cybernetics: Systems
- Vol. 56 (2) , 1354-1368
Top Cited PapersAn Evolutionary Algorithm With Memory Guidance for Data Transmission Scheduling Optimization in Communication Satellite Network
With the rapid development of satellite technology, communication satellites have become an indispensable part of modern infrastructure. They serve as a key pillar for the future integrated communication satellite network (CSN). However, the increasing number of communication satellites presents significant challenges for data transmission between the satellite and ground station. This article focuses on transmitting communication data by scheduling resources for communication tasks. The goal of data transmission scheduling optimization in CSN (DTSOCSN) is to design a scheduling scheme that maximizes task profit across satellite–ground links, considering the constraints of the two working modes of communication satellites. To solve DTSOCSN, a mixed-integer programming model is developed, which incorporates various constraints such as the conditions for feed switching operation and the limitations of task execution windows. Based on the complexity of the problem, we propose an evolutionary algorithm with memory guidance (MGEA). The algorithm takes into account the memory dependence of Caputo fractional-order differential and innovatively designs a crossover operator, called Caputo crossover (CX). This crossover method uses the genetic information stored in memory to guide the crossover operation of the next generation, thereby forming a smooth optimization path and improving the search efficiency of the algorithm. In addition, an elite opposition-based heuristic initialization method and a tracking variation strategy are designed to enhance the algorithm’s ability to find high-quality initial solutions and perform local optimization. Experimental validation proceeds in two stages: first, multiscale simulations demonstrate MGEA’s superior performance over existing mainstream algorithms in task profit, convergence speed, resource utilization, and search efficiency. Second, to verify the contribution of the CX operator, it is integrated into several classical algorithms for comparative testing on benchmark problems. The results consistently show that algorithms using the CX operator achieve significant performance advantages compared with those relying on traditional crossover operators. This study not only provides an effective solution for DTSOCSN but also offers new idea for solving other types of satellite scheduling problems.
- Top Cited PapersOpen Access
- 27 December 2025
- Published by Elsevier in Engineering
- Vol. 60, 343-361
Domain-Specific Large Language Model for Maintenance Decision-Making on Wind Farms by Labeled-Data-Supervised Fine-Tuning
- 27 December 2025
- Published by Elsevier in Engineering
- Vol. 60, 343-361
Top Cited PapersOpen AccessDomain-Specific Large Language Model for Maintenance Decision-Making on Wind Farms by Labeled-Data-Supervised Fine-Tuning
- Open Access
- 30 October 2025
- Published by Elsevier in Chinese Journal of Aeronautics
- Vol. 39 (7)
A multi-agent-based short-cycle reliability evolution model for unmanned swarm systems
- 30 October 2025
- Published by Elsevier in Chinese Journal of Aeronautics
- Vol. 39 (7)
Open AccessA multi-agent-based short-cycle reliability evolution model for unmanned swarm systems
- 15 October 2025
- Published by Elsevier in Information Sciences
- Vol. 728
A multi-population co-evolutionary algorithm based on dual-space division for dynamic multi-objective optimization problems
- 15 October 2025
- Published by Elsevier in Information Sciences
- Vol. 728
A multi-population co-evolutionary algorithm based on dual-space division for dynamic multi-objective optimization problems
- Open Access
- 13 August 2025
- Published by Elsevier in Engineering
- Vol. 63, 31-36
Can large language models solve complex engineering issues? Practical applications in reliability systems engineering
- 13 August 2025
- Published by Elsevier in Engineering
- Vol. 63, 31-36
Open AccessCan large language models solve complex engineering issues? Practical applications in reliability systems engineering
- 12 August 2024
- Published by Springer Nature in Memetic Computing
- Vol. 16 (3) , 373-386
A reinforcement learning-based evolutionary algorithm for the unmanned aerial vehicles maritime search and rescue path planning problem considering multiple rescue centers
- 12 August 2024
- Published by Springer Nature in Memetic Computing
- Vol. 16 (3) , 373-386
A reinforcement learning-based evolutionary algorithm for the unmanned aerial vehicles maritime search and rescue path planning problem considering multiple rescue centers