Home > Research > Publications & Outputs > The Air Traffic Flow Management Problem with Ti...
View graph of relations

The Air Traffic Flow Management Problem with Time Windows

Research output: Contribution to conference - Without ISBN/ISSN Conference paperpeer-review

Published

Standard

The Air Traffic Flow Management Problem with Time Windows. / Corolli, Luca; Castelli, Lorenzo; Lulli, Guglielmo.
2012. 1-7 Paper presented at 4th International Conference on Research and Air Transportation, Budapest, Hungary.

Research output: Contribution to conference - Without ISBN/ISSN Conference paperpeer-review

Harvard

Corolli, L, Castelli, L & Lulli, G 2012, 'The Air Traffic Flow Management Problem with Time Windows', Paper presented at 4th International Conference on Research and Air Transportation, Budapest, Hungary, 1/06/10 - 4/06/10 pp. 1-7. <http://www.icrat.org/icrat/4th-international-conference/>

APA

Corolli, L., Castelli, L., & Lulli, G. (2012). The Air Traffic Flow Management Problem with Time Windows. 1-7. Paper presented at 4th International Conference on Research and Air Transportation, Budapest, Hungary. http://www.icrat.org/icrat/4th-international-conference/

Vancouver

Corolli L, Castelli L, Lulli G. The Air Traffic Flow Management Problem with Time Windows. 2012. Paper presented at 4th International Conference on Research and Air Transportation, Budapest, Hungary.

Author

Corolli, Luca ; Castelli, Lorenzo ; Lulli, Guglielmo. / The Air Traffic Flow Management Problem with Time Windows. Paper presented at 4th International Conference on Research and Air Transportation, Budapest, Hungary.7 p.

Bibtex

@conference{220a59c1f09642bb8b9dc8275d96e2e2,
title = "The Air Traffic Flow Management Problem with Time Windows",
abstract = "This paper defines time windows of variable sizethrough which flights execute their actions, e.g., enter an airspacesector, depart from or arrive at an airport. We propose a two-stepapproach based on a mixed integer programming formulation.The first step determines a set of time windows such that theoverall cost of delay is minimized. As there might be differentsets of time windows generating the same minimum delay, inthe second step we choose the set of optimal time windows which also maximizes the overall time window size. In such a way, we provide to airlines, air navigation service providers and airports the largest degree of flexibility to perform their operations under the constraint that the minimum achievabledelay is kept constant. We also gain information on the critical flights of the system: if the optimal width of a time window is equal to its minimum available value, any disruption that may cause the flight not to meet it may produce undesired downstream effects. Some computational experience for small-scale random instances is reported.",
author = "Luca Corolli and Lorenzo Castelli and Guglielmo Lulli",
year = "2012",
language = "English",
pages = "1--7",
note = "4th International Conference on Research and Air Transportation ; Conference date: 01-06-2010 Through 04-06-2010",

}

RIS

TY - CONF

T1 - The Air Traffic Flow Management Problem with Time Windows

AU - Corolli, Luca

AU - Castelli, Lorenzo

AU - Lulli, Guglielmo

PY - 2012

Y1 - 2012

N2 - This paper defines time windows of variable sizethrough which flights execute their actions, e.g., enter an airspacesector, depart from or arrive at an airport. We propose a two-stepapproach based on a mixed integer programming formulation.The first step determines a set of time windows such that theoverall cost of delay is minimized. As there might be differentsets of time windows generating the same minimum delay, inthe second step we choose the set of optimal time windows which also maximizes the overall time window size. In such a way, we provide to airlines, air navigation service providers and airports the largest degree of flexibility to perform their operations under the constraint that the minimum achievabledelay is kept constant. We also gain information on the critical flights of the system: if the optimal width of a time window is equal to its minimum available value, any disruption that may cause the flight not to meet it may produce undesired downstream effects. Some computational experience for small-scale random instances is reported.

AB - This paper defines time windows of variable sizethrough which flights execute their actions, e.g., enter an airspacesector, depart from or arrive at an airport. We propose a two-stepapproach based on a mixed integer programming formulation.The first step determines a set of time windows such that theoverall cost of delay is minimized. As there might be differentsets of time windows generating the same minimum delay, inthe second step we choose the set of optimal time windows which also maximizes the overall time window size. In such a way, we provide to airlines, air navigation service providers and airports the largest degree of flexibility to perform their operations under the constraint that the minimum achievabledelay is kept constant. We also gain information on the critical flights of the system: if the optimal width of a time window is equal to its minimum available value, any disruption that may cause the flight not to meet it may produce undesired downstream effects. Some computational experience for small-scale random instances is reported.

M3 - Conference paper

SP - 1

EP - 7

T2 - 4th International Conference on Research and Air Transportation

Y2 - 1 June 2010 through 4 June 2010

ER -