Jean-Baptiste Gotteland

Learn More
Due to air traffic growth and especially hubs development, major European airports can easily become bottlenecks in the global air transportation network. Therefore, accurate models of airport traffic prediction become more and more necessary for ground controllers. In this paper, a ground traffic simulation tool is proposed and applied to Roissy Charles De(More)
In this article, we introduce a global cooperative approach between an Interval Branch and Bound Algorithm and an Evolutionary Algorithm, that takes advantage of both methods to optimize a function for which an inclusion function can be expressed. The Branch and Bound algorithm deletes whole blocks of the search space whereas the Evolutionary Algorithm(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 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)
We provide the global optimization community with new optimality proofs for 6 deceptive benchmark functions (5 bound-constrained functions and one nonlinearly constrained problem). These highly multimodal nonlinear test problems are among the most challenging benchmark functions for global optimization solvers; some have not been solved even with(More)
The only rigorous approaches for achieving a numerical proof of optimality in global optimization are interval-based methods that interleave 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)
  • 1