Dynamic air traffic planning by genetic algorithms

In the past, the first way to reduce the congestion of the air traffic control system 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 solve conflicts). The other way to reduce congestion is to modify the flight plans in order to adapt the demand to the available capacity. So, to reduce congestion, demand has to be spread in spatial and time dimension (route-slot allocation). Our research addresses the general time-route assignment problem using a static and a dynamic approach. A state of the art of the existing methods shows that this general bi-allocation problem is usually partially treated and the whole problem remains unsolved due to the induced complexity. GAs are then adapted to the problem