Flood disasters often disrupt road networks and severely reduce ground accessibility, hindering the timely delivery of emergency supplies. To address this challenge, this study investigates a collaborative routing problem involving multiple vehicles and multiple UAVs under road disruptions and formulates a mixed-integer linear programming model that jointly minimizes mission makespan and priority-weighted response time for critical nodes. The model explicitly captures road feasibility, vehicle speeds affected by flood depth, multi-point UAV sorties, payload-dependent energy consumption, and vehicle–UAV spatiotemporal synchronization. To balance solution quality and scalability, a dual-track solution framework is developed: exact optimization is used for small instances, while a adaptive large neighborhood search algorithm with embedded dynamic programming is designed for larger instances. A case study based on the 2024 Guangdong flood with 135 demand points shows that the heuristic can obtain high-quality solutions efficiently and outperforms time-limited MILP solutions on large instances. Comparative experiments further demonstrate that multi-point sorties, integrated coordination, and embedded sortie refinement are all crucial to performance improvement. Sensitivity analysis indicates that setting the trade-off coefficient α within 0.2–0.8 provides a robust balance between overall mission efficiency and timely response to critical nodes.
Dong et al. (2026) studied this question.