Junhua Xue
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Junhua Xue has a total of 12 co-authors. Here are the top co-authors by number of shared publications:
- Yuning Chen
College of Systems Engineering, National University of Defense Technology, Changsha, China
2 shared publications - Liang Bai
National University of Defense Technology
1 shared publication Qinghua Wu
School of Management, Huazhong University of Science and Technology, Wuhan, China
1 shared publication- Ruipeng Liu
College of System Engineering, National University of Defense Technology, Changsha, Hunan, China
1 shared publication - Siyang Sun
College of System Engineering, National University of Defense Technology, Changsha, Hunan, China
1 shared publication - Tianyuan Yu
Laboratory for Big Data and Decision, National University of Defense Technology, Changsha, China
1 shared publication
Latest Publications
- Open Access
- 9 November 2026
- Published by Association for Computing Machinery (ACM)
- p. 6534-6543
MIRD: Multimodal Implicit Reasoning Distillation for Efficient Sarcasm Detection
- 9 November 2026
- Published by Association for Computing Machinery (ACM)
- p. 6534-6543
Open AccessMIRD: Multimodal Implicit Reasoning Distillation for Efficient Sarcasm Detection
- Open Access
- 15 September 2026
- Published by IOS Press
- p. 41-52
Multi-Objective Genetic Programming Hyper-Heuristic with Feature Evolution for Solving Uncertain Agile Satellite Scheduling Problem
The Uncertain Agile Earth Observation Satellite Scheduling Problem (UAEOSSP) provides a more accurate reflection of real-world conditions by incorporating uncertainties in profit, resource consumption, and visibility. Unlike traditional static scheduling problems, uncertainties render pre-planned solutions vulnerable. To address this challenge, we propose Feature Evolution-based Multi-Objective Genetic Programming Hyper-Heuristic (FEMOGP) for evolving scheduling strategies that balance interpretability and robustness. Our framework synergistically integrates simulation, strategy evolution, and feature evolution to concurrently optimize critical feature subsets and scheduling strategies. Experimental results demonstrate FEMOGP outperforms heuristics grounded in expert knowledge, achieving 3.17% and 13.89% average performance improvements compared to look-ahead heuristics and manually designed strategies, respectively. Additionally, compared to conventional GP, FEMOGP can reduce the average size of optimal strategies by 38.5 while identifying important feature subsets. These findings substantiate the potential of these techniques to enhance genetic programming performance in satellite scheduling domains.
- 15 September 2026
- Published by IOS Press
- p. 41-52
Open AccessMulti-Objective Genetic Programming Hyper-Heuristic with Feature Evolution for Solving Uncertain Agile Satellite Scheduling Problem
The Uncertain Agile Earth Observation Satellite Scheduling Problem (UAEOSSP) provides a more accurate reflection of real-world conditions by incorporating uncertainties in profit, resource consumption, and visibility. Unlike traditional static scheduling problems, uncertainties render pre-planned solutions vulnerable. To address this challenge, we propose Feature Evolution-based Multi-Objective Genetic Programming Hyper-Heuristic (FEMOGP) for evolving scheduling strategies that balance interpretability and robustness. Our framework synergistically integrates simulation, strategy evolution, and feature evolution to concurrently optimize critical feature subsets and scheduling strategies. Experimental results demonstrate FEMOGP outperforms heuristics grounded in expert knowledge, achieving 3.17% and 13.89% average performance improvements compared to look-ahead heuristics and manually designed strategies, respectively. Additionally, compared to conventional GP, FEMOGP can reduce the average size of optimal strategies by 38.5 while identifying important feature subsets. These findings substantiate the potential of these techniques to enhance genetic programming performance in satellite scheduling domains.
- 5 January 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Intelligent Transportation Systems
- Vol. 25 (6) , 5867-5879
An Efficient Threshold Acceptance-Based Multi-Layer Search Algorithm for Capacitated Electric Vehicle Routing Problem
The capacitated electric vehicle routing problem (CEVRP) extends the traditional vehicle routing problem by simultaneously considering the service order of the customers and the recharging schedules of the vehicles. Due to its NP-hard nature, we decompose the original problem into two sub-problems: a capacitated vehicle routing problem (CVRP) and a fixed route vehicle charging problem (FRVCP). A highly effective threshold acceptance based multi-layer search (TAMLS) algorithm is proposed to quickly obtain high-quality solutions. TAMLS consists of three layers. An iterated thresholding search procedure and a thresholding selection procedure are employed to produce diversified CVRP solutions in the first layer and to screen out high quality ones in the second layer, respectively. In the third layer, a removal heuristic coupling with an enumeration method is adopted to solve FRVRP, which produces optimized charging schedules. Extensive computational results show that TAMLS outperforms the state-of-the-art algorithms in terms of both solution quality and computation time. In particular, it is able to obtain new best results for 11 out of 17 benchmark instances, and reach the best known results on the remaining 6 instances. Additional experimental analyses are performed to better understand the contributions of key algorithmic components.
- 5 January 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Intelligent Transportation Systems
- Vol. 25 (6) , 5867-5879
An Efficient Threshold Acceptance-Based Multi-Layer Search Algorithm for Capacitated Electric Vehicle Routing Problem
The capacitated electric vehicle routing problem (CEVRP) extends the traditional vehicle routing problem by simultaneously considering the service order of the customers and the recharging schedules of the vehicles. Due to its NP-hard nature, we decompose the original problem into two sub-problems: a capacitated vehicle routing problem (CVRP) and a fixed route vehicle charging problem (FRVCP). A highly effective threshold acceptance based multi-layer search (TAMLS) algorithm is proposed to quickly obtain high-quality solutions. TAMLS consists of three layers. An iterated thresholding search procedure and a thresholding selection procedure are employed to produce diversified CVRP solutions in the first layer and to screen out high quality ones in the second layer, respectively. In the third layer, a removal heuristic coupling with an enumeration method is adopted to solve FRVRP, which produces optimized charging schedules. Extensive computational results show that TAMLS outperforms the state-of-the-art algorithms in terms of both solution quality and computation time. In particular, it is able to obtain new best results for 11 out of 17 benchmark instances, and reach the best known results on the remaining 6 instances. Additional experimental analyses are performed to better understand the contributions of key algorithmic components.