224 research outputs found
Control and optimization algorithms for air transportation systems
Modern air transportation systems are complex cyber-physical networks that are critical to global travel and commerce. As the demand for air transport has grown, so have congestion, flight delays, and the resultant environmental impacts. With further growth in demand expected, we need new control techniques, and perhaps even redesign of some parts of the system, in order to prevent cascading delays and excessive pollution. In this survey, we consider examples of how we can develop control and optimization algorithms for air transportation systems that are grounded in real-world data, implement them, and test them in both simulations and in field trials. These algorithms help us address several challenges, including resource allocation with multiple stakeholders, robustness in the presence of operational uncertainties, and developing decision-support tools that account for human operators and their behavior. Keywords: Air transportation; Congestion control; Large-scale optimization; Data-driven modeling; Human decision processe
Enhanced Demand and Capacity Balancing based on alternative trajectory options and traffic volume hotspot detection
Nowadays, regulations in Europe are applied at traffic volume (TV) level consisting in a reference location, i.e. a sector or an airport, and in some traffic flows, which act as directional traffic filters. This paper presents an enhanced demand and capacity balance (EDCB) formulation based on constrained capacities at traffic volume level. In addition, this approach considers alternative trajectories in order to capture the user driven preferences under the trajectory based operations scope. In fact, these alternative trajectories are assumed to be generated by the airspace users for those flights that cross regulated traffic volumes, where the demand is above the capacity. For every regulated trajectory the network manager requests two additional alternative trajectories to the airspace users, one for avoiding the regulated traffic volumes laterally and another for avoiding it vertically. This paper considers that the network manager allows more flexibility for the new alternative trajectories by removing restrictions in the Route Availability Document (RAD). All the regulated trajectories (and their alternatives) are considered together by the EDCB model in order to perform a centralised optimisation minimising the the cost deviation with respect to the initial traffic situation, considering fuel consumption, route charges and cost of delay. The EDCB model, based on Mixed-Integer Linear Programming (MILP), manages to balance the network applying ground delay, using alternative trajectories or both.
A full day scenario over the ECAC area is simulated. The regulated traffic volumes are identified using historical data (based on 28th July of 2016) and the results show that the EDCB could reduce the minutes of delay by 70%. The cost of the regulations is reduced by 11.7%, due to the reduction of the delay, but also because of the savings in terms of fuel and route charges derived from alternative trajectories.Peer ReviewedPostprint (published version
Enhanced Demand and Capacity Balancing based on Alternative Trajectory Options and Traffic Volume Hotspot Detection
Nowadays, regulations in Europe are applied at traffic volume (TV) level consisting in a reference location, i.e. a sector or an airport, and in some traffic flows, which act as directional traffic filters. This paper presents an enhanced demand and capacity balance (EDCB) formulation based on constrained capacities at traffic volume level. In addition, this approach considers alternative trajectories in order to capture the user driven preferences under the trajectory based operations scope. In fact, these alternative trajectories are assumed to be generated by the airspace users for those flights that cross regulated traffic volumes, where the demand is above the capacity. For every regulated trajectory the network manager requests two additional alternative trajectories to the airspace users, one for avoiding the regulated traffic volumes laterally and another for avoiding it vertically. This paper considers that the network manager allows more flexibility for the new alternative trajectories by removing restrictions in the Route Availability Document (RAD). All the regulated trajectories (and their alternatives) are considered together by the EDCB model in order to perform a centralised optimisation minimising the the cost deviation with respect to the initial traffic situation, considering fuel consumption, route charges and cost of delay. The EDCB model, based on Mixed-Integer Linear Programming (MILP), manages to balance the network applying ground delay, using alternative trajectories or both. A full day scenario over the ECAC area is simulated. The regulated traffic volumes are identified using historical data (based on 28th July of 2016) and the results show that the EDCB could reduce the minutes of delay by 70%. The cost of the regulations is reduced by 11.7%, due to the reduction of the delay, but also because of the savings in terms of fuel and route charges derived from alternative trajectories
Optimisation du trafic aérien à l'arrivée dans la zone terminale et dans l'espace aérien étendu
Selon les prévisions à long terme du trafic aérien de l'Organisation de l'Aviation Civile Internationale (OACI) en 2018, le trafic mondial de passagers devrait augmenter de 4,2% par an de 2018 à 2038. Bien que l'épidémie de COVID-19 ait eu un impact énorme sur le transport aérien, il se rétablit progressivement. Dès lors, l'efficacité et la sécurité resteront les principales problématiques du trafic aérien, notamment au niveau de la piste qui est le principal goulot d'étranglement du système. Dans le domaine de la gestion du trafic aérien, la zone de manœuvre terminale (TMA) est l'une des zones les plus complexes à gérer. En conséquence, le développement d'outils d'aide à la décision pour gérer l'arrivée des avions est primordial. Dans cette thèse, nous proposons deux approaches d'optimisation qui visent à fournir des solutions de contrôle pour la gestion des arrivées dans la TMA et dans un horizon étendu intégrant la phase en route. Premièrement, nous abordons le problème d'ordonnancement des avions sous incertitude dans la TMA. La quantification et la propagation de l'incertitude le long des routes sont réalisées grâce à un modèle de trajectoire qui représente les informations temporelles sous forme de variables aléatoires. La détection et la résolution des conflits sont effectuées à des points de cheminement d'un réseau prédéfini sur la base des informations temporelles prédites à partir de ce modèle. En minimisant l'espérance du nombre de conflits, les vols peuvent être bien séparés. Outre le modèle proposé, deux autres modèles de la litérrature - un modèle déterministe et un modèle intégrant des marges de séparation - sont présentés comme références. Un recuit simulé (SA) combiné à une fenêtre glissante temporelle est proposé pour résoudre une étude de cas de l'aéroport de Paris Charles de Gaulle (CDG). De plus, un cadre de simulation basé sur l'approche Monte-Carlo est implémenté pour perturber aléatoirement les horaires optimisés des trois modèles afin d'évaluer leurs performances. Les résultats statistiques montrent que le modèle proposé présente des avantages absolus dans l'absorption des conflits en cas d'incertitude. Dans une deuxième partie, nous abordons un problème dynamique basé sur le concept de Gestion des Arrivées Étendue (E-AMAN). L'horizon E-AMAN est étendu jusqu'à 500 NM de l'aéroport de destination permettant ainsi une planification anticipée. Le caractère dynamique est traitée par la mise à jour périodique des informations de trajectoires réelles sur la base de l'approche par horizon glissant. Pour chaque horizon temporel, un sous-problème est établi avec pour objectif une somme pondérée de métriques de sécurité du segment en route et de la TMA. Une approche d'attribution dynamique des poids est proposée pour souligner le fait qu'à mesure qu'un aéronef se rapproche de la TMA, le poids de ses métriques associées à la TMA devrait augmenter. Une étude de cas est réalisée à partir des données réelles de l'aéroport de Paris CDG. Les résultats finaux montrent que grâce à cet ajustement anticipé, les heures d'arrivée des avions sont proches des heures prévues tout en assurant la sécurité et en réduisant les attentes. Dans la troisième partie de cette thèse, on propose un algorithme qui accélère le processus d'optimisation. Au lieu d'évaluer les performances de tous les aéronefs, les performances d'un seul aéronef sont concentrées dans la fonction objectif. Grâce à ce changement, le processus d'optimisation bénéficie d'une évaluation d'objectif rapide et d'une vitesse de convergence élevée. Afin de vérifier l'algorithme proposé, les résultats sont analysés en termes de temps d'exécution et de qualité des résultats par rapport à l'algorithme utilisé à l'origine.According to the long term air traffic forecasts done by International Civil Aviation Organization (ICAO) in 2018, global passenger traffic is expected to grow by 4.2% annually from 2018 to 2038 using the traffic data of 2018 as a baseline. Even though the outbreak of COVID-19 has caused a huge impact on the air transportation, it is gradually restoring. Considering the potential demand in future, air traffic efficiency and safety will remain critical issues to be considered. In the airspace system, the runway is the main bottleneck in the aviation chain. Moreover, in the domain of air traffic management, the Terminal Maneuvering Area (TMA) is one of the most complex areas with all arrivals converging to land. This motivates the development of suitable decision support tools for providing proper advisories for arrival management. In this thesis, we propose two optimization approaches that aim to provide suitable control solutions for arrival management in the TMA and in the extended horizon that includes the TMA and the enroute phase. In the first part of this thesis, we address the aircraft scheduling problem under uncertainty in the TMA. Uncertainty quantification and propagation along the routes are realized in a trajectory model that formulates the time information as random variables. Conflict detection and resolution are performed at waypoints of a predefined network based on the predicted time information from the trajectory model. By minimizing the expected number of conflicts, consecutively operated flights can be well separated. Apart from the proposed model, two other models - the deterministic model and the model that incorporates separation buffers - are presented as benchmarks. Simulated annealing (SA) combined with the time decomposition sliding window approach is used for solving a case study of the Paris Charles de Gaulle (CDG) airport. Further, a simulation framework based on the Monte-Carlo approach is implemented to randomly perturb the optimized schedules of the three models so as to evaluate their performances. Statistical results show that the proposed model has absolute advantages in conflict absorption when uncertainty arises. In the second part of this thesis, we address a dynamic/on-line problem based on the concept of Extended Arrival MANagement (E-AMAN). The E-AMAN horizon is extended up to 500NM from the destination airport so as to enhance the cooperation and situational awareness of the upstream sector control and the TMA control. The dynamic feature is addressed by periodically updating the real aircraft trajectory information based on the rolling horizon approach. For each time horizon, a sub-problem is established taking the weighted sum of safety metrics in the enroute segment and in the TMA as objective. A dynamic weights assignment approach is proposed to emphasize the fact that as an aircraft gets closer to the TMA, the weight for its metrics associated with the TMA should increase. A case study is carried out using the real arrival traffic data of the Paris CDG airport. Final results show that through early adjustment, the arrival time of the aircraft can meet the required schedule for entering the TMA, thus ensuring overall safety and reducing holding time. In the third part of this thesis, an algorithm that expedites the optimization process is proposed. Instead of evaluating the performance of all aircraft, single aircraft performance is focused and a corresponding objective function is created. Through this change, the optimization process benefits from fast evaluation of objective and high convergence speed. In order to verify the proposed algorithm, results are analyzed in terms of execution time and quality of result compared to the originally used algorithm
Towards the optimisation of the scheduling of aircraft rotations
The aim of this research is to investigate the schedule punctuality and reliability issue
regarding the turnaround operations of an aircraft at an airport and further to explore
the influence of aircraft turnaround operations on the scheduling of aircraft rotation in
a multiple airport environment. An "aircraft rotation model" is developed in this
research by using a stochastic approach to consider the uncertainties in flight schedule
punctuality in the air and on the ground as well as operational uncertainties in aircraft
turnaround operations. The aircraft rotation model is composed of two sub-models,
namely the aircraft turnaround model, which represents the operational process of a
turnaround aircraft, and the en route model, which describes the en route flight time of
an aircraft between two airports. [Continues.
Applications of stochastic modeling in air traffic management:Methods, challenges and opportunities for solving air traffic problems under uncertainty
In this paper we provide a wide-ranging review of the literature on stochastic modeling applications within aviation, with a particular focus on problems involving demand and capacity management and the mitigation of air traffic congestion. From an operations research perspective, the main techniques of interest include analytical queueing theory, stochastic optimal control, robust optimization and stochastic integer programming. Applications of these techniques include the prediction of operational delays at airports, pre-tactical control of aircraft departure times, dynamic control and allocation of scarce airport resources and various others. We provide a critical review of recent developments in the literature and identify promising research opportunities for stochastic modelers within air traffic management
DEMAND-RESPONSIVE AIRSPACE SECTORIZATION AND AIR TRAFFIC CONTROLLER STAFFING
This dissertation optimizes the problem of designing sector boundaries and assigning air traffic controllers to sectors while considering demand variation over time. For long-term planning purposes, an optimization problem of clean-sheet sectorization is defined to generate a set of sector boundaries that accommodates traffic variation across the planning horizon while minimizing staffing. The resulting boundaries should best accommodate traffic over space and time and be the most efficient in terms of controller shifts. Two integer program formulations are proposed to address the defined problem, and their equivalency is proven. The performance of both formulations is examined with randomly generated numerical examples. Then, a real-world application confirms that the proposed model can save 10%-16% controller-hours, depending on the degree of demand variation over time, in comparison with the sectorization model with a strategy that does not take demand variation into account.
Due to the size of realistic sectorization problems, a heuristic based on mathematical programming is developed for a large-scale neighborhood search and implemented in a parallel computing framework in order to obtain quality solutions within time limits. The impact of neighborhood definition and initial solution on heuristic performance has been examined. Numerical results show that the heuristic and the proposed neighborhood selection schemes can find significant improvements beyond the best solutions that are found exclusively from the Mixed Integer Program solver's global search.
For operational purposes, under given sector boundaries, an optimization model is proposed to create an operational plan for dynamically combining or splitting sectors and determining controller staffing. In particular, the relation between traffic condition and the staffing decisions is no longer treated as a deterministic, step-wise function but a probabilistic, nonlinear one. Ordinal regression analysis is applied to estimate a set of sector-specific models for predicting sector staffing decisions. The statistical results are then incorporated into the proposed sector combination model. With realistic traffic and staffing data, the proposed model demonstrates the potential saving in controller staffing achievable by optimizing the combination schemes, depending on how freely sectors can combine and split. To address concerns about workload increases resulting from frequent changes of sector combinations, the proposed model is then expanded to a time-dependent one by including a minimum duration of a sector combination scheme. Numerical examples suggest there is a strong tradeoff between combination stability and controller staffing
Identification of Air Traffic Flow Segments via Incremental Deterministic Annealing Clustering
Many of the traffic management decisions and initiatives in air traffic are based on "flows" of traffic in the National Airspace System (NAS), but the actual identification of the location and time of the flow segments are often left to interpretation based on observations of traffic data points over time. Having an automated method of identifying major flow segments can help to target traffic management initiatives, evaluate design of airspace, and enable actions to be taken on the collection of flights in a flow segment rather than on the flights individually.
A novel approach is developed to identify the major flow segments of air traffic in the NAS that consists of a robust method for partitioning 4-dimensional traffic trajectories into a series of great circle segments, and clustering the segments using an Agglomerate Deterministic Annealing clustering algorithm. In addition, a very efficient algorithm to incrementally cluster the segments is developed that takes into account the spatial and temporal properties of the segments, and makes the method very suitable for real-time applications. Further, an enhancement to the algorithm is provided that requires only a small subset of the segments to be clustered, drastically reducing the run time.
Results of the clustering technique are shown, highlighting various major traffic flow patterns in the NAS. In addition, organizing the traffic into the flow segments identified using the Incremental Clustering method is shown to have a potential reduction in the number of conflict points.
An application of the flow information is presented in the form of a Decision Support Tool (DST) that aids traffic managers in establishing and managing Airspace Flow Programs. In addition, the flow segment information is applied to a low-level form of aggregated traffic management, showing that aggregating flights into the flow segments and rerouting the whole flow segment can be efficiently performed as compared to rerouting individual aircraft separately, and can reduce the number of conflict points. Considerations for implementing these techniques in real-time systems are also discussed
The applications of satellites to communications, navigation and surveillance for aircraft operating over the contiguous United States. Volume 1 - Technical report
Satellite applications to aircraft communications, navigation, and surveillance over US including synthesized satellite network and aircraft equipment for air traffic contro
Preference Based Fair Allocation of Limitted Resources
The fair division of scarce resources among agents is a challenging issue across a range of applications, especially when there is competition among agents. One application of resource division is in Air Traffic Management (ATM).
This dissertation is motivated by the fairness issues that arise in the resource allocation procedures that have been introduced under Collaborative Decision Making (CDM). Fair rationing and allocation of available en-route time slots are two major challenges that we address in this research.
The first challenge, fair rationing, is about how to compute a fair share of available resources among agents, when the available resources fall below the total demand. Since the demand, (flights), are time dependent, we introduce a new rationing method that includes the time dependency of demand. The new procedure gives every flight that is disrupted by an AFP a share of available resources. This is in contrast to Ration-By-Schedule (RBS), the allocation method currently in use, where later scheduled flights do not receive any slots. We will discuss and prove the fairness properties of our novel rationing procedure.
The second challenge, allocation of en-route resources, is about how to allocate resources among competitive agents, (flight operators), when each agent has different preferences over resources, (time slots). We design four randomized procedures for allocating scarce resources when the airlines' preferences are included. These procedures use an exogenous fair share, which can be computed using the method described above, as a fairness standard for the allocation of slots among airlines.
The first two procedures, Preference Based Proportional Random Allocation (PBPRA) and Modified-PBPRA, implicity assume equal weight for each time slot. Compared to RBS, PBPRA and M-PBPRA reduce the total internal cost of airlines and also assign each airline a number of slots close (in expectation) to their fair share. The fairness, efficiency and incentive properties of PBPRA and M-PBPRA are evaluated.
The value (or cost of delay) an airline associates with a particular flight may vary substantially from flight to flight. Airlines who wish to receive priority for certain flights usually are willing to pay more for specific time slots. To address the need to express varying priorities, we propose two procedures, Dual Price Proportional Random Allocation (DP-PRA) and Modified-DP-PRA (MDP-PRA) , that assign dual prices to resources, i.e. time slots, in order to capture the airlines' preferences over delays, rerouting and cancelations. We explore the fairness, efficiency and incentive properties of DP-PRA and MDP-PRA
- …