Solving the Air Conflict Resolution Problem Under Uncertainty Using an Iterative Biobjective Mixed Integer Programming Approach.

In this paper, we tackle the aircraft conflict resolution problem under uncertainties. We consider errors due to the wind effect, the imprecision of aircraft speed prediction, and the delay in the execution of maneuvers. Using a geometrical approach, we derive an analytical expression for the minimum distance between aircraft, along with the corresponding probability of conflict. These expressions are incorporated into an existing deterministic model for conflict resolution. This model solves the problem as a maximum clique of minimum weight in a graph whose vertices represent possible maneuvers and where edges link conflict-free maneuvers of different aircraft. We then present a solution procedure focusing on two criteria, namely, fuel efficiency and the probability of reissuing maneuvers in the future: we iteratively generate Pareto front solutions to provide the controller with a set of possible solutions where she can choose the one corresponding the most to her preferences. Intensive Monte Carlo simulations validate the expressions derived for the minimum distance and the probability of conflict. Computational results highlight that up to 10 different solutions for instances involving up to 35 aircraft are generated within 3 minutes.