Skip to content
DraconiticResearch
Search Sources API
190,869 studies31 sourcesUpdated 24 min ago
Peer-reviewedCC BY-NC-NDNaval Research Logistics

On a fair and risk-averse urban air mobility resource allocation problem under demand and capacity uncertainties

Abstract

Urban air mobility (UAM) is an emerging air transportation mode to alleviate the ground traffic burden and achieve zero direct aviation emissions. Due to the potential economic scaling effects, the UAM traffic flow is expected to increase dramatically once implemented, and its market can be substantially large. To be prepared for the era of UAM, we study the fair and risk‐averse urban air mobility resource allocation model (FairUAM) under passenger demand and airspace capacity uncertainties for fair, safe, and efficient aircraft operations. FairUAM is a two‐stage model, where the first stage is the aircraft resource allocation, and the second stage is to fairly and efficiently assign the ground and airspace delays to each aircraft provided the realization of random airspace capacities and passenger demand. We show that FairUAM is NP‐hard even when there is no delay assignment decision or no aircraft allocation decision. Thus, we recast FairUAM as a mixed‐integer linear program (MILP) and explore model properties and strengthen the model formulation by developing multiple families of valid inequalities. The stronger formulation allows us to develop a customized exact decomposition algorithm with both benders and L‐shaped cuts, which significantly outperforms the off‐the‐shelf solvers. Finally, we numerically demonstrate the effectiveness of the proposed method and draw managerial insights when applying FairUAM to a real‐world network.

Related

  1. Optimal Dynamic Resource Allocation for Multicore Real-time Systems
    Georgiy A. Bondar, Abigail Eisenklam, Ripon C. Sarker +2
    arXivPreprintarXiv licenceFull textOptimisation & controlarXiv
  2. A Resource Allocation Tournament
    Adam Nathaniel, Refael Hassin
    arXivPreprintarXiv licenceFull textOptimisation & controlarXiv
  3. Multi-view Semantic-aware Resource Allocation for Edge AI
    Jiawei Luo, Hussein Saleh, Mohamad Assaad
    arXivPreprintarXiv licenceFull textGeneral mathematicsarXiv
  4. Efficient Joint Trajectory Optimization and Resource Allocation for Secure UAV Networks: A Deep Reinforcement Learning Approach
    Abdulmalik Alwarafy, Mohamed Hayajneh, Mustafa Al Juboori +4
    arXivPreprintCC BY 4.0Full textGeneral mathematicsarXiv
  5. Neutral-Atom-based Quantum Optimization for Resource Allocation in NOMA Networks
    Patatchona Keyela, Remon Polus, Soumaya Cherkaoui +1
    arXivPreprintarXiv licenceFull textGeneral mathematicsarXiv
BibTeX
@article{sun2026fair,
  title = {{On a fair and risk-averse urban air mobility resource allocation problem under demand and capacity uncertainties}},
  author = {Luying Sun and Haoyun Deng and Peng Wei and Weijun Xie},
  journal = {Naval Research Logistics},
  year = {2026},
  month = oct,
  doi = {10.1002/nav.22217},
  url = {https://hal.science/hal-05783689v1},
  note = {CC BY-NC-ND},
}
RIS
TY  - JOUR
TI  - On a fair and risk-averse urban air mobility resource allocation problem under demand and capacity uncertainties
AU  - Luying Sun
AU  - Haoyun Deng
AU  - Peng Wei
AU  - Weijun Xie
PY  - 2026
DA  - 2026/10/07
JO  - Naval Research Logistics
DO  - 10.1002/nav.22217
UR  - https://hal.science/hal-05783689v1
AB  - Urban air mobility (UAM) is an emerging air transportation mode to alleviate the ground traffic burden and achieve zero direct aviation emissions. Due to the potential economic scaling effects, the UAM traffic flow is expected to increase dramatically once implemented, and its market can be substantially large. To be prepared for the era of UAM, we study the fair and risk‐averse urban air mobility resource allocation model (FairUAM) under passenger demand and airspace capacity uncertainties for fair, safe, and efficient aircraft operations. FairUAM is a two‐stage model, where the first stage is the aircraft resource allocation, and the second stage is to fairly and efficiently assign the ground and airspace delays to each aircraft provided the realization of random airspace capacities and passenger demand. We show that FairUAM is NP‐hard even when there is no delay assignment decision or no aircraft allocation decision. Thus, we recast FairUAM as a mixed‐integer linear program (MILP) and explore model properties and strengthen the model formulation by developing multiple families of valid inequalities. The stronger formulation allows us to develop a customized exact decomposition algorithm with both benders and L‐shaped cuts, which significantly outperforms the off‐the‐shelf solvers. Finally, we numerically demonstrate the effectiveness of the proposed method and draw managerial insights when applying FairUAM to a real‐world network.
SN  - 0894-069X
SN  - 1520-6750
ER  -