Yuying Long
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Yuying Long has a total of 15 co-authors. Here are the top co-authors by number of shared publications:
- Gangyan Xu
The Hong Kong Polytechnic University
8 shared publications - Binglei Xie
School of Architecture, Harbin Institute of Technology (Shenzhen), Shenzhen 518000, China
2 shared publications - Jinqiu Zhao
School of Architecture, Harbin Institute of Technology (Shenzhen), Shenzhen, China
2 shared publications - Xuanyu Zhang2 shared publications
- Yongwu Liu
School of Architecture, Harbin Institute of Technology, Shenzhen, China
2 shared publications Binglei Xie
School of Architecture, Harbin Institute of Technology, Shenzhen, China
1 shared publication
Latest Publications
- Open Access
- 26 May 2026
- Published by Elsevier in SSRN Electronic Journal
Proactive Relief Vehicle Scheduling with Temporary Facility Location and Volunteer Vehicle Coordination
The increasing frequency and severity of natural disasters have intensified the need for rapid and coordinated relief operations. However, scheduling relief vehicles is challenging when emergency demand changes over time and spontaneous volunteer vehicles arrive during the response. Prior studies usually locate facilities under assumed demand distributions, schedule a fixed local fleet, or treat volunteer vehicles as available from the start. To address these gaps, we formulate a dynamic vehicle scheduling problem with temporary facility location and volunteer vehicle coordination as a time-space network flow model. We then develop a rolling horizon scheduling framework along with a proactive vehicle redeployment strategy that jointly decides when to open temporary facilities, how to coordinate newly arrived volunteer vehicles, and how to redeploy idle vehicles before demand is fully revealed. Computational experiments are conducted to derive planning insights on the conditions under which temporary facilities, local fleet expansion, volunteer vehicle coordination, and proactive redeployment improve or worsen response performance. Results show that proactive scheduling is not always beneficial. Its value depends on the distribution of demand sites, temporary facility availability, and volunteer vehicle arrival timing. Temporary facilities are most useful when demand sites are spatially clustered, but may add limited value under dispersed demand and tight facility budgets. Early volunteer vehicle arrivals reduce initial backlogs, whereas delayed or spread-out arrivals provide smaller benefits. These findings provide decision-support insights for public emergency managers on how to allocate limited facility, fleet, and volunteer resources under dynamically evolving disaster situations.
- 26 May 2026
- Published by Elsevier in SSRN Electronic Journal
Open AccessProactive Relief Vehicle Scheduling with Temporary Facility Location and Volunteer Vehicle Coordination
The increasing frequency and severity of natural disasters have intensified the need for rapid and coordinated relief operations. However, scheduling relief vehicles is challenging when emergency demand changes over time and spontaneous volunteer vehicles arrive during the response. Prior studies usually locate facilities under assumed demand distributions, schedule a fixed local fleet, or treat volunteer vehicles as available from the start. To address these gaps, we formulate a dynamic vehicle scheduling problem with temporary facility location and volunteer vehicle coordination as a time-space network flow model. We then develop a rolling horizon scheduling framework along with a proactive vehicle redeployment strategy that jointly decides when to open temporary facilities, how to coordinate newly arrived volunteer vehicles, and how to redeploy idle vehicles before demand is fully revealed. Computational experiments are conducted to derive planning insights on the conditions under which temporary facilities, local fleet expansion, volunteer vehicle coordination, and proactive redeployment improve or worsen response performance. Results show that proactive scheduling is not always beneficial. Its value depends on the distribution of demand sites, temporary facility availability, and volunteer vehicle arrival timing. Temporary facilities are most useful when demand sites are spatially clustered, but may add limited value under dispersed demand and tight facility budgets. Early volunteer vehicle arrivals reduce initial backlogs, whereas delayed or spread-out arrivals provide smaller benefits. These findings provide decision-support insights for public emergency managers on how to allocate limited facility, fleet, and volunteer resources under dynamically evolving disaster situations.
- 23 April 2026
- Published by Elsevier in European Journal of Operational Research
- Vol. 334 (1) , 85-95
Data-driven electric vehicle fleet sizing for airport baggage transport via a two-stage shareability network
- 23 April 2026
- Published by Elsevier in European Journal of Operational Research
- Vol. 334 (1) , 85-95
Data-driven electric vehicle fleet sizing for airport baggage transport via a two-stage shareability network
- 18 September 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Automation Science and Engineering
- Vol. 22 (15455955) , 21195-21211
Learning-Based Heterogeneous Autonomous Vehicles Scheduling for On-Demand Last-Mile Transportation
Last-mile transportation, a critical component of public transit within integrated urban mobility systems, plays a pivotal role in promoting sustainability and requires immediate attention. However, due to the high real-time variability and uncertainties of last-mile travel demand, high passenger concurrency, and dispersed destinations, existing last-mile transportation systems often encounter significant challenges. These challenges include resource shortages and congestion during peak hours, as well as high operational costs and excessive passenger waiting times during off-peak periods. With the rapid development and widespread adoption of autonomous vehicles, which are characterized by centralized control and flexible scheduling, this study proposes leveraging heterogeneous autonomous vehicles to address these challenges. Specifically, a mixed-integer programming model is developed to maximize the service provider’s profit by considering fare profit, passenger waiting time penalties, and operating costs. To enable real-time decision-making, then an attention-based deep reinforcement learning algorithm is introduced. This algorithm incorporates two decoder mechanisms for vehicle selection and passenger allocation in the scheduling of heterogeneous autonomous vehicles. This involves dynamically selecting vehicles from a heterogeneous fleet based on passenger demand using an attention mechanism, optimizing efficiency in serving last-mile travelers. Extensive numerical experiments and a real-world case study across various datasets demonstrate that the proposed service model and algorithm effectively solve the scheduling problem while meeting the demands of on-demand last-mile transportation. Furthermore, these innovations contribute to reducing fleet carbon emissions and advancing sustainable urban transportation.
- 18 September 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Automation Science and Engineering
- Vol. 22 (15455955) , 21195-21211
Learning-Based Heterogeneous Autonomous Vehicles Scheduling for On-Demand Last-Mile Transportation
Last-mile transportation, a critical component of public transit within integrated urban mobility systems, plays a pivotal role in promoting sustainability and requires immediate attention. However, due to the high real-time variability and uncertainties of last-mile travel demand, high passenger concurrency, and dispersed destinations, existing last-mile transportation systems often encounter significant challenges. These challenges include resource shortages and congestion during peak hours, as well as high operational costs and excessive passenger waiting times during off-peak periods. With the rapid development and widespread adoption of autonomous vehicles, which are characterized by centralized control and flexible scheduling, this study proposes leveraging heterogeneous autonomous vehicles to address these challenges. Specifically, a mixed-integer programming model is developed to maximize the service provider’s profit by considering fare profit, passenger waiting time penalties, and operating costs. To enable real-time decision-making, then an attention-based deep reinforcement learning algorithm is introduced. This algorithm incorporates two decoder mechanisms for vehicle selection and passenger allocation in the scheduling of heterogeneous autonomous vehicles. This involves dynamically selecting vehicles from a heterogeneous fleet based on passenger demand using an attention mechanism, optimizing efficiency in serving last-mile travelers. Extensive numerical experiments and a real-world case study across various datasets demonstrate that the proposed service model and algorithm effectively solve the scheduling problem while meeting the demands of on-demand last-mile transportation. Furthermore, these innovations contribute to reducing fleet carbon emissions and advancing sustainable urban transportation.
- 24 December 2024
- Published by Elsevier in Expert Systems with Applications
- Vol. 267
A matheuristic solution for efficient scheduling in dynamic truck–drone collaboration
- 24 December 2024
- Published by Elsevier in Expert Systems with Applications
- Vol. 267
A matheuristic solution for efficient scheduling in dynamic truck–drone collaboration
- 16 October 2024
- Published by Elsevier in Advanced Engineering Informatics
- Vol. 62
Dynamic heterogeneous resource allocation in post-disaster relief operation considering fairness
- 16 October 2024
- Published by Elsevier in Advanced Engineering Informatics
- Vol. 62
Dynamic heterogeneous resource allocation in post-disaster relief operation considering fairness
- 22 April 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Internet of Things Journal
- Vol. 11 (13) , 24134-24147
Hybrid Heuristic-Based Multi-UAV Route Planning for Time-Dependent Data Collection
Unmanned Aerial Vehicle (UAV) has been increasingly adopted for IoT data collection in large-scale scenarios that are with less or even no network coverage. Efficient UAV route planning is a vital part of such a UAV-based data collection process, which is recognized to be complex and challenging, especially considering that the amount of data collected is dependent on UAV visit time and service time and many coupled decisions are involved. Taking these challenges into consideration, this paper proposes a new hybrid heuristics-based UAV route planning method for IoT data collection. Specifically, the relationships among UAV service time, data amount, and data collection time windows of IoT devices are analyzed first, then an integrated route planning model for multiple UAVs is developed. After that, an innovative Hybrid Tabu Search-Variable Neighborhood Descent (HTS-VND) algorithm is developed, with six effective operators that could further improve computing efficiency and solution quality. Finally, extensive experimental case studies are conducted. The proposed method can efficiently improve the collected data amount compared to existing methods in medium-scale and large-scale scenarios.
- 22 April 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Internet of Things Journal
- Vol. 11 (13) , 24134-24147
Hybrid Heuristic-Based Multi-UAV Route Planning for Time-Dependent Data Collection
Unmanned Aerial Vehicle (UAV) has been increasingly adopted for IoT data collection in large-scale scenarios that are with less or even no network coverage. Efficient UAV route planning is a vital part of such a UAV-based data collection process, which is recognized to be complex and challenging, especially considering that the amount of data collected is dependent on UAV visit time and service time and many coupled decisions are involved. Taking these challenges into consideration, this paper proposes a new hybrid heuristics-based UAV route planning method for IoT data collection. Specifically, the relationships among UAV service time, data amount, and data collection time windows of IoT devices are analyzed first, then an integrated route planning model for multiple UAVs is developed. After that, an innovative Hybrid Tabu Search-Variable Neighborhood Descent (HTS-VND) algorithm is developed, with six effective operators that could further improve computing efficiency and solution quality. Finally, extensive experimental case studies are conducted. The proposed method can efficiently improve the collected data amount compared to existing methods in medium-scale and large-scale scenarios.
- 1 October 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 3894-3899
Integrated Tractor and Trailer Scheduling for Airport Baggage Transport Service
Airport baggage transport is a key aspect of airport ground handling which involves transporting passenger baggage between the baggage handling center and aircraft stands. Typically, tractors and trailers are used to implement the baggage transport service under the drop-and-pull mode in practice. Efficient airport baggage transport service is essential to reduce flight delays, save airport ground handling costs, and guarantee aviation safety. However, the existing methods for scheduling tractors and trailers perform poorly when dealing with high flight volumes at busy hub airports, leading to delayed responses for baggage transport demands. Besides, few works have explored the significance of the drop-and-pull mode in improving airport baggage transport service equality. Thus, to enhance the efficiency of airport baggage transport service and reduce airport ground handling costs, this paper presents an integrated tractor and trailer scheduling problem under the drop-and-pull mode. Then, an improved Genetic Algorithm (GA) is developed to solve this problem. Finally, simulation experiments are conducted to verify the effectiveness of the model and algorithm.
- 1 October 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 3894-3899
Integrated Tractor and Trailer Scheduling for Airport Baggage Transport Service
Airport baggage transport is a key aspect of airport ground handling which involves transporting passenger baggage between the baggage handling center and aircraft stands. Typically, tractors and trailers are used to implement the baggage transport service under the drop-and-pull mode in practice. Efficient airport baggage transport service is essential to reduce flight delays, save airport ground handling costs, and guarantee aviation safety. However, the existing methods for scheduling tractors and trailers perform poorly when dealing with high flight volumes at busy hub airports, leading to delayed responses for baggage transport demands. Besides, few works have explored the significance of the drop-and-pull mode in improving airport baggage transport service equality. Thus, to enhance the efficiency of airport baggage transport service and reduce airport ground handling costs, this paper presents an integrated tractor and trailer scheduling problem under the drop-and-pull mode. Then, an improved Genetic Algorithm (GA) is developed to solve this problem. Finally, simulation experiments are conducted to verify the effectiveness of the model and algorithm.
- Top Cited Papers
- 24 August 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Engineering Management
- Vol. 71 (00189391) , 9826-9838
Dynamic Truck–UAV Collaboration and Integrated Route Planning for Resilient Urban Emergency Response
Efficient urban emergency response is vital for saving lives and property after disasters. However, urban emergency response is challenging because it involves many demands, with a very tight time for making decisions, and is frequently threatened by the disruption of road networks and infrastructures. Taking these challenges into consideration, this article proposes a dynamic truck-UAV (DTU) collaboration strategy to realize efficient and resilient urban emergency response. Specifically, a DTU collaboration strategy is first proposed based on the characteristics of urban emergency management. Then, an integrated truck-UAV collaborative scheduling model is developed and indicated to be an NP-hard problem. Then, a tabu search-based integrated (TSI) scheduling algorithm is developed, with several tailored local search operators and a recursion-based evaluation (RE) algorithm. Finally, comprehensive experiments are conducted to demonstrate the superiority of our proposed strategy over existing truck-UAV collaboration strategies and verify the performance of our proposed solution algorithm. Managerial Relevance Statement—This article proposes a dynamic truck-UAV (DTU) collaboration strategy and a corresponding route planning method for urban emergency response. The findings of this work demonstrate that emergency management agencies can utilize the DTU collaboration strategy for efficient emergency response in urban areas with high-density road networks. Meanwhile, the emergency response under this strategy is resilient to cope with different degrees of road network disruptions. In addition, the DTU collaboration strategy shows a distinct improvement over the parallel and truck-UAV flying sidekick strategies in large-scale emergency response scenarios, and it will perform better when demand density increases. Furthermore, the proposed integrated scheduling algorithm is demonstrated to be suitable and efficient for solving the routing problems associated with the DTU collaboration strategy.
- 24 August 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Engineering Management
- Vol. 71 (00189391) , 9826-9838
Top Cited PapersDynamic Truck–UAV Collaboration and Integrated Route Planning for Resilient Urban Emergency Response
Efficient urban emergency response is vital for saving lives and property after disasters. However, urban emergency response is challenging because it involves many demands, with a very tight time for making decisions, and is frequently threatened by the disruption of road networks and infrastructures. Taking these challenges into consideration, this article proposes a dynamic truck-UAV (DTU) collaboration strategy to realize efficient and resilient urban emergency response. Specifically, a DTU collaboration strategy is first proposed based on the characteristics of urban emergency management. Then, an integrated truck-UAV collaborative scheduling model is developed and indicated to be an NP-hard problem. Then, a tabu search-based integrated (TSI) scheduling algorithm is developed, with several tailored local search operators and a recursion-based evaluation (RE) algorithm. Finally, comprehensive experiments are conducted to demonstrate the superiority of our proposed strategy over existing truck-UAV collaboration strategies and verify the performance of our proposed solution algorithm. Managerial Relevance Statement—This article proposes a dynamic truck-UAV (DTU) collaboration strategy and a corresponding route planning method for urban emergency response. The findings of this work demonstrate that emergency management agencies can utilize the DTU collaboration strategy for efficient emergency response in urban areas with high-density road networks. Meanwhile, the emergency response under this strategy is resilient to cope with different degrees of road network disruptions. In addition, the DTU collaboration strategy shows a distinct improvement over the parallel and truck-UAV flying sidekick strategies in large-scale emergency response scenarios, and it will perform better when demand density increases. Furthermore, the proposed integrated scheduling algorithm is demonstrated to be suitable and efficient for solving the routing problems associated with the DTU collaboration strategy.