The Air Traffic Flow Management Problem with Enroute Capacities
- 1 June 1998
- journal article
- Published by Institute for Operations Research and the Management Sciences (INFORMS) in Operations Research
- Vol. 46 (3) , 406-422
- https://doi.org/10.1287/opre.46.3.406
Abstract
Massachusetts Institute of Technology, Cambridge, Massachusetts (Received August 1994; revision received October 1995; accepted May 1996) Throughout the United States and Europe, demand for airport use has been increasing rapidly, while airport capacity has been stagnating. Over the last ten years the number of passengers has increased by more than 50 percent and is expected to continue increasing at this rate. Acute congestion in many major airports has been the unfortunate result. For U.S. airlines, the expected yearly cost of the resulting delays is currently estimated at $3 billion. In order to put this number in perspective, the total reported losses of all U.S. airlines amounted to approximately $2 billion in 1991 and $2.5 billion in 1990. Furthermore, every day 700 to 1100 flights are delayed by 15 minutes or more. European airlines are in a similar plight. Optimally controlling the flow of aircraft either by adjusting their release times into the network (ground-holding) or their speed once they are airborne is a cost effective method to reduce the impact of congestion on the air traffic system. This paper makes the following contributions: (a) we build a model that takes into account the capacities of the National Airspace System (NAS) as well as the capacities at the airports, and we show that the resulting formulation is rather strong as some of the proposed inequalities are facet defining for the convex hull of solutions; (b) we address the complexity of the problem; (c) we extend that model to account for several variations of the basic problem, most notably, how to reroute flights and how to handle banks in the hub and spoke system; (d) we show that by relaxing some of our constraints we obtain a previously addressed problem and that the LP relaxation bound of our formulation is at least as strong when compared to all others proposed in the literature for this problem; and (e) we solve large scale, realistic size problems with several thousand flights.Keywords
All Related Versions
This publication has 11 references indexed in Scilit:
- Reducing air traffic delay in a space-time networkPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- Dynamic Ground-Holding Policies for a Network of AirportsTransportation Science, 1994
- The Multi-Airport Ground-Holding Problem in Air Traffic ControlOperations Research, 1994
- Airport capacity: representation, estimation, optimizationIEEE Transactions on Control Systems Technology, 1993
- Solving Optimally the Static Ground-Holding Policy Problem in Air Traffic ControlTransportation Science, 1993
- Traffic Flow Management Modeling with the Time Assignment ModelAir Traffic Control Quarterly, 1993
- Strategic Flow Management for Air Traffic ControlOperations Research, 1993
- Models for the Ground Holding ProblemPublished by Springer Nature ,1993
- Integer and Combinatorial OptimizationPublished by Wiley ,1988
- The Flow Management Problem in Air Traffic ControlPublished by Springer Nature ,1987