A Heuristic Algorithm for the Allocation of Airport Runway System Capacity

Abstract

This paper develops a heuristic algorithm for the allocation of airport runway capacity to minimise the cost of arrival and departure aircraft/flight delays. The algorithm is developed as a potential alternative to optimisation models based on linear and integer programming. The algorithm is based on heuristic (‘greedy’) criteria that closely reflect the ‘rules of thumb’ used by air traffic controllers. Using inputs such as arrival and departure demand, airport runway system capacity envelopes and cost of aircraft/flight delays, the main output minimises the cost of arrival and departure delays as well as the corresponding interdependent airport runway system arrival and departure capacity allocation. The algorithm is applied to traffic scenarios at three busy US airports. The results are used to validate the performance of the proposed heuristic algorithm against results from selected benchmarking optimisation models.     

Modeling effects of different air traffic control operational procedures,separation rules,and service disciplines on runway landing capacity

This paper deals with modeling the possible effects of different advanced procedures, existing, innovative, and new air traffic control (ATC) separation rules, and service disciplines on the ultimate landing capacity of a single runway. The first implies a combination and/or exclusive use of conventional and steeper final approach and landing procedures. The second includes the current horizontal, innovative mixed horizontal/vertical and new vertical distance‐based and time‐based separation rules. The last embrace the common First Come, First Served and innovative Priority service discipline. Such increasingly complex and challenging applications are assumed to be based on the new technologies on‐board the aircraft and at the ATC to be developed in the scope of the current United States Next Generation Air Transport System and European Single European Sky ATM Research programs. The convenient analytical models for calculating the runway landing capacity are developed and applied to the generic case of a single runway according to the “what–if” scenario approach. This enables carrying out the sensitivity analysis of the landing capacity with respect to the most influential factors – the ATC advanced operational procedures, separation rules, service disciplines, and aircraft fleet mix. Copyright © 2013 John Wiley & Sons, Ltd.     

Conflict-free arrival and departure trajectory planning for parallel runway with advanced point-merge system

In this paper, an efficient trajectory planning system is proposed to solve the integration of arrivals and departures on parallel runways with a novel route network system. Our first effort is made in designing an advanced Point Merge (PM) route network named Multi-Level Point Merge (ML-PM) to meet the requirements of parallel runway operations. Then, more efforts are paid on finding a complete and efficient framework capable of dynamically modelling the integration of arrival and departure trajectories on parallel runways, modelling the conflict detection and resolution in presence of curved trajectory and radius-to-fix merging process. After that, a suitable mathematical optimization formulation is built up. Receding Horizon Control (RHC) and Simulated Annealing (SA) algorithms are proposed to search the near-optimal solution for the large scale trajectories in routine dense operations. Taking Beijing Capital International Airport (BCIA) as a study case, the experimental results show that our system shows good performances on the management of arrivals and departures. It can automatically solve all the potential conflicts in presence of dense traffic flows. With its unique ML-PM route network, it can realize a shorter flying time and a near-Continuous Descent Approach (CDA) descent for arrival aircraft, an economical climbing for departure aircraft, an easier runway allocation together with trajectory control solutions. It shows a good and dynamic sequencing efficiency in Terminal Manoeuvring Area (TMA). In mixed ML-PM mode, under tested conditions, our proposed system can increase throughput at BCIA around 26%, compared with baseline. The methodology defined here could be easily applied to airports worldwide.     

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.     

Integrated sequencing and merging aircraft to parallel runways with automated conflict resolution and advanced avionics capabilities

Congestion in Terminal Maneuvering Area (TMA) in hub airports is the main problem in Chinese air transportation. In this paper we propose a new system to integrated sequence and merge aircraft to parallel runways at Beijing Capital International Airport (BCIA). This system is based on the advanced avionics capabilities. Our methodology integrates a Multi-Level Point Merge (ML-PM) system, an economical descent approaches procedure, and a tailored heuristic algorithm to find a good, systematic, operationally-acceptable solution. First, Receding Horizontal Control (RHC) technique is applied to divide the entire 24 h of traffic into several sub-problems. Then in each sub-problem, it is optimized on given objectives (conflict, deviation from Estimated Time of Arrival (ETA) on the runway and makespan of the arrival flow). Four decision variables are designed to control the trajectory: the entry time, the entry speed, the turning time on the sequencing leg, and the landing runway allocation. Based on these variables, the real time trajectories are generated by the simulation module. Simulated Annealing (SA) algorithm is used to search the best solution for aircraft to execute. Finally, the conflict-free, least-delay, and user-preferred trajectories from the entry point of TMA to the landing runway are defined. Numerical results show that our optimization system has very stable de-conflict performance to handle continuously dense arrivals in transition airspace. It can also provide the decision support to assist flow controllers to handle the asymmetric arrival flows on different runways with less fuel consumption, and to assist tactical controllers to easily re-sequence aircraft with more relaxed position shifting. Moreover, our system can provide the fuel consumption prediction, and runway assignment information to assist airport and airlines managers for optimal decision making. Theoretically, it realizes an automated, cooperative and green control of routine arrival flows. Although the methodology defined here is applied to the airport BCIA, it could also be applied to other airports in the world.     

Airport capacity increase via the use of braking profiles

Many airports are encountering the problem of insufficient capacity, which is particularly severe in periods of increased traffic. A large number of elements influence airport capacity, but one of the most important is runway occupancy time. This time depends on many factors, including how the landing roll procedure is performed. The procedure usually does not include the objective to minimize the runway occupancy time. This paper presents an analysis which shows that the way of braking during landing roll has an essential impact on runway throughput and thus on airport capacity. For this purpose, the landing roll simulator (named ACPENSIM) was created. It uses Petri nets and is a convenient tool for dynamic analysis of aircraft movement on the runway with given input parameters and a predetermined runway exit. Simulation experiments allowed to create a set of nominal braking profiles that have different objective functions: minimizing the runway occupancy time, minimizing noise, minimizing tire wear, maximizing passenger comfort and maximizing airport capacity as a whole. The experiments show that there is great potential to increase airport capacity by optimizing the braking procedure. It has been shown that by using the proposed braking profiles it is possible to reduce the runway occupancy time even by 50%.     

A hybrid optimization-simulation approach for robust weekly aircraft routing and retiming

We address the robust weekly aircraft routing and retiming problem, which requires determining weekly schedules for a heterogeneous fleet that maximizes the aircraft on-time performance, minimizes the total delay, and minimizes the number of delayed passengers. The fleet is required to serve a set of flights having known departure time windows while satisfying maintenance constraints. All flights are subject to random delays that may propagate through the network. We propose to solve this problem using a hybrid optimization-simulation approach based on a novel mixed-integer nonlinear programming model for the robust weekly aircraft maintenance routing problem. For this model, we provide an equivalent mixed-integer linear programming formulation that can be solved using a commercial solver. Furthermore, we describe a Monte-Carlo-based procedure for sequentially adjusting the flight departure times. We perform an extensive computational study using instances obtained from a major international airline, having up to 3387 flights and 164 aircraft, which demonstrates the efficacy of the proposed approach. Using the simulation software SimAir to assess the robustness of the solutions produced by our approach in comparison with that for the original solutions implemented by the airline, we found that on-time performance was improved by 9.8–16.0%, cumulative delay was reduced by 25.4–33.1%, and the number of delayed passengers was reduced by 8.2–51.6%.     

Apron capacity at hub airports—the impact of wave‐system structure

At hub airports, dominant airlines/alliance coordinate their flights in time with the aim of increasing the number (and quality) of connections, thus producing a wave‐system in traffic schedules. This paper addresses the impact of concentrating aircraft into waves on airport apron capacity. Existing models for apron capacity estimation are based on the number of stands, stand occupancy time, and demand structure, differing between representative groups of aircraft served at an airport. Criteria for aircraft grouping are aircraft type and/or airline and/or type of service (domestic, international, etc.). Modified deterministic analytical models proposed in this paper also take into account the wave‐system parameters, as well as runway capacity. They include the impact of these parameters on the number of flights in wave, stand occupancy time, and consequently apron capacity. Numerical examples illustrate the difference between apron capacity for an origin–destination airport and a hub airport, under the same conditions; utilization of the theoretical apron capacity at a hub airport, given the wave‐system structure; and utilization of the apron capacity at a hub airport when point‐to‐point traffic is allowed to use idle stands. Furthermore, the influence of different assignment strategies for aircraft stands in the case of hub airports is also discussed. Copyright © 2016 John Wiley & Sons, Ltd.     

Crosswind‐based optimization of multiple runway orientations

The runway orientation must satisfy the operational requirements of aircraft for landing and takeoff. Actually, the runway orientation is the result of compromises between the airport usability (wind coverage) and additional factors, such as available land, existing obstructions, topographic difficulties, flight path interference among runways and airports, noise pollution, and other environmental impacts. Therefore, the solution of a combination of acceptable runway orientations, which avoids excessive crosswinds at least 95% of the time, as well as the optimal orientation solution, is essential to conduct those compromises in the runway orientation analysis. The objective of this paper is to develop a computer model, named the optimization of multiple runway orientations model, which is capable of simultaneously providing a combination of acceptable runway orientations, changing the allowable crosswind limit flexibly, and determining the optimal orientations of multiple runway configurations. Instead of visual estimation or geometric computation, this paper presents an analytical method for wind coverage analysis. The model is mainly running in spreadsheet and Visual Basic for Applications (VBA). The numerical example and comparison show that the optimization of multiple runway orientations model is competitively accurate and convenient in comparison with previous ones. This paper presents an up‐to‐date model for the optimization of multiple runway orientations. By combining it with the geographic information system obstructions model, it can become an essential element of a future model for airport development cost minimization that combines airfield land use, earthwork volume, and cost estimation modules. Copyright © 2013 John Wiley & Sons, Ltd.     

The impact of strategic management and fleet planning on airline efficiency - A random effects Tobit model based on DEA efficiency scores

As a result of the liberalisation of airline markets; the strong growth of low cost carriers; the high volatility in fuel prices; and the recent global financial crisis, the cost pressure that airlines face is very substantial. In order to survive in these very competitive environments, information on what factors impact on costs and efficiency of airlines is crucial in guiding strategic change. To evaluate key determinants of 58 passenger airlines’ efficiency, this paper applies a two-stage Data Envelopment Analysis (DEA) approach, with partially bootstrapped random effects Tobit regressions in the second stage. Our results suggest that the effects of route optimisation, in the sense of average stage length of the fleet, are limited to airline technical efficiency. We show that airline size and key fleet mix characteristics, such as aircraft size and number of different aircraft families in the fleet, are more relevant to successful cost management of airlines since they have significant impacts on all three types of airline efficiency: technical, allocative and, ultimately, cost efficiency. Our results also show that despite the fuel saving benefits of younger aircraft, the age of an airline’s fleet has no significant impact on its technical efficiency, but does have a positive impact on its allocative and cost efficiency.     

Deconstructing delay: A non-parametric approach to analyzing delay changes in single server queuing systems

This paper introduces an empirically driven, non-parametric method to isolate and estimate the effects that changes in demand and changes in throughput have on delay – in particular, arrival and departure flight delay at airport runways. Classic queuing concepts were used to develop a method by which an intermediate, or counterfactual, queuing scenario could be constructed, to isolate the delay effects due to shifts in demand and throughput. This method includes the development of a stochastic throughput function that is based entirely on data and has three key features. Firstly, the function relies on non-parametric, empirically-based probability distributions of throughput counts. Secondly, facility capacity needs not be explicitly defined, as it is implicitly included in the probability distributions of throughput. Thirdly, the throughput performance function preserves the effect of factors that cause capacity (and, therefore, throughput) to fluctuate over a given period. Temporal sequences of high, moderate, and low capacity are maintained between the observed and counterfactual scenarios. The method was applied to a case study of the three major New York area airports of LaGuardia (LGA), Newark Liberty (EWR), and John F. Kennedy (JFK), using operational data extracted from the Federal Aviation Administration’s (FAA’s) Aviation System Performance Metrics (ASPM) database. The focus was on the peak summer travel seasons of 2006 and 2007, as these airports experienced record levels of delay in 2007. The results indicate that decreases in both demand and throughput were experienced at LGA and EWR, although the decreases in throughput had more significant effects on operational delays as they increased overall at these airports. At JFK, the increase in departure throughput was not sufficient to offset the increase in departure demands. For arrivals, demand increased and throughput decreased. These trends caused a significant growth in delay at JFK between 2006 and 2007.     

Impact of continuous climb operations on airport capacity

The full benefits of Continuous Climb Operations (CCO) are realised when CCO are performed without interruption. However, CCO require safe departures that necessarily implies a reduction in capacity at high density traffic airports. This paper quantifies the capacity impact due to the integration of CCO (conflict-free with other departures and arrivals) in a high density traffic airport. The methodology develops a scheduling algorithm, a conflict-detection and resolution algorithm, and Monte Carlo simulations. The scheduling algorithm calculates two schedules, one for departures and another for arrivals, considering the CCO Rate. The conflict-detection and resolution algorithm compares CCO and arrival trajectories to detect which aircraft pairs are in conflict. The Air Traffic Control (ATC) intervention required to solve the conflict is modelled by delaying the CCO take-off. Numerical simulations based on Monte Carlo techniques are used to analyse scheduling combinations that are statistically significant in terms of conflict, ATC interventions, total delay and capacity. The results show a 32% reduction in the maximum theoretical capacity with a CCO Rate of 100%. Despite the reduction, the number of CCO departures is above the maximum operational capacity (50% of the maximum theoretical capacity). This implies that with optimised scheduling it is possible for all departures to be CCO.     

Optimal timetable development for community shuttle network with metro stations

This paper investigates an issue for optimizing synchronized timetable for community shuttles linked with metro service. Considering a passenger arrival distribution, the problem is formulated to optimize timetables for multiple community shuttle routes, with the objective of minimizing passenger’s schedule delay cost and transfer cost. Two constraints, i.e., vehicle capacity and fleet size, are modeled in this paper. The first constraint is treated as soft, and the latter one is handled by a proposed timetable generating method. Two algorithms are employed to solve the problem, i.e., a genetic algorithm (GA) and a Frank–Wolfe algorithm combined with a heuristic algorithm of shifting departure times (FW-SDT). FW-SDT is an algorithm specially designed for this problem. The simulated and real-life examples confirm the feasibility of the two algorithms, and demonstrate that FW-SDT outperforms GA in both accuracy and effectiveness.     

Surrounding traffic complexity analysis for efficient and stable conflict resolution

The constant increase in air traffic demand increases a probability of the separation minima infringements in certain areas as a consequence of increased traffic density. The Annual Safety Report 2016 reports that in recent years the number of infringements, measured per million flight hours, had been increased at a lower rate (Eurocontrol, 2018). However, this level of infringements still generates a continuous pressure on the air traffic control (ATC) system and seeks for more control resources ready to tactically solve potential conflicts, while increasing at the same time the operational costs. Considering present air traffic management (ATM) trade-off criteria: increased airspace capacity and traffic efficiency but reducing the cost while preserving safety, new services must be designed to distribute the separation management ATC task loads among other actors. Based on the Single European Sky Air Traffic Management Research and Next Generation Air Transportation System initiatives, this paper proposes an innovative separation management service to shift the completely centralized tactical ATC interventions to more efficient decentralized tactical operations relying on an advanced surrounding traffic analysis tool, to preserve the safety indicators while considering the operational efficiency. A developed methodology for the proposed service is an application-oriented, trying to respond to characteristics and requirements of the current operational environment. The paper further analysis the traffic complexity taking into consideration the so-called domino effect, i.e. a number of the surrounding aircraft causally involved in the separation management service by the means of identification of the spatiotemporal interdependencies between them and the conflicting aircraft. This complexity is driven by the interdependencies structure and expressed as a time-criticality in quantifying the total number of the system solutions, that varies over time as the aircraft are approaching to each other. The results from two randomly selected ecosystem scenarios, extracted from a simulated traffic, illustrate different avoidance capacities for a given look-ahead time and the system solutions counts, that in discrete moments reach zero value.     

A critical examination of an airport noise mitigation scheme and an aircraft noise charge: the case of capacity expansion and externalities at Sydney (Kingsford Smith) airport

In the wake of the Australian airline liberalization in 1990 and its forecasted impact on air traffic, capacity has been expanded at Sydney (Kingsford Smith) airport (Sydney KSA) – Australia's busiest commercial airport – with the construction of the third runway in 1994. Coinciding with the approval for this capacity expansion, the Commonwealth Government amended the Federal Airports Corporation (FAC) Act to direct the FAC to carry out activities which protect the environment from the effects of aircraft operations, with the cost to be borne by the airline industry according to the ‘Polluter Pays Principle'. Noise management plans were part of the conditions for developmental approval for a third runway. To this end, since 1995, Sydney KSA imposes a noise levy designed to generate sufficient revenues to fund a noise mitigation scheme. Although the issues of aircraft noise, in particular its impact on property values and land use planning around the airport, have been extensively addressed in the literature, no one has empirically examined the implications of new environmental policies in conjunction with airline liberalization and change in airport infrastructure. Principles and policy analyses are discussed in this paper. By focusing on the specifics of Sydney KSA, broader policy issues likely to be relevant for other major airports around the world are discussed.     

The sequenced activity mobility simulator (SAMS): an integrated approach to modeling transportation, land use and air quality

The persistence of environmental problems in urban areas and the prospect of increasing congestion have precipitated a variety of new policies in the USA, with concomitant analytical and modeling requirements for transportation planning. This paper introduces the Sequenced Activity-Mobility Simulator (SAMS), a dynamic and integrated microsimulation forecasting system for transportation, land use and air quality, designed to overcome the deficiencies of conventional four-step travel demand forecasting systems. The proposed SAMS framework represents a departure from many of the conventional paradigms in travel demand forecasting. In particular, it aims at replicating the adaptative dynamics underlying transportation phenomena; explicitly incorporates the time-of-day dimension; represents human behavior based on the satisficing, as opposed to optimizing, principle; and endogenously forecasts socio-demographic, land use, vehicle fleet mix, and other variables that have traditionally been projected externally to be input into the forecasting process.     

Optimization of terminal airspace operation with environmental considerations

The rapid growth in air traffic has resulted in increased emission and noise levels in terminal areas, which brings negative environmental impact to surrounding areas. This study aims to optimize terminal area operations by taking into account environmental constraints pertaining to emission and noise. A multi-objective terminal area resource allocation problem is formulated by employing the arrival fix allocation (AFA) problem, while minimizing aircraft holding time, emission, and noise. The NSGA-II algorithm is employed to find the optimal assignment of terminal fixes with given demand input and environmental considerations, by incorporating the continuous descent approach (CDA). A case study of the Shanghai terminal area yields the following results: (1) Compared with existing arrival fix locations and the first-come-first-serve (FCFS) strategy, the AFA reduces emissions by 19.6%, and the areas impacted by noise by 16.4%. AFA and CDA combined reduce the emissions by 28% and noise by 38.1%; (2) Flight delays caused by the imbalance of demand and supply can be reduced by 72% (AFA) and 81% (AFA and CDA) respectively, compared with the FCFS strategy. The study demonstrates the feasibility of the proposed optimization framework to reduce the environmental impact in terminal areas while improving the operational efficiency, as well as its potential to underpin sustainable air traffic management.     

Charging infrastructure demands of shared-use autonomous electric vehicles in urban areas

Ride-hailing is a clear initial market for autonomous electric vehicles (AEVs) because it features high vehicle utilization levels and strong incentive to cut down labor costs. An extensive and reliable network of recharging infrastructure is the prerequisite to launch a lucrative AEV ride-hailing fleet. Hence, it is necessary to estimate the charging infrastructure demands for an AEV fleet in advance. This study proposes a charging system planning framework for a shared-use AEV fleet providing ride-hailing services in urban area. We first adopt an agent-based simulation model, called BEAM, to describe the complex behaviors of both passengers and transportation systems in urban cities. BEAM simulates the driving, parking and charging behaviors of the AEV fleet with range constraints and identifies times and locations of their charging demands. Then, based on BEAM simulation outputs, we adopt a hybrid algorithm to site and size charging stations to satisfy the charging demands subject to quality of service requirements. Based on the proposed framework, we estimate the charging infrastructure demands and calculate the corresponding economics and carbon emission impacts of electrifying a ride-hailing AEV fleet in the San Francisco Bay Area. We also investigate the impacts of various AEV and charging system parameters, e.g., fleet size, vehicle battery capacity and rated power of chargers, on the ride-hailing system’s overall costs.     

Dynamic user equilibrium with side constraints for a traffic network: Theoretical development and numerical solution algorithm

This paper investigates a traffic volume control scheme for a dynamic traffic network model which aims to ensure that traffic volumes on specified links do not exceed preferred levels. The problem is formulated as a dynamic user equilibrium problem with side constraints (DUE-SC) in which the side constraints represent the restrictions on the traffic volumes. Travelers choose their departure times and routes to minimize their generalized travel costs, which include early/late arrival penalties. An infinite-dimensional variational inequality (VI) is formulated to model the DUE-SC. Based on this VI formulation, we establish an existence result for the DUE-SC by showing that the VI admits at least one solution. To analyze the necessary condition for the DUE-SC, we restate the VI as an equivalent optimal control problem. The Lagrange multipliers associated with the side constraints as derived from the optimality condition of the DUE-SC provide the traffic volume control scheme. The control scheme can be interpreted as additional travel delays (either tolls or access delays) imposed upon drivers for using the controlled links. This additional delay term derived from the Lagrange multiplier is compared with its counterpart in a static user equilibrium assignment model. If the side constraint is chosen as the storage capacity of a link, the additional delay can be viewed as the effort needed to prevent the link from spillback. Under this circumstance, it is found that the flow is incompressible when the link traffic volume is equal to its storage capacity. An algorithm based on Euler’s discretization scheme and nonlinear programming is proposed to solve the DUE-SC. Numerical examples are presented to illustrate the mechanism of the proposed traffic volume control scheme.     

Dynamic ride sharing using traditional taxis and shared autonomous taxis: A case study of NYC

This study analyzes the potential benefits and drawbacks of taxi sharing using agent-based modeling. New York City (NYC) taxis are examined as a case study to evaluate the advantages and disadvantages of ride sharing using both traditional taxis (with shifts) and shared autonomous taxis. Compared to existing studies analyzing ride sharing using NYC taxi data, our contributions are that (1) we proposed a model that incorporates individual heterogeneous preferences; (2) we compared traditional taxis to autonomous taxis; and (3) we examined the spatial change of service coverage due to ride sharing. Our results show that switching from traditional taxis to shared autonomous taxis can potentially reduce the fleet size by 59% while maintaining the service level and without significant increase in wait time for the riders. The benefit of ride sharing is significant with increased occupancy rate (from 1.2 to 3), decreased total travel distance (up to 55%), and reduced carbon emissions (up to 866 metric tonnes per day). Dynamic ride sharing, wich allows shared trips to be formed among many groups of riders, up to the taxi capacity, increases system flexibility. Constraining the sharing to be only between two groups limits the sharing participation to be at the 50–75% level. However, the reduced fleet from ride sharing and autonomous driving may cause taxis to focus on areas of higher demands and lower the service levels in the suburban regions of the city.