On Solving Aircraft Conflict Avoidance Using Deterministic Global Optimization (sBB) Codes

Sonia Cafieri (1) , Frédéric Messine (2) , Ahmed Touhami (3)

1 ENAC - Ecole Nationale de l'Aviation Civile
2 LAPLACE-GREM3 - Groupe de Recherches en Electrodynamique
3 Université Hassan 1er [Settat]

In this paper, some improvements of spatial Branch and Bound (sBB) algorithms are discussed to solve aircraft conflict avoidance problems formulated as MINLP. We propose a new quadratic convex relaxation technique based on affine arithmetic. Moreover, a branching strategy is also proposedfor the considered problem. Preliminary numerical results validates the proposed approach

Mots clés: Aircraft conflict avoidance; Interval Branch and Bound; Convex relaxation; Affine forms

Domaines: Mathématiques [math]; Optimisation et contrôle [math.OC]

Sonia Cafieri, Frédéric Messine, Ahmed Touhami. On Solving Aircraft Conflict Avoidance Using Deterministic Global Optimization (sBB) Codes. GOW'16, XIII Global Optimization Workshop, Sep 2016, Braga, Portugal. pp 149-152; ISBN : 978-989-20-6764-3. ⟨hal-01379306⟩