Scheduling models for air traffic control in terminal areas

被引:82
作者
Bianco, L
Dell'Olmo, P
Giordani, S
机构
[1] Univ Roma Tor Vergata, Dip Ingn Impresa, I-00133 Rome, Italy
[2] CNR, Ist Anal Sistemi & Informat Antonio Ruberti, I-00185 Rome, Italy
[3] Univ Roma Tor Vergata, Dip Stat Probabil & Stat Applicate, I-00185 Rome, Italy
关键词
air traffic control; aircraft scheduling problem; job-shop; set-up time; local search algorithms;
D O I
10.1007/s10951-006-6779-7
中图分类号
T [工业技术];
学科分类号
08 ;
摘要
We propose a job-shop scheduling model with sequence dependent set-up times and release dates to coordinate both inbound and outbound traffic flows on all the prefixed routes of an airport terminal area and all aircraft operations at the runway complex. The proposed model is suitable for representing several operational constraints (e.g., longitudinal and diagonal separations in specific airspace regions), and different runway configurations (e.g., crossing, parallel, with or without dependent approaches) in a uniform framework. The complexity and the highly dynamic nature of the problem call for heuristic approaches. We propose a fast dynamic local search heuristic algorithm for the job-shop model suitable for considering one of the different performance criteria and embedding aircraft position shifting control technique to limit the controllers/pilots' workload. Finally, we describe in detail the experimental analysis of the proposed model and algorithm applied to two real case studies of Milan-Malpensa and Rome-Fiumicino airport terminal areas.
引用
收藏
页码:223 / 253
页数:31
相关论文
共 25 条
[1]  
Allahverdi A., 2000, International Transactions in Operational Research, V7, P245, DOI 10.1111/j.1475-3995.2000.tb00197.x
[2]  
[Anonymous], 1997, MODELLING SIMULATION
[3]   Scheduling aircraft landings - The static case [J].
Beasley, JE ;
Krishnamoorthy, M ;
Sharaiha, YM ;
Abramson, D .
TRANSPORTATION SCIENCE, 2000, 34 (02) :180-197
[4]   Displacement problem and dynamically scheduling aircraft landings [J].
Beasley, JE ;
Krishnamoorthy, M ;
Sharaiha, YM ;
Abramson, D .
JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY, 2004, 55 (01) :54-64
[5]   Minimizing total completion time subject to release dates and sequence-dependent processing times [J].
Bianco, L ;
Dell'Olmo, P ;
Giordani, S .
ANNALS OF OPERATIONS RESEARCH, 1999, 86 (0) :393-415
[6]  
BIANCO L, 1988, NAV RES LOG, V35, P177, DOI 10.1002/1520-6750(198804)35:2<177::AID-NAV3220350203>3.0.CO
[7]  
2-V
[8]  
Bianco L, 1999, INFOR, V37, P3
[9]  
Bianco L., 1998, P 8 IFAC IFIP IFORS, P41
[10]   Metaheuristics in combinatorial optimization: Overview and conceptual comparison [J].
Blum, C ;
Roli, A .
ACM COMPUTING SURVEYS, 2003, 35 (03) :268-308