Scheduling aircraft landings - the static case

This is the publisher version of the article, obtained from the link below.In this paper, we consider the problem of scheduling aircraft (plane) landings at an airport. This problem is one of deciding a landing time for each plane such that each plane lands within a predetermined time window and that separation criteria between the landing of a plane and the landing of all successive planes are respected. We present a mixed-integer zero–one formulation of the problem for the single runway case and extend it to the multiple runway case. We strengthen the linear programming relaxations of these formulations by introducing additional constraints. Throughout, we discuss how our formulations can be used to model a number of issues (choice of objective function, precedence restrictions, restricting the number of landings in a given time period, runway workload balancing) commonly encountered in practice. The problem is solved optimally using linear programming-based tree search. We also present an effective heuristic algorithm for the problem. Computational results for both the heuristic and the optimal algorithm are presented for a number of test problems involving up to 50 planes and four runways.J.E.Beasley. would like to acknowledge the financial support of the Commonwealth Scientific and Industrial Research Organization, Australia

A Hybrid Tabu/Scatter Search Algorithm for Simulation-Based Optimization of Multi-Objective Runway Operations Scheduling

As air traffic continues to increase, air traffic flow management is becoming more challenging to effectively and efficiently utilize airport capacity without compromising safety, environmental and economic requirements. Since runways are often the primary limiting factor in airport capacity, runway operations scheduling emerge as an important problem to be solved to alleviate flight delays and air traffic congestion while reducing unnecessary fuel consumption and negative environmental impacts. However, even a moderately sized real-life runway operations scheduling problem tends to be too complex to be solved by analytical methods, where all mathematical models for this problem belong to the complexity class of NP-Hard in a strong sense due to combinatorial nature of the problem. Therefore, it is only possible to solve practical runway operations scheduling problem by making a large number of simplifications and assumptions in a deterministic context. As a result, most analytical models proposed in the literature suffer from too much abstraction, avoid uncertainties and, in turn, have little applicability in practice. On the other hand, simulation-based methods have the capability to characterize complex and stochastic real-life runway operations in detail, and to cope with several constraints and stakeholders’ preferences, which are commonly considered as important factors in practice. This dissertation proposes a simulation-based optimization (SbO) approach for multi-objective runway operations scheduling problem. The SbO approach utilizes a discrete-event simulation model for accounting for uncertain conditions, and an optimization component for finding the best known Pareto set of solutions. This approach explicitly considers uncertainty to decrease the real operational cost of the runway operations as well as fairness among aircraft as part of the optimization process. Due to the problem’s large, complex and unstructured search space, a hybrid Tabu/Scatter Search algorithm is developed to find solutions by using an elitist strategy to preserve non-dominated solutions, a dynamic update mechanism to produce high-quality solutions and a rebuilding strategy to promote solution diversity. The proposed algorithm is applied to bi-objective (i.e., maximizing runway utilization and fairness) runway operations schedule optimization as the optimization component of the SbO framework, where the developed simulation model acts as an external function evaluator. To the best of our knowledge, this is the first SbO approach that explicitly considers uncertainties in the development of schedules for runway operations as well as considers fairness as a secondary objective. In addition, computational experiments are conducted using real-life datasets for a major US airport to demonstrate that the proposed approach is effective and computationally tractable in a practical sense. In the experimental design, statistical design of experiments method is employed to analyze the impacts of parameters on the simulation as well as on the optimization component’s performance, and to identify the appropriate parameter levels. The results show that the implementation of the proposed SbO approach provides operational benefits when compared to First-Come-First-Served (FCFS) and deterministic approaches without compromising schedule fairness. It is also shown that proposed algorithm is capable of generating a set of solutions that represent the inherent trade-offs between the objectives that are considered. The proposed decision-making algorithm might be used as part of decision support tools to aid air traffic controllers in solving the real-life runway operations scheduling problem

Runway Exit Designs for Capacity Improvement Demonstrations. Phase 1: Algorithm Development

A description and results are presented of a study to locate and design rapid runway exits under realistic airport conditions. The study developed a PC-based computer simulation-optimization program called REDIM (runway exit design interactive model) to help future airport designers and planners to locate optimal exits under various airport conditions. The model addresses three sets of problems typically arising during runway exit design evaluations. These are the evaluations of existing runway configurations, addition of new rapid runway turnoffs, and the design of new runway facilities. The model is highly interactive and allows a quick estimation of the expected value of runway occupancy time. Aircraft populations and airport environmental conditions are among the multiple inputs to the model to execute a viable runway location and geometric design solution. The results presented suggest that possible reductions on runway occupancy time (ROT) can be achieved with the use of optimally tailored rapid runway designs for a given aircraft population. Reductions of up to 9 to 6 seconds are possible with the implementation of 30 m/sec variable geometry exits

Architectures for embedded multimodal sensor data fusion systems in the robotics : and airport traffic suveillance ; domain

Smaller autonomous robots and embedded sensor data fusion systems often suffer from limited computational and hardware resources. Many ‘Real Time’ algorithms for multi modal sensor data fusion cannot be executed on such systems, at least not in real time and sometimes not at all, because of the computational and energy resources needed, resulting from the architecture of the computational hardware used in these systems. Alternative hardware architectures for generic tracking algorithms could provide a solution to overcome some of these limitations. For tracking and self localization sequential Bayesian filters, in particular particle filters, have been shown to be able to handle a range of tracking problems that could not be solved with other algorithms. But particle filters have some serious disadvantages when executed on serial computational architectures used in most systems. The potential increase in performance for particle filters is huge as many of the computational steps can be done concurrently. A generic hardware solution for particle filters can relieve the central processing unit from the computational load associated with the tracking task. The general topic of this research are hardware-software architectures for multi modal sensor data fusion in embedded systems in particular tracking, with the goal to develop a high performance computational architecture for embedded applications in robotics and airport traffic surveillance domain. The primary concern of the research is therefore: The integration of domain specific concept support into hardware architectures for low level multi modal sensor data fusion, in particular embedded systems for tracking with Bayesian filters; and a distributed hardware-software tracking systems for airport traffic surveillance and control systems. Runway Incursions are occurrences at an aerodrome involving the incorrect presence of an aircraft, vehicle, or person on the protected area of a surface designated for the landing and take-off of aircraft. The growing traffic volume kept runway incursions on the NTSB’s ‘Most Wanted’ list for safety improvements for over a decade. Recent incidents show that problem is still existent. Technological responses that have been deployed in significant numbers are ASDE-X and A-SMGCS. Although these technical responses are a significant improvement and reduce the frequency of runway incursions, some runway incursion scenarios are not optimally covered by these systems, detection of runway incursion events is not as fast as desired, and they are too expensive for all but the biggest airports. Local, short range sensors could be a solution to provide the necessary affordable surveillance accuracy for runway incursion prevention. In this context the following objectives shall be reached. 1) Show the feasibility of runway incursion prevention systems based on localized surveillance. 2) Develop a design for a local runway incursion alerting system. 3) Realize a prototype of the system design using the developed tracking hardware.Kleinere autonome Roboter und eingebettete Sensordatenfusionssysteme haben oft mit stark begrenzter Rechenkapazität und eingeschränkten Hardwareressourcen zu kämpfen. Viele Echtzeitalgorithmen für die Fusion von multimodalen Sensordaten können, bedingt durch den hohen Bedarf an Rechenkapazität und Energie, auf solchen Systemen überhaupt nicht ausgeführt werden, oder zu mindesten nicht in Echtzeit. Der hohe Bedarf an Energie und Rechenkapazität hat seine Ursache darin, dass die Architektur der ausführenden Hardware und der ausgeführte Algorithmus nicht aufeinander abgestimmt sind. Dies betrifft auch Algorithmen zu Spurverfolgung. Mit Hilfe von alternativen Hardwarearchitekturen für die generische Ausführung solcher Algorithmen könnten sich einige der typischerweise vorliegenden Einschränkungen überwinden lassen. Eine Reihe von Aufgaben, die sich mit anderen Spurverfolgungsalgorithmen nicht lösen lassen, lassen sich mit dem Teilchenfilter, einem Algorithmus aus der Familie der Bayesschen Filter lösen. Bei der Ausführung auf traditionellen Architekturen haben Teilchenfilter gegenüber anderen Algorithmen einen signifikanten Nachteil, allerdings ist hier ein großer Leistungszuwachs durch die nebenläufige Ausführung vieler Rechenschritte möglich. Eine generische Hardwarearchitektur für Teilchenfilter könnte deshalb die oben genannten Systeme stark entlasten. Das allgemeine Thema dieses Forschungsvorhabens sind Hardware-Software-Architekturen für die multimodale Sensordatenfusion auf eingebetteten Systemen - speziell für Aufgaben der Spurverfolgung, mit dem Ziel eine leistungsfähige Architektur für die Berechnung entsprechender Algorithmen auf eingebetteten Systemen zu entwickeln, die für Anwendungen in der Robotik und Verkehrsüberwachung auf Flughäfen geeignet ist. Das Augenmerk des Forschungsvorhabens liegt dabei auf der Integration von vom Einsatzgebiet abhängigen Konzepten in die Architektur von Systemen zur Spurverfolgung mit Bayeschen Filtern, sowie auf verteilten Hardware-Software Spurverfolgungssystemen zur Überwachung und Führung des Rollverkehrs auf Flughäfen. Eine „Runway Incursion“ (RI) ist ein Vorfall auf einem Flugplatz, bei dem ein Fahrzeug oder eine Person sich unerlaubt in einem Abschnitt der Start- bzw. Landebahn befindet, der einem Verkehrsteilnehmer zur Benutzung zugewiesen wurde. Der wachsende Flugverkehr hat dafür gesorgt, das RIs seit über einem Jahrzehnt auf der „Most Wanted“-Liste des NTSB für Verbesserungen der Sicherheit stehen. Jüngere Vorfälle zeigen, dass das Problem noch nicht behoben ist. Technologische Maßnahmen die in nennenswerter Zahl eingesetzt wurden sind das ASDE-X und das A-SMGCS. Obwohl diese Maßnahmen eine deutliche Verbesserung darstellen und die Zahl der RIs deutlich reduzieren, gibt es einige RISituationen die von diesen Systemen nicht optimal abgedeckt werden. Außerdem detektieren sie RIs ist nicht so schnell wie erwünscht und sind - außer für die größten Flughäfen - zu teuer. Lokale Sensoren mit kurzer Reichweite könnten eine Lösung sein um die für die zuverlässige Erkennung von RIs notwendige Präzision bei der Überwachung des Rollverkehrs zu erreichen. Vor diesem Hintergrund sollen die folgenden Ziele erreicht werden. 1) Die Machbarkeit eines Runway Incursion Vermeidungssystems, das auf lokalen Sensoren basiert, zeigen. 2) Einen umsetzbaren Entwurf für ein solches System entwickeln. 3) Einen Prototypen des Systems realisieren, das die oben gennannte Hardware zur Spurverfolgung einsetzt

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

Aeronautical engineering: A continuing bibliography, supplement 122

This bibliography lists 303 reports, articles, and other documents introduced into the NASA scientific and technical information system in April 1980

A new multiple flights routing and scheduling algorithm in terminal manoeuvring area

We address multiple flights planning problems from its initial waypoint to its destination while satisfying the minimum separation requirement between each aircraft at all times in a Terminal Manoeuvring Area (TMA) to maintain or increase runway throughput. Due to operational constraints for safety, most of the current aircraft fly over or by waypoints, and along nominal routes in the airspace. Where the waypoints and routes in the airspace can be modelled as a weighted digraph, called airspace graph. We propose a problem that consists of determining a flight path (routing problem) and its speed profile (scheduling problem) in a given airspace graph in which a time-based weighting scheme of the airspace graph is proposed to reflect a speed-limitation-compliant schedule that satisfy the minimum separation requirement. For multiple flights cases, the flight paths and schedules are obtained by iteratively solving the problem for each flight by applying the First Come First Served (FCFS) algorithm to determine an arrival sequence. The main contributions of this paper are increasing a solution search space by solving two problems simultaneously, efficient computational time, and providing the separation-compliant flight path and speed profile within the speed limitation for each flight. We demonstrate the advantages of the proposed approach through a case study in which multiple flights arrive at a single airport, and we compare the results with Regulated Tactical Flight Model (RTFM) obtained from EUROCONTROL Demand Data Repository 2 (DDR2). Although, we consider only a single airport and make an assumption to simplify flight routes from holding stacks to a Final Approach Fix (FAF), the results show the potential usage of the proposed algorithm as a Decision Support Tool (DST) for Air Traffic Controllers (ATCOs) if the following considerations are taken into account: detailed routes-based flights after the holding stacks, multiple airports, departing aircraft, all possibe aircraft types, and uncertainties produced by external sources

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

Approximate Algorithms for the Combined arrival-Departure Aircraft Sequencing and Reactive Scheduling Problems on Multiple Runways

The problem addressed in this dissertation is the Aircraft Sequencing Problem (ASP) in which a schedule must be developed to determine the assignment of each aircraft to a runway, the appropriate sequence of aircraft on each runway, and their departing or landing times. The dissertation examines the ASP over multiple runways, under mixed mode operations with the objective of minimizing the total weighted tardiness of aircraft landings and departures simultaneously. To prevent the dangers associated with wake-vortex effects, separation times enforced by Aviation Administrations (e.g., FAA) are considered, adding another level of complexity given that such times are sequence-dependent. Due to the problem being NP-hard, it is computationally difficult to solve large scale instances in a reasonable amount of time. Therefore, three greedy algorithms, namely the Adapted Apparent Tardiness Cost with Separation and Ready Times (AATCSR), the Earliest Ready Time (ERT) and the Fast Priority Index (FPI) are proposed. Moreover, metaheuristics including Simulated Annealing (SA) and the Metaheuristic for Randomized Priority Search (Meta-RaPS) are introduced to improve solutions initially constructed by the proposed greedy algorithms. The performance (solution quality and computational time) of the various algorithms is compared to the optimal solutions and to each other. The dissertation also addresses the Aircraft Reactive Scheduling Problem (ARSP) as air traffic systems frequently encounter various disruptions due to unexpected events such as inclement weather, aircraft failures or personnel shortages rendering the initial plan suboptimal or even obsolete in some cases. This research considers disruptions including the arrival of new aircraft, flight cancellations and aircraft delays. ARSP is formulated as a multi-objective optimization problem in which both the schedule\u27s quality and stability are of interest. The objectives consist of the total weighted start times (solution quality), total weighted start time deviation, and total weighted runway deviation (instability measures). Repair and complete regeneration approximate algorithms are developed for each type of disruptive events. The algorithms are tested against difficult benchmark problems and the solutions are compared to optimal solutions in terms of solution quality, schedule stability and computational time

Aeronautical Engineering: A special bibliography with indexes, supplement 55

This bibliography lists 260 reports, articles, and other documents introduced into the NASA scientific and technical information system in February 1975