Air Traffic Management by Stochastic Optimization

The annual number of flights in Western Europe has increased from about 2.6 million in 1982 to about 4.5 million in 1992, an increase of about 73%. Acute congestion of the Air Traffic Control system has been the result. A similar problem exists in United States, where each of thirtythree major airports has experienced about 20,000 hours of annual delays in 1997. Two kinds of congestion can be identified according to the part of airspace involved : Terminal congestion (around airports) and En-route congestion (between airports). In the past, the first way to reduce these congestions was to modify the structure of the airspace in order to increase the capacity (increasing the number of runways, increasing the number of sectors by reducing their size). This method has a limit due to the cost involved by new runways and the way to manage traffic in too small sectors (a controller needs a minimum amount of airspace to be able to solve conflicts). The other way to reduce congestion is to modify the flight plans in order to adapt the demand to the available capacity. To reach this goal, ground delay programs are often applied on aircraft which are expected to undergo congestion. Ground delays are safer (fewer aircraft waiting in the sky) and cheaper (according to the fuel consumption). When Integer Linear Programming (ILP) is applied to the general Ground Holding Problem, it can be shown that large delays are given to some aircraft in order to match the sector capacities. So, to reduce congestion in sectors and avoid large delays, demand has to be spread in spatial dimension too (route-slot allocation). Our research addresses the general time-route assignment problem : “ One considers a sectorized airspace and a fleet of aircraft with their associated route and slot of departure. For each flight a set of alternative routes and a set of possible slots of departure are defined. One must find “optimal” route and slot allocation for each aircraft in order to significantly reduce the peaks of congestion in sectors and airports, during one day of traffic.” A state of the art of the existing methods (including ILP) shows that this general bi-allocation problem is usually partially treated and the whole problem remains unsolved due to the complexity induced by this new spatial dimension of the state domain. Stochastic Optimization is then adapted to the problem. The strong point of this technique is its ability to investigate any kind of objective function without any regularities such as derivability and linearity. A sector congestion measure has been developed which gather the major control workload indicators. This measure is then computed for each proposed planning by refeering to an off-line simulation. New problem-based stochastic operators have been developed and successfully applied on real instances of the problem. Keywords—Air Traffic Management, Stochastic Optimization, Air Traffic Control, Congestion.

[1]  Maurizio Bielli,et al.  Air traffic management: Optimization models and algorithms , 1992 .

[2]  François Laburthe,et al.  Improved CLP Scheduling with Task Intervals , 1994, ICLP.

[3]  Amedeo R. Odoni,et al.  Dynamic Ground-Holding Policies for a Network of Airports , 1994, Transp. Sci..

[4]  A. Odoni,et al.  Models for the Ground Holding Problem , 1993 .

[5]  David E. Goldberg,et al.  Genetic Algorithms in Search Optimization and Machine Learning , 1988 .

[6]  Terry L. Friesz,et al.  A Variational Inequality Formulation of the Dynamic Network User Equilibrium Problem , 1993, Oper. Res..

[7]  Amedeo R. Odoni,et al.  Airspace Congestion Smoothing by Stochastic Optimization , 1997, Evolutionary Programming.

[8]  M. Papageorgiou,et al.  Concise encyclopedia of traffic & transportation systems , 1991 .

[9]  Terry L. Friesz,et al.  Dynamic Network Traffic Assignment Considered as a Continuous Time Optimal Control Problem , 1989, Oper. Res..

[10]  Stella C. Dafermos,et al.  Traffic assignment problem for a general network , 1969 .

[11]  R. Cerf Une théorie asymptotique des algorithmes génétiques , 1994 .

[12]  A. Odoni The Flow Management Problem in Air Traffic Control , 1987 .

[13]  Gerald L. Thompson,et al.  A Dynamic Space-Time Network Flow Model for City Traffic Congestion , 1987, Transp. Sci..

[14]  Nicolas Durand,et al.  CATS: A Complete Air Traffic Simulator , 1997, 16th DASC. AIAA/IEEE Digital Avionics Systems Conference. Reflections to the Future. Proceedings.

[15]  Dimitris Bertsimas,et al.  The Air Traffic Flow Management Problem with Enroute Capacities , 1998, Oper. Res..

[16]  E. Cascetta,et al.  A DAY-TO-DAY AND WITHIN-DAY DYNAMIC STOCHASTIC ASSIGNMENT MODEL , 1991 .

[17]  Zbigniew Michalewicz,et al.  Genetic Algorithms + Data Structures = Evolution Programs , 1996, Springer Berlin Heidelberg.

[18]  Moshe Ben-Akiva,et al.  Dynamic network models and driver information systems , 1991 .

[19]  Amedeo R. Odoni,et al.  The Multi-Airport Ground-Holding Problem in Air Traffic Control , 1992, Oper. Res..