Analysis of performance and equity in ground delay programs

The discrepancy between the projected demand for arrival slots at an airport and the projected available arrival slots on a given day is resolved by the Ground Delay Program (GDP). The current GDP rationing rule, Ration-by-Schedule, allocates the available arrival slots at the affected airport by scheduled arrival time of the flights with some adjustments to balance the equity between airlines. This rule does not take into account passenger flow and fuel flow performance in the rationing assignment tradeoff.This paper examines the trade-off between passenger delays and excess surface fuel burn as well as airline equity and passenger equity in GDP slot allocation using different rationing rules. A GDP Rationing Rule Simulator (GDP-RRS) is developed to calculate performance and equity metrics for all stakeholders using six alternate rules. The results show that there is a trade-off between GDP performance and GDP equity. Ration-by-Passengers (a rule which maximizes the passenger throughput) decreased total passenger delay by 22% and decreased total excess fuel burn by 57% with no change in total flight delay compared to the traditional Ration-by-Schedule. However, when the airline and passenger equity are primary concerns, the Ration-by-Schedule is preferred.     

Control strategies for departure process delays at airport passenger terminals

This paper explores the characteristics of process delays at airport passenger terminals and establishes a queuing model for both passengers and baggage served by different connecting type facilities. The impact of delay propagation on other processes and flights is investigated using an analytical approach. In addition, the extra costs incurred on passengers, process operators, and airlines are examined using the delay cost functions. To reduce the impact of process delays, various delay-controlled strategies are proposed, such as setting scheduled times for completion of a process, increasing the number of service counters, and priority service for emergent flights. Taoyuan International Airport in Taiwan is used as a case study when facing special events. Results showed that the model can effectively and efficiently estimate delay propagation and its costs. In addition, processes that are not consecutive allow more buffer time between different operations, which helps ease propagation of delays caused by previous services.     

Heuristic search for the coupled runway sequencing and taxiway routing problem

This paper presents the first local search heuristic for the coupled runway sequencing (arrival & departure) and taxiway routing problems, based on the receding horizon (RH) scheme that takes into account the dynamic nature of the problem. As test case, we use Manchester Airport, the third busiest airport in the UK. From the ground movement perspective, the airport layout requires that departing aircraft taxi across the arrivals runway. This makes it impossible to separate arrival from departure sequencing in practice. Operationally, interactions between aircraft on the taxiways could prevent aircraft from taking off from, or landing on, runways during the slots assigned to them by an algorithm optimizing runway use alone. We thus consider the interactions between arrival and departure aircraft on the airport surface. Compared to sequentially optimized solutions, the results obtained with our approach indicate a significant decrease in the taxiway routing delay, with generally no loss in performance in terms of the sequencing delay for a regular day of operations. Another benefit of such a simultaneous optimization approach is the possibility of holding aircraft at the stands for longer, without the engines running. This significantly reduces the fuel burn, as well as bottlenecks and traffic congestion during peak hours that are often the cause of flight delays due to the limited amount of airport surface space available. Given that the maximum computing time per horizon is around 95 s, real-time operation might be practical with increased computing power.     

What are the implications of climate change for trans-Atlantic aircraft routing and flight time?

The effect of wind changes on aircraft routing has been identified as a potential impact of climate change on aviation. This is of particular interest for trans-Atlantic flights, where the pattern of upper-level winds over the north Atlantic, in particular the location and strength of the jet stream, strongly influences both the optimal flight route and the resulting flight time. Eastbound trans-Atlantic flights can often be routed to take advantage of the strong tailwinds in the jet stream, shortening the flight time and reducing fuel consumption. Here we investigate the impact of climate change on upper-level winds over the north Atlantic, using five climate model simulations from the Fifth Coupled Model Intercomparison Project, considering a high greenhouse-gas emissions scenario. The impact on aircraft routing and flight time are quantified using flight routing software. The climate models agree that the jet stream will be on average located 1° further north, with a small increase in mean strength, by 2100. However daily variations in both its location and speed are significantly larger than the magnitude of any changes due to climate change. The net effect of climate change on trans-Atlantic aircraft routes is small; in the annual-mean eastbound routes are 1 min shorter and located further north and westbound routes are 1 min longer and more spread out around the great circle. There are, however, seasonal variations; route time changes are larger in winter, while in summer both eastbound and westbound route times increase.     

Demonstration of reduced airport congestion through pushback rate control

Airport surface congestion results in significant increases in taxi times, fuel burn and emissions at major airports. This paper describes the field tests of a congestion control strategy at Boston Logan International Airport. The approach determines a suggested rate to meter pushbacks from the gate, in order to prevent the airport surface from entering congested states and to reduce the time that flights spend with engines on while taxiing to the runway. The field trials demonstrated that significant benefits were achievable through such a strategy: during eight four-hour tests conducted during August and September 2010, fuel use was reduced by an estimated 12,250–14,500 kg (4000–4700 US gallons), while aircraft gate pushback times were increased by an average of only 4.4 min for the 247 flights that were held at the gate.     

Characterization and prediction of air traffic delays

This paper presents a new class of models for predicting air traffic delays. The proposed models consider both temporal and spatial (that is, network) delay states as explanatory variables, and use Random Forest algorithms to predict departure delays 2–24 h in the future. In addition to local delay variables that describe the arrival or departure delay states of the most influential airports and links (origin–destination pairs) in the network, new network delay variables that characterize the global delay state of the entire National Airspace System at the time of prediction are proposed. The paper analyzes the performance of the proposed prediction models in both classifying delays as above or below a certain threshold, as well as predicting delay values. The models are trained and validated on operational data from 2007 and 2008, and are evaluated using the 100 most-delayed links in the system. The results show that for a 2-h forecast horizon, the average test error over these 100 links is 19% when classifying delays as above or below 60 min. Similarly, the average over these 100 links of the median test error is found to be 21 min when predicting departure delays for a 2-h forecast horizon. The effects of changes in the classification threshold and forecast horizon on prediction performance are studied.     

Optimal assignment for check-in counters based on passenger arrival behaviour at an airport

Establishing how to utilize check-in counters at airport passenger terminals efficiently is a major concern facing airport operators and airlines. Inadequate terminal capacity and the inefficient utilization of facilities such as check-in counters are major factors causing congestion and delays at airport passenger terminals. However, such delays and congestion can be reduced by increasing the efficiency of check-in counter operations, based on an understanding of passengers' airport access behaviour. This paper presents an assignment model for check-in counter operations, based on passengers' airport arrival patterns. In setting up the model, passenger surveys are used to determine when passengers arrive at the airport terminals relative to their flight departure times. The model then uses passenger arrival distribution patterns to calculate the most appropriate number of check-in counters and the duration of time that each counter should be operated. This assignment model has been applied at the Seoul Gimpo International Airport in Korea. The model provides not only a practical system for the efficient operations of time-to-time check-in counter assignments, but also a valuable means of developing effective longer-term solutions to the problem of passenger terminal congestion and delays. It also offers airlines a means of operating check-in counters with greater cost effectiveness, thus leading to enhanced customer service.     

Assessment of stratospheric fuel burn by civil commercial aviation

When jetliners fly in the stratosphere, their emissions tend to be longer-lived and therefore have greater environmental impact. Since the altitude of the tropopause is not consistent and can be as low as 23,000 ft., cruising flights may have a great chance to fly into the stratosphere. In this paper, we present a simple and rapid method to estimate the extent of US commercial passenger and cargo flight that currently occurs in the stratosphere, based on publicly available historical data from 2008 to 2012. We model the vertical profile of a flight and compare it with the height of the tropopause along its route. Our analysis covers 78% of the total travelled distance reported by the United States Bureau of Transportation Statistics, and shows that these flights burnt ∼11 million tons of fuel annually, or ∼31% of cruise fuel, in the stratosphere between 2008 and 2012. Our results also show that the chance of flying into stratosphere varies by area, but flights within the contiguous United States tend to stay below the stratosphere. Moreover, the stratosphere fuel burn of Asia-US flights may be significantly reduced by taking jet stream routes.     

Quantitative analysis of passenger and baggage security screening at airports

The terrorist attacks in the United States in 2001 opened a new era in air transportation. The realization that civil aircraft can be used as powerful weapons of mass destruction by a small group of people has drastically increased the need for security screening procedures to protect civil flights. Serving as the interface between the air and land transportation modes, airports have become the main focus in the implementation of those procedures. The need to more thoroughly screen passengers and baggage, and the consequent increase in processing time, has created the need for more space for security checkpoints and baggage screening inside passenger terminal buildings—space that is costly and very difficult to find in existing buildings. This paper evaluates the impact those measures have had on the planning and operation of airport passenger terminals. Quantification of those impacts is performed with the use of discrete‐event simulation and spreadsheet models.     

The airline perturbation problem: considering disrupted passengers

Abstract

When airlines are faced with some unforeseen short-term events, they have to reconstruct their flight schedules. Although aircraft recovery decisions affect passengers, these disrupted passengers and recovering them have not been explicitly considered in most previous aircraft recovery models. This paper presents an assignment model for airline schedule recovery which recovers both aircraft and disrupted passengers simultaneously, using a rolling horizon time framework. Our model examines possible flight retiming, aircraft swapping, over-flying, ferrying, utilization of reserve aircraft, cancellation and passenger reassignment to generate an efficient schedule recovery plan. The model ensures that the schedule returns to normal within a certain time and the objective is to minimize operational recovery aircraft cost, cancellation and delay cost as well as disrupted passenger cost. The model is tested using a data-set with two disruption scenarios. The computational results show that it is capable of handling the integrated aircraft and passenger recovery problem successfully.     

Using supplemental aircraft noise information to assist airport neighbours understand aircraft noise

This paper deals with the value of supplemental aircraft noise information in the form of combining aircraft movement numbers and noise levels to assist airport neighbours in understanding airport noise. To analyse the socio-spatial interaction of annoyance with, and interference by, aircraft noise, an alternative is recommended, namely the number of noise events above selected noise levels so that laypeople can better understand the extent of noise. The research is based on a questionnaire survey of households affected by aircraft noise around OR Tambo International Airport near Johannesburg. The results indicate that levels of annoyance and disturbance across a number of normal household activities are positively related to the number of noise events recorded, irrespective of noise levels above 60 dB.     

An aggregate demand model for air passenger traffic in the hub-and-spoke network

In this paper, we build an aggregate demand model for air passenger traffic in a hub-and-spoke network. This model considers the roles of airline service variables such as service frequency, aircraft size, ticket price, flight distance, and number of spokes in the network. It also takes into account the influence of local passengers and social-economic and demographic conditions in the spoke and hub metropolitan areas. The hub airport capacity, which has a significant impact on service quality in the hub airport and in the whole hub-and-spoke network, is also taken into consideration.Our demand model reveals that airlines can attract more connecting passengers in a hub-and-spoke network by increasing service frequency than by increasing aircraft size in the same percentage. Our research confirms the importance of local service to connecting passengers, and finds that, interestingly, airlines’ services in the first flight leg are more important to attract passengers than those in the second flight segment. Based on data in this study, we also find that a 1% reduction of ticket price will bring about 0.9% more connecting passengers, and a 1% increase of airport acceptance rate can bring about 0.35% more connecting passengers in the network, with all else equal. These findings are helpful for airlines to understand the effects of changing their services, and also useful for us to quantify the benefits of hub airport expansion projects.At the end of this paper, we give an example as an application to demonstrate how the developed demand model could be used to valuate passengers’ direct benefit from airport capacity expansion.     

Scheduling of airport runway operations using stochastic branch and bound methods

In this paper we present a solution methodology based on the stochastic branch and bound algorithm to find optimal, or close to optimal, solutions to the stochastic airport runway scheduling problem. The objective of the scheduling problem is to find a sequence of aircraft operations on one or several runways that minimizes the total makespan, given uncertain aircraft availability at the runway. Enhancements to the general stochastic branch and bound algorithm are proposed and we give the specific details pertaining to runway scheduling. We show how the algorithm can be terminated early with solutions that are close to optimal, and investigate the impact of the uncertainty level. The computational experiment indicates that the sequences obtained using the stochastic branch and bound algorithm have, on average, 5–7% shorter makespans than sequences obtained using deterministic sequencing models. In addition, the proposed algorithm is able to solve instances with 14 aircraft using less than 1 min of computation time.     

Implications of climate change for thermal discomfort on underground railways

Hot weather events, ventilation assets, changing passenger demand and service expectations have all caused increased attention on thermal comfort on London’s Tube. This study provides estimates of the future number of days when passengers travelling on sections of the Tube could be subjected to thermal discomfort under future scenarios of climate change, and the potential number of passengers dissatisfied. A risk based methodology is presented, integrating a spatial weather generator modified for urban areas and a thermal comfort model. The study provides an initial assessment of adaptation options by considering the implications of lowering train temperatures by 2 °C and 4 °C to represent saloon cooling. Median results under a 2050 high scenario indicate that all Tube lines assessed could experience near-complete passenger dissatisfaction with the thermal environment in trains in the unlikely event that nothing else were to change. Adaptation aimed at lowering train temperatures has the potential to provide tangible improvements in thermal comfort. However, this was not projected to be sufficient to maintain comfortable thermal conditions for many of the lines in the 2050s under high emission scenarios, requiring a combination of other infrastructure cooling measures to be implemented in parallel.     

A bi-level model for single-line rail timetable design with consideration of demand and capacity

This paper proposes a bi-level model to solve the timetable design problem for an urban rail line. The upper level model aims at determining the headways between trains to minimize total passenger cost, which includes not only the usual perceived travel time cost, but also penalties during travel. With the headways given by the upper level model, passengers’ arrival times at their origin stops are determined by the lower level model, in which the cost-minimizing behavior of each passenger is taken into account. To make the model more realistic, explicit capacity constraints of individual trains are considered. With these constraints, passengers cannot board a full train, but wait in queues for the next coming train. A two-stage genetic algorithm incorporating the method of successive averages is introduced to solve the bi-level model. Two hypothetical examples and a real world case are employed to evaluate the effectiveness of the proposed bi-level model and algorithm. Results show that the bi-level model performs well in reducing total passenger cost, especially in reducing waiting time cost and penalties. And the section loading-rates of trains in the optimized timetable are more balanced than the even-headway timetable. The sensitivity analyses show that passenger’s desired arrival time interval at destination and crowding penalty factor have a high influence on the optimal solution. And with the dispersing of passengers' desired arrival time intervals or the increase of crowding penalty factor, the section loading-rates of trains become more balanced.     

Delay to major street through vehicles at two-way stop-controlled intersections

This paper describes a methodology for predicting the delay to major street through vehicles at two-way stop-controlled intersections. This delay is incurred when major street left-turn demand exceeds the available storage area and blocks the adjacent through lane. The through lane blockage problem does not generally occur with significant frequency on streets with divided cross sections that have left-turn bays or lanes; however, it frequently occurs on undivided streets due to their lack of left-turn storage. To minimize this delay, through drivers often merge with vehicles in the adjacent through lane—if there is an adequate gap for them to safely merge into. If there is no merge opportunity, then the through drivers will stay in the inside lane until the queue ahead dissipates. The through vehicle delay predicted by the methodology was found to be relatively small (i.e. less than 5 s veh⁻¹) when compared with delays commonly incurred by non-priority movements at unsignalized intersections. However, when expressed in terms of total vehicle hours of delay, the effect can be quite significant. In general, through vehicle delay increases with increasing approach flow rate and left-turn percentage. However, at flow rates in excess of about 1400 veh h⁻¹, delays increase very rapidly and there is evidence that larger left-turn percentages may have lower delays. ©     

Inferring patterns in the multi-week activity sequences of public transport users

The public transport networks of dense cities such as London serve passengers with widely different travel patterns. In line with the diverse lives of urban dwellers, activities and journeys are combined within days and across days in diverse sequences. From personalized customer information, to improved travel demand models, understanding this type of heterogeneity among transit users is relevant to a number of applications core to public transport agencies’ function. In this study, passenger heterogeneity is investigated based on a longitudinal representation of each user’s multi-week activity sequence derived from smart card data. We propose a methodology leveraging this representation to identify clusters of users with similar activity sequence structure. The methodology is applied to a large sample (n = 33,026) from London’s public transport network, in which each passenger is represented by a continuous 4-week activity sequence. The application reveals 11 clusters, each characterized by a distinct sequence structure. Socio-demographic information available for a small sample of users (n = 1973) is combined to smart card transactions to analyze associations between the identified patterns and demographic attributes including passenger age, occupation, household composition and income, and vehicle ownership. The analysis reveals that significant connections exist between the demographic attributes of users and activity patterns identified exclusively from fare transactions.     

Flight delays,capacity investment and social welfare under air transport supply-demand equilibrium

This paper analyzes benefits from aviation infrastructure investment under competitive supply-demand equilibrium. The analysis recognizes that, in the air transportation system where economies of density is an inherent characteristic, capacity change would trigger a complicated set of adjustment of and interplay among passenger demand, air fare, flight frequency, aircraft size, and flight delays, leading to an equilibrium shift. An analytical model that incorporates these elements is developed. The results from comparative static analysis show that capacity constraint suppresses demand, reduces flight frequency, and increases passenger generalized cost. Our numerical analysis further reveals that, by switching to larger aircraft size, airlines manage to offset part of the delay effect on unit operating cost, and charge passengers lower fare. With higher capacity, airlines tend to raise both fare and frequency while decreasing aircraft size. More demand emerges in the market, with reduced generalized cost for each traveler. The marginal benefit brought by capacity expansion diminishes as the capacity-demand imbalance becomes less severe. Existing passengers in the market receive most of the benefit, followed by airlines. The welfare gains from induced demand are much smaller. The equilibrium approach yields more plausible investment benefit estimates than does the conventional method. In particular, when forecasting future demand the equilibrium approach is capable of preventing the occurrence of excessive high delays.     

Flight and passenger delay assignment optimization strategies

This paper compares different optimization strategies for the minimization of flight and passenger delays at two levels: pre-tactical, with on-ground delay at origin, and tactical, with airborne delay close to the destination airport. The optimization model is based on the ground holding problem and uses various cost functions. The scenario considered takes place in a busy European airport and includes realistic values of traffic. A passenger assignment with connections at the hub is modeled. Statistical models are used for passenger and connecting passenger allocation, minimum time required for turnaround and tactical noise; whereas uncertainty is also introduced in the model for tactical noise. Performance of the various optimization processes is presented and compared to ration by schedule results.     

Future electricity demand from battery‐powered vehicles

An important decision faced by airline schedulers is how to adapt the flight schedule and aircraft assignment to unforeseen perturbations in an established schedule. In the face of unforeseen aircraft delays, schedulers have to decide which flights to delay, and when delays become excessive, which to cancel. Current scheduling models deal with simple decision problems of delay or cancellation, but not with both simultaneously. But in practice the optimal decision may involve results from the integration of both flight cancellations and delays. In Part I of this paper, a quadratic programming model for the integration decision problem is given. The model can formulate the integration of flight cancellations and delays as well as some special cases, such as the ferrying of surplus aircraft and the possibility of swapping different types of aircraft. In this paper, based on the special structure of the model, an effective algorithm is presented, sufficient computational experiments are conducted and some results are reported. These show that we can expect to obtain a sufficiently good solution in terms of reasonable CPU time.