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
关键词
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 条
[1]  
Adams M., 1996, AIR TRAFFIC CONTROL, V4, P281
[2]   Multiairport ground holding problem: A computational evaluation of exact algorithms [J].
Andreatta, G ;
Brunetta, L .
OPERATIONS RESEARCH, 1998, 46 (01) :57-64
[3]  
Andreatta G, 1997, MODELING SIMULATION, P71
[4]  
ANDREATTA G, 1996, GROUND HOLDING FREE
[5]  
ANDREATTA G, 1994, NEW FORMULATION MULT
[6]  
Andreatta G, 1993, LARGE SCALE COMPUTAT, P125
[7]  
BERTSIMAS DJ, 1998, IN PRESS OPERATIONS
[8]  
DELAHAYE D, 1994, GENETIC ALGORITHMS A
[9]  
*FAA, 1994, AV CAP ENH PLAN 1994
[10]  
JENNY M, 1997, AIR TRAFFIC CONTROL