A Mixed Integer Linear Program (MILP) formulation of NAS-wide beacon code assignment in the CONUS is presented. The optimization model is also tested with historical data and results demonstrated for a limited scenario. The objective of this research is to minimize (and if-possible eliminate) the need for change in the flight beacon codes as they cross center boundaries en-route to their destination. This reduction in the need to change beacon codes can help alleviate the additional burden during the workload intensive hand-off procedures.


    Zugriff

    Zugriff prüfen

    Verfügbarkeit in meiner Bibliothek prüfen

    Bestellung bei Subito €


    Exportieren, teilen und zitieren



    Titel :

    Towards a Mixed Integer Linear optimization model for universal beacon code assignment


    Beteiligte:
    Kumar, Vivek (Autor:in) / Sherry, Lance (Autor:in)


    Erscheinungsdatum :

    01.05.2010


    Format / Umfang :

    1304661 byte





    Medientyp :

    Aufsatz (Konferenz)


    Format :

    Elektronische Ressource


    Sprache :

    Englisch



    A Robust Method for Universal Beacon Code Assignment

    Kumar, Vivek | Online Contents | 2012


    A method for universal beacon code allocation

    Kumar, Vivek / Sherry, Lance / Jehlen, Richard | IEEE | 2012



    UAV Task Assignment with Timing Constraints via Mixed-Integer Linear Programming

    C. Schumacher / P. Chandler / M. Pachter et al. | NTIS | 2004


    UAV Task Assignment with Timing Constraints via Mixed-Integer Linear Programming

    Schumacher, Corey / Chandler, Phillip / Pachter, Meir et al. | AIAA | 2004