Slot Allocation in a Multi-airport System under Flying Time Uncertainty

被引:2
作者
Liu, Chang [1 ,2 ]
Liao, Chaohao [3 ]
Hang, Xu [3 ]
Wang, Yanjun [1 ,2 ]
Delahaye, Daniel [4 ]
机构
[1] Nanjing Univ Aeronaut & Astronaut, Coll Civil Aviat, Nanjing 211106, Peoples R China
[2] State Key Lab Air Traff Management Syst, Nanjing 211106, Peoples R China
[3] Air Traff Management Bur Cent South China, Guangzhou 510405, Peoples R China
[4] Ecole Natl Aviat Civile, ENAC Res Lab, F-31055 Toulouse, France
基金
中国国家自然科学基金;
关键词
Slot Allocation; Multi-airport System; Uncertainty Model; Chance Constraint; OPTIMIZATION; MODEL; SEARCH;
D O I
10.2322/tjsass.67.127
中图分类号
V [航空、航天];
学科分类号
08 ; 0825 ;
摘要
Slot allocation in a single airport aims to maximize the utilization of airport -declared capacity under operational and regulation constraints, while that in a multi -airport system (MAS) has to take airspace capacity into account. This is due to the fact that the conflict of using the limited capacity of certain departure/arrival fixes in the terminal airspace could induce unnecessary flight delays. The uncertainty of flying times between the airport and congested fixes makes it even more complicated for slot allocation in a MAS. Traffic flow may exceed capacity when the flying times of flights change. In this paper, the authors propose an uncertainty slot allocation model for a MAS (USAM). The objective of the model is to minimize the total displacement of slot requests in the MAS while considering all of the capacity constraints, as well as the uncertainty of flying time. The constraints of departure/arrival fixes are formulated as chance constraints, and then the Lyapunov theorem is applied for reformulation. The USAM is applied in the MAS of the Guangdong -Hong KongMacao Greater Bay Area (GBA). Specifically, the impact of the uncertainty of flying times from five airports to airspace fix YIN is investigated. Results show that the total displacement would increase if the uncertainty of flying time was considered. The optimized schedule using the USAM, however, is more robust and can satisfy capacity constraints under various scenarios.
引用
收藏
页码:127 / 135
页数:9
相关论文
共 23 条
[1]   Modeling and solving a bi-objective airport slot scheduling problem [J].
Androutsopoulos, Konstantinos N. ;
Manousakis, Eleftherios G. ;
Madas, Michael A. .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2020, 284 (01) :135-151
[2]   Heuristic search for allocation of slots at network level [J].
Benlic, Una .
TRANSPORTATION RESEARCH PART C-EMERGING TECHNOLOGIES, 2018, 86 :488-509
[3]  
Blackmore L., 2006, AIAA GUIDANCE NAVIGA, P6240
[4]   Resource-constrained project scheduling: Notation, classification, models, and methods [J].
Brucker, P ;
Drexl, A ;
Mohring, R ;
Neumann, K ;
Pesch, E .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1999, 112 (01) :3-41
[5]  
Castelli Lorenzo, 2012, International Journal of Revenue Management, V6, P28, DOI 10.1504/IJRM.2012.044514
[6]   CHANCE-CONSTRAINED PROGRAMMING [J].
CHARNES, A ;
COOPER, WW .
MANAGEMENT SCIENCE, 1959, 6 (01) :73-79
[7]   The time slot allocation problem under uncertain capacity [J].
Corolli, Luca ;
Lulli, Guglielmo ;
Ntaimo, Lewis .
TRANSPORTATION RESEARCH PART C-EMERGING TECHNOLOGIES, 2014, 46 :16-29
[8]  
Cuzzocrea Alfredo, 2021, ICCBDC 2021: 2021 5th International Conference on Cloud and Big Data Computing (ICCBDC), P34, DOI 10.1145/3481646.3481652
[9]   Metric regularity and quantitative stability in stochastic programs with probabilistic constraints [J].
Henrion, R ;
Römisch, W .
MATHEMATICAL PROGRAMMING, 1999, 84 (01) :55-88
[10]   A decision making framework for incorporating fairness in allocating slots at capacity-constrained airports [J].
Jiang, Yu ;
Zografos, Konstantinos G. .
TRANSPORTATION RESEARCH PART C-EMERGING TECHNOLOGIES, 2021, 126