Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “aircraft scheduling”

Search indexed NASA NTRS and DOE OSTI research on propulsion, heat transfer, battery materials and energy systems. Follow report and document links to the original sources.

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 19 records
All sourcesNASA NTRSDOE OSTI
NASA NTRS1988

A traveling-salesman-based approach to aircraft scheduling in the terminal area

An efficient algorithm is presented, based on the well-known algorithm for the traveling salesman problem, for scheduling aircraft arrivals into major terminal areas. The algorithm permits, but strictly limits, reassigning an aircraft from its initial position in the landing order. This limitation is needed so that no aircraft or aircraft category is unduly penalized. Results indicate, for the mix of arrivals investigated, a potential increase in capacity in the 3 to 5 percent range. Furthermore, it is shown that the computation time for the algorithm grows only linearly with problem size.

Luenberger, Robert A.↗
NASA NTRS1972

Automated aircraft scheduling methods in the near terminal area.

A general scheduling algorithm for aircraft from terminal area entry to touchdown is developed. The method has the following novel features: (1) many speed classes of aircraft are considered and speed variations within classes and along portions of the flight path are permitted; (2) multiple paths are considered which may merge or diverge - the analysis is not restricted to a single runway nor to departures only; (3) landings are scheduled along conflict free flight paths in minimum time. The algorithm is currently being incorporated in a fast-time simulation of a STOL air traffic system.

Tobias, L.↗
NASA NTRS2006

Scheduling Aircraft Landings under Constrained Position Shifting

Optimal scheduling of airport runway operations can play an important role in improving the safety and efficiency of the National Airspace System (NAS). Methods that compute the optimal landing sequence and landing times of aircraft must accommodate practical issues that affect the implementation of the schedule. One such practical consideration, known as Constrained Position Shifting (CPS), is the restriction that each aircraft must land within a pre-specified number of positions of its place in the First-Come-First-Served (FCFS) sequence. We consider the problem of scheduling landings of aircraft in a CPS environment in order to maximize runway throughput (minimize the completion time of the landing sequence), subject to operational constraints such as FAA-specified minimum inter-arrival spacing restrictions, precedence relationships among aircraft that arise either from airline preferences or air traffic control procedures that prevent overtaking, and time windows (representing possible control actions) during which each aircraft landing can occur. We present a Dynamic Programming-based approach that scales linearly in the number of aircraft, and describe our computational experience with a prototype implementation on realistic data for Denver International Airport.

Balakrishnan, Hamsa↗
NASA NTRS1990

Real-time adaptive aircraft scheduling

One of the most important functions of any air traffic management system is the assignment of ground-holding times to flights, i.e., the determination of whether and by how much the take-off of a particular aircraft headed for a congested part of the air traffic control (ATC) system should be postponed in order to reduce the likelihood and extent of airborne delays. An analysis is presented for the fundamental case in which flights from many destinations must be scheduled for arrival at a single congested airport; the formulation is also useful in scheduling the landing of airborne flights within the extended terminal area. A set of approaches is described for addressing a deterministic and a probabilistic version of this problem. For the deterministic case, where airport capacities are known and fixed, several models were developed with associated low-order polynomial-time algorithms. For general delay cost functions, these algorithms find an optimal solution. Under a particular natural assumption regarding the delay cost function, an extremely fast (O(n ln n)) algorithm was developed. For the probabilistic case, using an estimated probability distribution of airport capacities, a model was developed with an associated low-order polynomial-time heuristic algorithm with useful properties.

Kolitz, Stephan E.↗
NASA NTRS2009

A Mixed Integer Linear Program for Airport Departure Scheduling

Aircraft departing from an airport are subject to numerous constraints while scheduling departure times. These constraints include wake-separation constraints for successive departures, miles-in-trail separation for aircraft bound for the same departure fixes, and time-window or prioritization constraints for individual flights. Besides these, emissions as well as increased fuel consumption due to inefficient scheduling need to be included. Addressing all the above constraints in a single framework while allowing for resequencing of the aircraft using runway queues is critical to the implementation of the Next Generation Air Transport System (NextGen) concepts. Prior work on airport departure scheduling has addressed some of the above. However, existing methods use pre-determined runway queues, and schedule aircraft from these departure queues. The source of such pre-determined queues is not explicit, and could potentially be a subjective controller input. Determining runway queues and scheduling within the same framework would potentially result in better scheduling. This paper presents a mixed integer linear program (MILP) for the departure-scheduling problem. The program takes as input the incoming sequence of aircraft for departure from a runway, along with their earliest departure times and an optional prioritization scheme based on time-window of departure for each aircraft. The program then assigns these aircraft to the available departure queues and schedules departure times, explicitly considering wake separation and departure fix restrictions to minimize total delay for all aircraft. The approach is generalized and can be used in a variety of situations, and allows for aircraft prioritization based on operational as well as environmental considerations. We present the MILP in the paper, along with benefits over the first-come-first-serve (FCFS) scheme for numerous randomized problems based on real-world settings. The MILP results in substantially reduced delays as compared to FCFS, and the magnitude of the savings depends on the queue and departure fix structure. The MILP assumes deterministic aircraft arrival times at the runway queues. However, due to taxi time uncertainty, aircraft might arrive either earlier or later than these deterministic times. Thus, to incorporate this uncertainty, we present a method for using the MILP with "overlap discounted rolling planning horizon". The approach is based on valuing near-term decision results more than future ones. We develop a model of taxitime uncertainty based on real-world data, and then compare the baseline FCFS delays with delays using the above MILP in a simple rolling-horizon method and in the overlap discounted scheme.

Gupta, Gautam↗
NASA NTRS1992

Scheduling of an aircraft fleet

Scheduling is the task of assigning resources to operations. When the resources are mobile vehicles, they describe routes through the served stations. To emphasize such aspect, this problem is usually referred to as the routing problem. In particular, if vehicles are aircraft and stations are airports, the problem is known as aircraft routing. This paper describes the solution to such a problem developed in OMAR (Operative Management of Aircraft Routing), a system implemented by Bull HN for Alitalia. In our approach, aircraft routing is viewed as a Constraint Satisfaction Problem. The solving strategy combines network consistency and tree search techniques.

Paltrinieri, Massimo↗
NASA NTRS2013

How do Air Traffic Controllers Use Automation and Tools Differently During High Demand Situations?

In a human-in-the-loop simulation, two air traffic controllers managed identical airspace while burdened with higher than average workload, and while using advanced tools and automation designed to assist with scheduling aircraft on multiple arrival flows to a single meter fix. This paper compares the strategies employed by each controller, and investigates how the controllers' strategies change while managing their airspace under more normal workload conditions and a higher workload condition. Each controller engaged in different methods of maneuvering aircraft to arrive on schedule, and adapted their strategies to cope with the increased workload in different ways. Based on the conclusions three suggestions are made: that quickly providing air traffic controllers with recommendations and information to assist with maneuvering and scheduling aircraft when burdened with increased workload will improve the air traffic controller's effectiveness, that the tools should adapt to the strategy currently employed by a controller, and that training should emphasize which traffic management strategies are most effective given specific airspace demands.

ATC↗
NASA NTRS1996

Scheduled Civil Aircraft Emission Inventories for 1976 and 1984: Database Development and Analysis

This report describes the development of a three-dimensional database of aircraft fuel burn and emissions (fuel burned, NOx, CO, and hydrocarbons) from scheduled commercial aircraft for four months (February, May, August, and November) of 1976 and 1984. Combining this data with earlier published data for 1990 and 1992, trend analyses for fuel burned, NOx, carbon monoxide, and hydrocarbons were calculated for selected regions (global, North America, Europe, North Atlantic, and North Pacific). These emissions inventories are available for use by atmospheric scientists conducting the Atmospheric Effects of Aviation Project (AEAP) modeling studies. Fuel burned and emissions of nitrogen oxides (NOx as NO2), carbon monoxide, and hydrocarbons have been calculated on a 1 degree latitude x 1 degree longitude x 1 kilometer altitude grid and delivered to NASA as electronic files.

Baughcum, Steven L.↗
NASA NTRS1996

Scheduled civil aircraft emission inventories for 1992: Database development and analysis

This report describes the development of a three-dimensional database of aircraft fuel burn and emissions (fuel burned, NOx, CO, and hydrocarbons) from scheduled commercial aircraft for each month of 1992. The seasonal variation in aircraft emissions was calculated for selected regions (global, North America, Europe, North Atlantic, and North Pacific). A series of parametric calculations were done to quantify the possible errors introduced from making approximations necessary to calculate the global emission inventory. The effects of wind, temperature, load factor, payload, and fuel tankering on fuel burn were evaluated to identify how they might affect the accuracy of aircraft emission inventories. These emissions inventories are available for use by atmospheric scientists conducting the Atmospheric Effects of Aviation Project (AEAP) modeling studies. Fuel burned and emissions of nitrogen oxides (NOx as N02), carbon monoxide, and hydrocarbons have been calculated on a 1 degree latitude x 1 degree longitude x 1 kilometer altitude grid and delivered to NASA as electronic files.

Baughcum, Steven L.↗
NASA NTRS2001

Scheduled Civil Aircraft Emission Inventories for 1999: Database Development and Analysis

This report describes the development of a three-dimensional database of aircraft fuel burn and emissions (NO(x), CO, and hydrocarbons) for the scheduled commercial aircraft fleet for each month of 1999. Global totals of emissions and fuel burn for 1999 are compared to global totals from 1992 and 2015 databases. 1999 fuel burn, departure and distance totals for selected airlines are compared to data reported on DOT Form 41 to evaluate the accuracy of the calculations. DOT Form T-100 data were used to determine typical payloads for freighter aircraft and this information was used to model freighter aircraft more accurately by using more realistic payloads. Differences in the calculation methodology used to create the 1999 fuel burn and emissions database from the methodology used in previous work are described and evaluated.

Sutkus, Donald J., Jr.↗
NASA NTRS1996

Evaluation of Scheduling Methods for Multiple Runways

Several scheduling strategies are analyzed in order to determine the most efficient means of scheduling aircraft when multiple runways are operational and the airport is operating at different utilization rates. The study compares simulation data for two and three runway scenarios to results from queuing theory for an M/D/n queue. The direction taken, however, is not to do a steady-state, or equilibrium, analysis since this is not the case during a rush period at a typical airport. Instead, a transient analysis of the delay per aircraft is performed. It is shown that the scheduling strategy that reduces the delay depends upon the density of the arrival traffic. For light traffic, scheduling aircraft to their preferred runways is sufficient; however, as the arrival rate increases, it becomes more important to separate traffic by weight class. Significant delay reduction is realized when aircraft that belong to the heavy and small weight classes are sent to separate runways with large aircraft put into the 'best' landing slot.

Bolender, Michael A.↗
NASA NTRS2010

A Mixed Integer Linear Program for Solving a Multiple Route Taxi Scheduling Problem

Aircraft movements on taxiways at busy airports often create bottlenecks. This paper introduces a mixed integer linear program to solve a Multiple Route Aircraft Taxi Scheduling Problem. The outputs of the model are in the form of optimal taxi schedules, which include routing decisions for taxiing aircraft. The model extends an existing single route formulation to include routing decisions. An efficient comparison framework compares the multi-route formulation and the single route formulation. The multi-route model is exercised for east side airport surface traffic at Dallas/Fort Worth International Airport to determine if any arrival taxi time savings can be achieved by allowing arrivals to have two taxi routes: a route that crosses an active departure runway and a perimeter route that avoids the crossing. Results indicate that the multi-route formulation yields reduced arrival taxi times over the single route formulation only when a perimeter taxiway is used. In conditions where the departure aircraft are given an optimal and fixed takeoff sequence, accumulative arrival taxi time savings in the multi-route formulation can be as high as 3.6 hours more than the single route formulation. If the departure sequence is not optimal, the multi-route formulation results in less taxi time savings made over the single route formulation, but the average arrival taxi time is significantly decreased.

Montoya, Justin Vincent↗
NASA NTRS1981

Real time simulation of computer-assisted sequencing of terminal area operations

A simulation was developed to investigate the utilization of computer assisted decision making for the task of sequencing and scheduling aircraft in a high density terminal area. The simulation incorporates a decision methodology termed Constrained Position Shifting. This methodology accounts for aircraft velocity profiles, routes, and weight classes in dynamically sequencing and scheduling arriving aircraft. A sample demonstration of Constrained Position Shifting is presented where six aircraft types (including both light and heavy aircraft) are sequenced to land at Denver's Stapleton International Airport. A graphical display is utilized and Constrained Position Shifting with a maximum shift of four positions (rearward or forward) is compared to first come, first serve with respect to arrival at the runway. The implementation of computer assisted sequencing and scheduling methodologies is investigated. A time based control concept will be required and design considerations for such a system are discussed.

Dear, R. G.↗
NASA NTRS1995

Knowledge-based scheduling of arrival aircraft

A knowledge-based method for scheduling arrival aircraft in the terminal area has been implemented and tested in real-time simulation. The scheduling system automatically sequences, assigns landing times, and assigns runways to arrival aircraft by utilizing continuous updates of aircraft radar data and controller inputs. The scheduling algorithms is driven by a knowledge base which was obtained in over two thousand hours of controller-in-the-loop real-time simulation. The knowledge base contains a series of hierarchical 'rules' and decision logic that examines both performance criteria, such as delay reduction, as well as workload reduction criteria, such as conflict avoidance. The objective of the algorithms is to devise an efficient plan to land the aircraft in a manner acceptable to the air traffic controllers. This paper will describe the scheduling algorithms, give examples of their use, and present data regarding their potential benefits to the air traffic system.

Krzeczowski, K.↗
NASA NTRS2017

Weather Impact on Airport Arrival Meter Fix Throughput

Time-based flow management provides arrival aircraft schedules based on arrival airport conditions, airport capacity, required spacing, and weather conditions. In order to meet a scheduled time at which arrival aircraft can cross an airport arrival meter fix prior to entering the airport terminal airspace, air traffic controllers make regulations on air traffic. Severe weather may create an airport arrival bottleneck if one or more of airport arrival meter fixes are partially or completely blocked by the weather and the arrival demand has not been reduced accordingly. Under these conditions, aircraft are frequently being put in holding patterns until they can be rerouted. A model that predicts the weather impacted meter fix throughput may help air traffic controllers direct arrival flows into the airport more efficiently, minimizing arrival meter fix congestion. This paper presents an analysis of air traffic flows across arrival meter fixes at the Newark Liberty International Airport (EWR). Several scenarios of weather impacted EWR arrival fix flows are described. Furthermore, multiple linear regression and regression tree ensemble learning approaches for translating multiple sector Weather Impacted Traffic Indexes (WITI) to EWR arrival meter fix throughputs are examined. These weather translation models are developed and validated using the EWR arrival flight and weather data for the period of April-September in 2014. This study also compares the performance of the regression tree ensemble with traditional multiple linear regression models for estimating the weather impacted throughputs at each of the EWR arrival meter fixes. For all meter fixes investigated, the results from the regression tree ensemble weather translation models show a stronger correlation between model outputs and observed meter fix throughputs than that produced from multiple linear regression method.

Machine Learning Model.↗
NASA NTRS2015

Scheduling and Delivering Aircraft to Departure Fixes in the NY Metroplex with Controller-Managed Spacing Tools

In this paper, successful Time-Based Flow Management (TBFM) scheduling systems for arrivals are considered and adapted to apply to departures. We present a concept of operations that integrates Controller-Managed Spacing tools for departures (CMS-D) with existing tactical departure scheduling tools to coordinate demand at departure fixes in a metroplex environment. We tested our concept in a Human-in-the-Loop simulation and compared the effect of two scheduling conditions: 1) "Departure Scheduling" consisting of an emulation of the Integrated Departure and Arrival Capability (IDAC) where Towers and a Planner (Traffic Management Coordinator at the appropriate facility) coordinate aircraft scheduled takeoff times to departure fixes; and 2) "Arrival Sensitive Departure Scheduling" where, in addition, the Tower and Planner also consider arrival Scheduled Time of Arrivals (STAs) at the airport's dependent runway. Results indicate little difference between the two scheduling conditions, but a large difference between the No Tools and the two scheduling conditions with CMS-D tools. The scheduling/CMS-D tools conditions markedly reduced heading, speed clearances, and workload for controllers who were merging flows at the departure fixes. In the tool conditions, departure controllers conditioned departures earlier rather than later when aircraft were tied near the departure fixes. In the scheduling/CMS-D tools conditions, departures crossed the departure fixes 50 seconds earlier and with an 8% error rate (consisting of time ahead or behind desired time of arrival) compared to a 19% error rate in the No Tool condition. Two exploratory runs showed that similar beneficial effects can be obtained only with the CMS-D tools without scheduling takeoff times, but at the cost of a somewhat higher workload for controllers, indicating the benefits of pre-departure scheduling of aircraft with minimal delays. Hence, we found that CMS-D tools were very beneficial in the metroplex environment we tested but that further research is needed to clarify the benefits of the various scheduling approaches.

terminal airspace↗
NASA NTRS1995

Knowledge-Based Scheduling of Arrival Aircraft in the Terminal Area

A knowledge based method for scheduling arrival aircraft in the terminal area has been implemented and tested in real time simulation. The scheduling system automatically sequences, assigns landing times, and assign runways to arrival aircraft by utilizing continuous updates of aircraft radar data and controller inputs. The scheduling algorithm is driven by a knowledge base which was obtained in over two thousand hours of controller-in-the-loop real time simulation. The knowledge base contains a series of hierarchical 'rules' and decision logic that examines both performance criteria, such as delay reductions, as well as workload reduction criteria, such as conflict avoidance. The objective of the algorithm is to devise an efficient plan to land the aircraft in a manner acceptable to the air traffic controllers. This paper describes the scheduling algorithms, gives examples of their use, and presents data regarding their potential benefits to the air traffic system.

Krzeczowski, K. J.↗
NASA NTRS1994

Problems with aging wiring in Naval aircraft

The Navy is experiencing a severe aircraft electrical wiring maintenance problem as a result of the extensive use of an aromatic polyimide insulation that is deteriorating at a rate that was unexpected when this wire was initially selected. This problem has significantly affected readiness, reliability, and safety and has greatly increased the cost of ownership of Naval aircraft. Failures in wire harnesses have exhibited arcing and burning that will propagate drastically, to the interruption of many electrical circuits from a fault initiated by the failure of deteriorating wires. There is an urgent need for a capability to schedule aircraft rewiring in an orderly manner with a logically derived determination of which aircraft have aged to the point of absolute necessity. Excessive maintenance was demonstrated to result from the accelerated aging due to the parameters of moisture, temperature, and strain that exist in the Naval Aircraft environment. Laboratory studies have demonstrated that MIL-W-81381 wire insulation when aged at high humidities followed the classical Arrhenius thermal aging relationship. In an extension of the project a multifactor formula was developed that is now capable of predicting life under varying conditions of these service parameters. An automated test system has also been developed to analyze the degree of deterioration that has occurred in wires taken from an aircraft in order to obtain an assessment of remaining life. Since it is both physically and financially impossible to replace the wiring in all the Navy's aircraft at once, this system will permit expedient scheduling so that those aircraft that are most probable to have wiring failure problems can be overhauled first.

Campbell, Frank J.↗