Wei Liu

Wei Liu

Auto-generated profile, based on publicly available information

Wei Liu

College of Systems Engineering, National University of Defense Technology, Changsha, P.R. China

Research Focus & Metrics

Academic Career Length

5Years (2022-Present)

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

Representative Publications

View All Publications
12 September 2022 in Computers & Industrial Engineering
Verified
Journal Article
Closed access
WLWei Liu
Wei Liu
TZTao Zhang
Tao Zhang
SHShengjun Huang
Shengjun Huang
KLKaiwen Li
Kaiwen Li

16 August 2022 in IEEE Transactions on Evolutionary Computation
Verified
Journal Article
Closed access
WLWei Liu
Wei Liu
RWRui Wang
Rui Wang
Tao ZhangTao Zhang
Tao Zhang
KLKaiwen Li
Kaiwen Li
Wenhua LiWenhua Li
Wenhua Li
XLXiangke Liao
Xiangke Liao
Multi-objective orienteering problems (MO-OPs) are classical multi-objective routing problems and have received much attention in recent decades. This study seeks to solve MO-OPs through a problem-decomposition framework, that is, an MO-OP is decomposed into a multi-objective knapsack problem (MOKP) and a traveling salesman problem (TSP). The MOKP and TSP are then solved by a multi-objective evolutionary algorithm (MOEA) and a deep reinforcement learning (DRL) method, respectively. While the MOEA module is for selecting cities, the DRL module is for planning a Hamiltonian path for these cities. An iterative use of these two modules drives the population towards the Pareto front of MO-OPs. The effectiveness of the proposed method is compared against NSGA-II and NSGA-III on various types of MO-OP instances. Experimental results show that our method performs best on almost all the test instances, and has shown strong generalization ability.

4 June 2024 in IEEE Transactions on Artificial Intelligence
Verified
Journal Article
Closed access
RWRui Wang
Rui Wang
WLWei Liu
Wei Liu
KLKaiwen Li
Kaiwen Li
Tao ZhangTao Zhang
Tao Zhang
LWLing Wang
Ling Wang
XXXin Xu
Xin Xu
The orienteering problem (OP) is widely applied in real life. However, as the scale of real-world problem scenarios grows quickly, traditional exact, heuristics and learning-based methods have difficulty balancing optimization accuracy and efficiency. This study proposes a problem decomposition-based double-layer optimization framework named DEA-DYPN to solve OPs. Using a diversity evolutionary algorithm (DEA) as the external optimizer and a dynamic pointer network (DYPN) as the inner optimizer, we significantly reduce the difficulty of solving large-scale OPs. Several targeted optimization operators are innovatively designed for stronger search ability, including a greedy population initialization heuristic, an elite strategy, a population restart mechanism, and a fitness-sharing selection strategy. Moreover, a dynamic embedding mechanism is introduced to DYPN to improve its characteristic learning ability. Extensive comparative experiments on OP instances with sizes from 20 to 500 are conducted for algorithmic performance validation. More experiments and analyses including the significance test, stability analysis, complexity analysis, sensitivity analysis, and ablation experiments are also conducted for comprehensive algorithmic evaluation. Experimental results show that our proposed DEA-DYPN ranks first according to the Friedman test, and outperforms the competitor algorithms at most 69%.

26 February 2026 in Expert Systems with Applications
Verified
Journal Article
Closed access
WLWei Liu
Wei Liu
Tao ZhangTao Zhang
Tao Zhang
CLChenhui Lin
Chenhui Lin
KLKaiwen Li
Kaiwen Li
RWRui Wang
Rui Wang

9 March 2026 in Expert Systems with Applications
Verified
Journal Article
Closed access
XYXu Yang
Xu Yang
RWRui Wang
Rui Wang
KLKaiwen Li
Kaiwen Li
Wenhua LiWenhua Li
Wenhua Li
WHWeixiong Huang
Weixiong Huang
WLWei Liu
Wei Liu

1 October 2025 in Drones
Verified
Journal Article
Open access
PDF file
ZLZe Liu
Ze Liu
ZSZhichao Shi
Zhichao Shi
WLWei Liu
Wei Liu
LZLu Zhang
Lu Zhang
RWRui Wang
Rui Wang
With the increasing frequency and intensity of forest fires driven by climate change and human activities, efficient detection and rapid response have become critical for forest fire prevention. Effective fire detection, swift response, and timely rescue are vital for forest firefighting efforts. This paper proposes an unmanned aerial vehicle (UAV)-based forest fire inspection system that integrates a ground support system (GSS), aiming to enhance automation and flexibility in inspection tasks. A three-layer mixed-integer linear programming model is developed: the first layer focuses on the site selection and capacity planning of the GSS; the second layer defines the coverage scope of different GSS units; and the third layer plans the inspection routes of UAVs and coordinates multi-UAV collaborative tasks. For planning UAV patrol routes and collaborative tasks, a goal-driven greedy algorithm (GDGA) based on traditional greedy methods is proposed. Simulation experiments based on a real forest fire case in Turkey demonstrate that the proposed model reduces the total annual costs by 28.1% and 16.1% compared to task-only and renewable-only models, respectively, with a renewable energy penetration rate of 68.71%. The goal-driven greedy algorithm also shortens UAV patrol distances by 7.0% to 12.5% across different rotation angles. These results validate the effectiveness of the integrated model in improving inspection efficiency and economic benefits, thereby providing critical support for forest fire prevention.