On Solving Aircraft Conflict Avoidance Using Deterministic Global Optimization (sBB) Codes
Résumé
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
Origine : Fichiers éditeurs autorisés sur une archive ouverte
Loading...