The flow management problem: recent computational algorithms

被引：8
作者：
Andreatta, G
Brunetta, L
Guastalla, G
机构：
[1] Univ Padua, Dipartimento Matemat Pura & Applicata, I-35131 Padua, Italy
[2] Politecn Milan, Dipartimento Elettron & Informat, I-20133 Milan, Italy
[3] MIT, Ctr Operat Res, Cambridge, MA 02139 USA
来源：
CONTROL ENGINEERING PRACTICE | 1998年 / 6卷 / 06期
关键词：
air traffic control; models; combinatorial mathematics; heuristics; integer programming;
D O I：
10.1016/S0967-0661(98)00078-1
中图分类号：
TP [自动化技术、计算机技术];
学科分类号：
0812 ;
摘要：
The air traffic flow management problem, together with various policies to address it, is described in this paper. A survey of optimization algorithms for the ground-holding (and 'free flight') policies is provided. An exact algorithm, based on the integration of a heuristic algorithm with an integer linear programming model is presented next. This approach provides exact solutions in a much shorter computational time than previous algorithms proposed in the literature. Computational results for large-size instances with over 20 000 flights based on the OAG data for a full day in the USA air traffic network are reported. (C) 1998 Elsevier Science Ltd. All rights reserved.
引用
收藏
页码：727 / 733
页数：7
相关论文
共 19 条
[11]  
MATOS P, 1996, OPTIMISATION MODELS
[12]  
MATOS P, 1995, APPL OPERATIONAL RES
[13]  
MUGIS L, 1995, MATH PROGRAMMING AIR
[14]  
NAVAZIO L, 1995, IN PRESS TRANSPORTAT
[15]  
Odoni A.R., 1997, EXISTING REQUIRED MO
[16]  
Odoni A. R., 1987, Flow Control of Congested Networks, P269, DOI [DOI 10.1007/978-3-642-86726-2, 10.1007/978-3-642-86726-2_17, DOI 10.1007/978-3-642-86726-2_17]
[17]   OPTIMAL-ALGORITHMS AND A REMARKABLY EFFICIENT HEURISTIC FOR THE GROUND-HOLDING PROBLEM IN AIR-TRAFFIC-CONTROL [J].
RICHETTA, O .
OPERATIONS RESEARCH, 1995, 43 (05) :758-770
[18]  
Vranas P.B.M., 1996, AIR TRAFFIC CONTROL, V4, P249, DOI [10.2514/atcq.4.4.249, DOI 10.2514/ATCQ.4.4.249]
[19]   THE MULTI-AIRPORT GROUND-HOLDING PROBLEM IN AIR-TRAFFIC-CONTROL [J].
VRANAS, PB ;
BERTSIMAS, DJ ;
ODONI, AR .
OPERATIONS RESEARCH, 1994, 42 (02) :249-261
12