Range-Feasibility Blindness in Urban UAV Logistics: A Feasibility-Embedded Location–Routing Framework for Infrastructure Planning

Existing unmanned aerial vehicle (UAV) urban logistics planning follows a sequential paradigm—depot siting first, routing second—that embeds a structural information loss. Straight-line distance screening systematically overestimates the feasible service radius of candidate depots, creating a blindzone of depot–demand pairs that appear reachable but prove operationally infeasible under road network distances. We term this range-feasibility blindness and derive its analytical radius $\Delta =R_{max}(\alpha -1)/\left(2\alpha \right)$, where $\alpha$ is the road-to-straight-line distance ratio. Empirical measurement across three Chinese urban districts confirms $\alpha \in [1.40,1.52]$ and blindzone radii exceeding 2.8 km, establishing the phenomenon as a systemic property of high-density urban road geometry. To eliminate this failure by construction, we formulate a feasibility-embedded location–routing mixed-integer linear programme (MILP) that enforces road network range constraints simultaneously with depot opening decisions, making blindzone configurations implicitly inadmissible. A structure-aware Adaptive Large Neighbourhood Search (ALNS) solves the model at practical scales. Benchmark experiments on Dongli District (Tianjin) show cost reductions of 20.6–28.2% over greedy sequential baselines across three demand scenarios, with gains increasing monotonically with instance scale; cross-city experiments in Beijing and Shanghai confirm consistent improvement averaging 11.4% (Chaoyang, Beijing) and 10.2% (Pudong, Shanghai) over greedy initialisation across diverse urban morphologies. These results position joint optimisation as a necessary methodological shift for city-scale UAV infrastructure planning.