Stochastic Corridor–Time Network Capacity Planning for Low‐Altitude Airspace Systems

Regulators in China, the United States, and the European Union now provide low‐altitude airspace access as priced, time‐windowed corridor authorizations, booked in advance and forfeited if unused. We ask how much capacity a UAV logistics planner should reserve on each corridor–time unit before demand is realized, to maximize expected profit net of reservation cost. Reserved capacity cannot be transferred across corridors or time windows and is consumed jointly along time‐respecting paths, so reservations are coupled through the network in ways that models with exogenous airspace capacity cannot capture. We formulate a two‐stage stochastic program whose recourse selects and routes accepted requests on a time‐expanded network, prove its arc‐based and path‐packing forms equivalent, and solve it by Benders decomposition with column‐generated subproblems. The decomposition operates on the LP relaxation, and all reported reservation and routing decisions are recovered as integer plans. Computational experiments achieve single‐digit LP‐Benders gaps on moderate‐sized networks and extend to much larger instances through a truncated‐path approach. A Shenzhen case study shows reservations concentrating on structurally central corridors, with demand level and reservation price having more influence on the quantity of capacity reserved than the selection of corridors.

Authors

Institutions

Publication Details

Journal
Networks
Published
2026-11-18
DOI
https://doi.org/10.1002/net.70090
Primary Topic
Air Traffic Management and Optimization
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
NOV
article

Stochastic Corridor–Time Network Capacity Planning for Low‐Altitude Airspace Systems

Yanlu Zhao, Yipu Yao, Li Ding
1 links
Networks
Air Traffic Management and Optimization
article

Stochastic Corridor–Time Network Capacity Planning for Low‐Altitude Airspace Systems

Yanlu Zhao, Yipu Yao, Li Ding
article en

Abstract

Regulators in China, the United States, and the European Union now provide low‐altitude airspace access as priced, time‐windowed corridor authorizations, booked in advance and forfeited if unused. We ask how much capacity a UAV logistics planner should reserve on each corridor–time unit before demand is realized, to maximize expected profit net of reservation cost. Reserved capacity cannot be transferred across corridors or time windows and is consumed jointly along time‐respecting paths, so reservations are coupled through the network in ways that models with exogenous airspace capacity cannot capture. We formulate a two‐stage stochastic program whose recourse selects and routes accepted requests on a time‐expanded network, prove its arc‐based and path‐packing forms equivalent, and solve it by Benders decomposition with column‐generated subproblems. The decomposition operates on the LP relaxation, and all reported reservation and routing decisions are recovered as integer plans. Computational experiments achieve single‐digit LP‐Benders gaps on moderate‐sized networks and extend to much larger instances through a truncated‐path approach. A Shenzhen case study shows reservations concentrating on structurally central corridors, with demand level and reservation price having more influence on the quantity of capacity reserved than the selection of corridors.

Networks
Durham University (GB), Renmin University of China (CN)
Industry, innovation and infrastructure, Sustainable cities and communities
Air Traffic Management and Optimization
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Laika access coming soon