In this paper, we study in detail the Flight Level Assignment (FLA) problem and its chance-constrained variant. Like FLA, the chance-constrained FLA problem is strongly NP-hard, and solving it exactly is out of reach, even for moderate realistic instances. An efficient heuristic is therefore proposed to deal with the whole problem by solving iteratively the chance-constrained FLA problem separately for each flight level. The approach used to solve the latter problem consists in a constraint generation one which adds iteratively new constraints until reaching the probability threshold for the specific chance-constrained FLA subproblem. An essential aspect of this method is the fast feasibility probability estimation of the chance-constrained constraints of a given solution. Numerical results support our findings.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    Chance-Constrained Flight Level Assignment Problem


    Contributors:


    Publication date :

    2023-06-01


    Size :

    8203735 byte




    Type of media :

    Article (Journal)


    Type of material :

    Electronic Resource


    Language :

    English



    92 INTEGER PROGRAMMING MODEL FORMULATIONS FOR OVER CONSTRAINED FLIGHT - GATE ASSIGNMENT PROBLEM

    Ozturk, Cemalettin / Ornek, Arslan M. / Sugut, Ipek | TIBKAT | 2016


    Fast Generation of Chance-Constrained Flight Trajectory for Unmanned Vehicles

    Chai, Runqi / Chen, Kaiyuan / Cui, Lingguo et al. | Springer Verlag | 2023


    Fast Generation of Chance-Constrained Flight Trajectory for Unmanned Vehicles

    Chai, Runqi / Tsourdos, Antonios / Savvaris, Al et al. | IEEE | 2021


    Flight test trajectory controller synthesis with constrained eigenstructure assignment

    Menon, P. K. A. / Saberi, H. A. / Walker, R. A. et al. | NTRS | 1985