Final published version
Research output: Contribution in Book/Report/Proceedings - With ISBN/ISSN › Conference contribution/Paper › peer-review
The air traffic flow management problem : An integer optimization approach. / Bertsimas, Dimitris; Lulli, Guglielmo; Odoni, Amedeo.
Integer Programming and Combinatorial Optimization - 13th International Conference, IPCO 2008, Proceedings. 2008. p. 34-46 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 5035 LNCS).Research output: Contribution in Book/Report/Proceedings - With ISBN/ISSN › Conference contribution/Paper › peer-review
}
TY - GEN
T1 - The air traffic flow management problem
T2 - 13th International Conference on Integer Programming and Combinatorial Optimization, IPCO 2008
AU - Bertsimas, Dimitris
AU - Lulli, Guglielmo
AU - Odoni, Amedeo
PY - 2008/6/30
Y1 - 2008/6/30
N2 - In this paper, we present a new Integer Program (IP) for the Air Traffic Flow Management (ATFM) problem. The model we propose provides a complete representation of all the phases of each flights, i.e., the phase of taking-off, of cruising and of landing; suggesting all the actions to be implemented to achieve the goal of safe, efficient, and expeditious aircraft movement. The distinctive feature of the model is that it allows rerouting decisions. These decisions are formulated by means of "local" conditions, which allow us to represent such decisions in a very compact way by only introducing new constraints. Moreover, to strengthen the polyhedral structure of the underlying relaxation, we also present three classes of valid inequalities. We report short computational times (less than 15 minutes) on instances of the size of the US air traffic control system that make it realistic that our approach can be used as the main engine of managing air traffic in the US.
AB - In this paper, we present a new Integer Program (IP) for the Air Traffic Flow Management (ATFM) problem. The model we propose provides a complete representation of all the phases of each flights, i.e., the phase of taking-off, of cruising and of landing; suggesting all the actions to be implemented to achieve the goal of safe, efficient, and expeditious aircraft movement. The distinctive feature of the model is that it allows rerouting decisions. These decisions are formulated by means of "local" conditions, which allow us to represent such decisions in a very compact way by only introducing new constraints. Moreover, to strengthen the polyhedral structure of the underlying relaxation, we also present three classes of valid inequalities. We report short computational times (less than 15 minutes) on instances of the size of the US air traffic control system that make it realistic that our approach can be used as the main engine of managing air traffic in the US.
U2 - 10.1007/978-3-540-68891-4_3
DO - 10.1007/978-3-540-68891-4_3
M3 - Conference contribution/Paper
AN - SCOPUS:45749119993
SN - 3540688862
SN - 9783540688860
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 34
EP - 46
BT - Integer Programming and Combinatorial Optimization - 13th International Conference, IPCO 2008, Proceedings
Y2 - 26 May 2008 through 28 May 2008
ER -