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

Conference object English OPEN
Cafieri , Sonia ; Messine , Frédéric ; Touhami , Ahmed (2016)
  • Publisher: HAL CCSD
  • Subject: Aircraft conflict avoidance | Interval Branch and Bound | [ MATH.MATH-OC ] Mathematics [math]/Optimization and Control [math.OC] | Affine forms | Convex relaxation

International audience; 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
  • References (5)

    [1] S. Cafieri, and N. Durand. Aircraft deconfliction with speed regulation: new models from mixed-integer optimization. Journal of Global Optimization, 58(4):613-629, 2014.

    [2] P. Belotti, J. Lee, L. Liberti, F. Margot, and A. Wachter. Branching and bounds tightening techniques for nonconvex MINLP. Optimization Methods and Software, 24(4):597-634, 2009.

    [3] F. Messine. A Deterministic Global Optimization Algorithm for Design Problems. In C. Audet, P. Hansen, and G. Savard, editors, Essays and Surveys in Global Optimization, Springer, 267-292, 2005.

    [4] F. Messine. Deterministic Global Optimization using Interval Constraint Propagation Techniques. RAIROOperations Research, 38(4):277-294, 2002.

    [5] J.Ninin, F. Messine, and P. Hansen. A reliable affine relaxation method for global optimization. 4OR - a Quarterly Journal of Operations Research, 13(3):247-277, 2015.

  • Metrics
    No metrics available
Share - Bookmark