Wenbo Sun
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Wenbo Sun has a total of 14 co-authors. Here are the top co-authors by number of shared publications:
- Fangni Zhang
Department of Data and Systems Engineering, The University of Hong Kong, Hong Kong, China
6 shared publications - Lingxiao Wu
The Hong Kong Polytechnic University
3 shared publications - Wei Liu
The Hong Kong Polytechnic University
2 shared publications - Dongze Li1 shared publication
Fangni Zhang
Department of Data and Systems Engineering, The University of Hong Kong
1 shared publicationHaoyi Fei
Department of Aeronautical and Aviation Engineering, The Hong Kong Polytechnic University
1 shared publication
Latest Publications
- 31 August 2026
- Published by Taylor & Francis in Transportmetrica B: Transport Dynamics
- Vol. 14 (1)
Optimising mobility and charging services with shared electric autonomous vehicles
1. With the advancement of autonomous driving technology, autonomous vehicles are emerging as a novel component in the shared ride-sourcing market. For example, Uber intends to deploy driverless Wa...
- 31 August 2026
- Published by Taylor & Francis in Transportmetrica B: Transport Dynamics
- Vol. 14 (1)
Optimising mobility and charging services with shared electric autonomous vehicles
1. With the advancement of autonomous driving technology, autonomous vehicles are emerging as a novel component in the shared ride-sourcing market. For example, Uber intends to deploy driverless Wa...
- Open Access
- 16 March 2026
- Published by Taylor & Francis in Transportmetrica A: Transport Science
- p. 1-32
Route optimisation of truck-and-drone systems for multi-type rescue tasks: a heuristic approach
1. There are lots of natural and man-made disasters around the world, leading to severe damages (Abramson and Redlener 2012; P. Cui et al. 2011). To reduce the negative impacts of disasters, disast...
- 16 March 2026
- Published by Taylor & Francis in Transportmetrica A: Transport Science
- p. 1-32
Open AccessRoute optimisation of truck-and-drone systems for multi-type rescue tasks: a heuristic approach
1. There are lots of natural and man-made disasters around the world, leading to severe damages (Abramson and Redlener 2012; P. Cui et al. 2011). To reduce the negative impacts of disasters, disast...
- Open Access
- 3 March 2026
- Published by Elsevier in Transport Economics and Management
- Vol. 4, 60-74
Air-ground collaborative routing problem for parcel deliveries under soft time windows
- 3 March 2026
- Published by Elsevier in Transport Economics and Management
- Vol. 4, 60-74
Open AccessAir-ground collaborative routing problem for parcel deliveries under soft time windows
- Top Cited Papers
- 1 January 2026
- Published by Institute for Operations Research and the Management Sciences (INFORMS) in Transportation Science
- Vol. 60 (1) , 132-154
An Exact Algorithm to Solve Vehicle Routing Problem with Drones for Delivery and Surveillance Tasks After Disasters
Disasters cause severe economic and human losses, and delays in rescue efforts can lead to more deaths due to damaged infrastructure. To enhance post-disaster response efficiency, this study proposes a collaborative truck-and-drone system that leverages the high capacity of trucks and the speed and flexibility of drones to overcome road accessibility challenges. Although truck-drone collaborations have been studied in commercial logistics, their application in disaster relief remains understudied, particularly for simultaneous delivery and surveillance tasks, which are critical for saving lives and assessing damage. Unlike cost- or time-focused commercial logistics, humanitarian operations require prioritizing urgency, where tasks with higher mortality risks should be prioritized. This study addresses the truck-and-drone routing problem with flexible collaboration strategies for delivery and surveillance tasks to minimize the priority and penalty costs in the disaster response. We model the problem as a mixed integer linear programming model and develop an exact method based on the branch-and-bound algorithm and the Benders decomposition approach to solve the problem. Several valid inequalities are derived based on problem properties to improve the computational efficiency. Numerical experiments demonstrate that the proposed algorithm outperforms the state-of-the-art solver Gurobi in terms of objective function value, optimality gap, and computational time. The proposed flexible truck-and-drone collaboration can significantly enhance rescue efficiency in disaster response. Funding: The work described in this paper was partially supported by the National Natural Science Foundation of China [Grants 72371216 and 72301230] and the Research Grants Council of Hong Kong, China [Grants 17205124, 25223223, and T32-707-22]. Supplemental Material: The online appendices are available at https://doi.org/10.1287/trsc.2024.0987 .
- 1 January 2026
- Published by Institute for Operations Research and the Management Sciences (INFORMS) in Transportation Science
- Vol. 60 (1) , 132-154
Top Cited PapersAn Exact Algorithm to Solve Vehicle Routing Problem with Drones for Delivery and Surveillance Tasks After Disasters
Disasters cause severe economic and human losses, and delays in rescue efforts can lead to more deaths due to damaged infrastructure. To enhance post-disaster response efficiency, this study proposes a collaborative truck-and-drone system that leverages the high capacity of trucks and the speed and flexibility of drones to overcome road accessibility challenges. Although truck-drone collaborations have been studied in commercial logistics, their application in disaster relief remains understudied, particularly for simultaneous delivery and surveillance tasks, which are critical for saving lives and assessing damage. Unlike cost- or time-focused commercial logistics, humanitarian operations require prioritizing urgency, where tasks with higher mortality risks should be prioritized. This study addresses the truck-and-drone routing problem with flexible collaboration strategies for delivery and surveillance tasks to minimize the priority and penalty costs in the disaster response. We model the problem as a mixed integer linear programming model and develop an exact method based on the branch-and-bound algorithm and the Benders decomposition approach to solve the problem. Several valid inequalities are derived based on problem properties to improve the computational efficiency. Numerical experiments demonstrate that the proposed algorithm outperforms the state-of-the-art solver Gurobi in terms of objective function value, optimality gap, and computational time. The proposed flexible truck-and-drone collaboration can significantly enhance rescue efficiency in disaster response. Funding: The work described in this paper was partially supported by the National Natural Science Foundation of China [Grants 72371216 and 72301230] and the Research Grants Council of Hong Kong, China [Grants 17205124, 25223223, and T32-707-22]. Supplemental Material: The online appendices are available at https://doi.org/10.1287/trsc.2024.0987 .
- 17 December 2025
- Published by Elsevier in Transportation Research Part B: Methodological
- Vol. 204
Robust optimization for truck-and-drone collaboration with travel time uncertainties
- 17 December 2025
- Published by Elsevier in Transportation Research Part B: Methodological
- Vol. 204
Robust optimization for truck-and-drone collaboration with travel time uncertainties
- 7 November 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Intelligent Transportation Systems
- Vol. 25 (5) , 4206-4218
Optimal Control of Connected Autonomous Vehicles in a Mixed Traffic Corridor
This paper investigates the potential of improving the overall traffic and energy efficiency by properly controlling a proportion of controllable connected and autonomous vehicles (CAVs) in a mixed traffic corridor. Specifically, we develop a control framework that optimizes controllable CAV trajectories taking into account other vehicles for simultaneously improving traffic throughput and reducing the total energy consumption of all vehicles. The property of the control framework is firstly analytically examined in a simplified and tractable scenario where a human-driven vehicle (HV) follows a CAV. We found that the optimal acceleration is larger if one emphasizes more on improving travel distance within the optimization horizon, or smaller when one emphasizes more on saving energy. The continuous-time optimization model formulation is then discretized, which is solved for real-time application in a model predictive control (MPC) fashion. In numerical studies, the proposed method is tested in various scenarios, e.g., with/without an intersection, under different proportions of controllable CAVs, possible vehicle permutations, and varying overall traffic intensities. Numerical results show that the normalized energy consumption can be reduced by up to 45% and the average travel time reduced by 65%, showing a significant improvement in the road throughput. Notably, even with a limited number of controllable CAVs, the proposed method can achieve a promising performance, e.g., about 20% controllable CAVs can achieve half the benefits of a fully controllable CAV environment.
- 7 November 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Intelligent Transportation Systems
- Vol. 25 (5) , 4206-4218
Optimal Control of Connected Autonomous Vehicles in a Mixed Traffic Corridor
This paper investigates the potential of improving the overall traffic and energy efficiency by properly controlling a proportion of controllable connected and autonomous vehicles (CAVs) in a mixed traffic corridor. Specifically, we develop a control framework that optimizes controllable CAV trajectories taking into account other vehicles for simultaneously improving traffic throughput and reducing the total energy consumption of all vehicles. The property of the control framework is firstly analytically examined in a simplified and tractable scenario where a human-driven vehicle (HV) follows a CAV. We found that the optimal acceleration is larger if one emphasizes more on improving travel distance within the optimization horizon, or smaller when one emphasizes more on saving energy. The continuous-time optimization model formulation is then discretized, which is solved for real-time application in a model predictive control (MPC) fashion. In numerical studies, the proposed method is tested in various scenarios, e.g., with/without an intersection, under different proportions of controllable CAVs, possible vehicle permutations, and varying overall traffic intensities. Numerical results show that the normalized energy consumption can be reduced by up to 45% and the average travel time reduced by 65%, showing a significant improvement in the road throughput. Notably, even with a limited number of controllable CAVs, the proposed method can achieve a promising performance, e.g., about 20% controllable CAVs can achieve half the benefits of a fully controllable CAV environment.