Air traffic growth and especially hubs development cause new significant congestion and ground delays on major airports. Accurate models of airport traffic prediction can provide new tools to assist ground controllers in choosing the best taxiways and the most adapted holding points for aircraft. Such tools could also be used by airport designers to… (More)
—This article focuses on the interactions that have to be developed between the runways scheduling (AMAN-DMAN) systems and the surface management (SMAN) system, in order to reduce the ground delay at Roissy Charles de Gaulle airport. The departures delay resulting from the optimised runways scheduling is compared to the total ground delay that can be… (More)
In busy airports, too many departing flights take off out of the time slot required by the Central Flow Management Unit (CFMU). During ground traffic peaks, taxi out times and runway queuing delays increase, and it seems very hard and maybe unfeasible for ground controllers to organise properly the traffic so that aircraft take off at their scheduled time.… (More)
OATAO is an open access repository that collects the work of Toulouse researchers and makes it freely available over the web where possible.
The airspace that we consider is a volume without hole made up of sub-volumes. A capacity, described by a maximum throughput, is calculated in cooperation with ATC controllers several months before the day of operations. It is assigned for each sub-volume. A sub-volume is called a sector or a group of sectors. According to the predicted traffic and the… (More)
Evolutionary Algorithms (EA) usually carry out an efficient exploration of the search-space, but get often trapped in local minima and do not prove the optimality of the solution. Interval-based techniques, on the other hand, yield a numerical proof of optimality of the solution. However, they may fail to converge within a reasonable time due to their… (More)
The only rigorous approaches for achieving a numerical proof of optimality in global optimization are interval-based methods that in-terleave branching of the search-space and pruning of the subdomains that cannot contain an optimal solution. State-of-the-art solvers generally integrate local optimization algorithms to compute a good upper bound of the… (More)