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

被引:0
作者
Sun, Luying [1 ]
Deng, Haoyun [2 ]
Wei, Peng [3 ]
Xie, Weijun [2 ]
机构
[1] Virginia Tech, Dept Ind & Syst Engn, Blacksburg, VA USA
[2] Georgia Inst Technol, H Milton Stewart Sch Ind & Syst Engn, Atlanta, GA 30332 USA
[3] George Washington Univ, Dept Mech & Aerosp Engn, Washington, DC USA
基金
美国国家科学基金会;
关键词
fairness; mixed-integer linear programming; resource allocation; risk-averse; urban air mobility; TRAFFIC FLOW MANAGEMENT; MIN-MAX FAIRNESS; DECOMPOSITION ALGORITHM; TRANSPORTATION; OPTIMIZATION; FRAMEWORK; MODEL; TIME;
D O I
10.1002/nav.22217
中图分类号
C93 [管理学]; O22 [运筹学];
学科分类号
070105 ; 12 ; 1201 ; 1202 ; 120202 ;
摘要
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.
引用
收藏
页码:111 / 132
页数:22
相关论文
共 61 条
[1]   A scenario decomposition algorithm for 0-1 stochastic programs [J].
Ahmed, Shabbir .
OPERATIONS RESEARCH LETTERS, 2013, 41 (06) :565-569
[2]   Partitioning procedures for solving mixed-variables programming problems [J].
Benders, J. F. .
COMPUTATIONAL MANAGEMENT SCIENCE, 2005, 2 (01) :3-19
[3]   Passenger-centric Urban Air Mobility: Fairness trade-offs and operational efficiency [J].
Bennaceur, Mehdi ;
Delmas, Remi ;
Hamadi, Youssef .
TRANSPORTATION RESEARCH PART C-EMERGING TECHNOLOGIES, 2022, 136
[4]   An Integer Optimization Approach to Large-Scale Air Traffic Flow Management [J].
Bertsimas, Dimitris ;
Lulli, Guglielmo ;
Odoni, Amedeo .
OPERATIONS RESEARCH, 2011, 59 (01) :211-227
[5]   Minimum-Violation Traffic Management for Urban Air Mobility [J].
Bharadwaj, Suda ;
Wongpiromsarn, Tichakorn ;
Neogi, Natasha ;
Muffoletto, Joseph ;
Topcu, Ufuk .
NASA FORMAL METHODS (NFM 2021), 2021, 12673 :37-52
[6]   Traffic Management for Urban Air Mobility [J].
Bharadwaj, Suda ;
Carr, Steven ;
Neogi, Natasha ;
Poonawala, Hasan ;
Chueca, Alejandro Barberia ;
Topcu, Ufuk .
NASA FORMAL METHODS (NFM 2019), 2019, 11460 :71-87
[7]  
Brittain M., 2020, DEEP MULTIAGENT REIN
[8]   Air traffic flow management under uncertainty using chance-constrained optimization [J].
Chen, J. ;
Chen, L. ;
Sun, D. .
TRANSPORTATION RESEARCH PART B-METHODOLOGICAL, 2017, 102 :124-141
[9]   Efficiency and Fairness in Unmanned Air Traffic Flow Management [J].
Chin, Christopher ;
Gopalakrishnan, Karthik ;
Egorov, Maxim ;
Evans, Antony ;
Balakrishnan, Hamsa .
IEEE TRANSACTIONS ON INTELLIGENT TRANSPORTATION SYSTEMS, 2021, 22 (09) :5939-5951
[10]   Combinatorial benders' cuts for mixed-integer linear programming [J].
Codato, Gianni ;
Fischetti, Matteo .
OPERATIONS RESEARCH, 2006, 54 (04) :756-766