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.     

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.     

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.     

Tarmac delay policies: A passenger-centric analysis

In this paper, we analyze the effectiveness of the 2010 Tarmac Delay Rule from a passenger-centric point of view. The Tarmac Delay Rule stipulates that aircraft lift-off, or an opportunity for passengers to deplane, must occur no later than 3 h after the cabin door closure at the gate of the departure airport; and that an opportunity for passengers to deplane must occur no later than 3 h after the touchdown at the arrival airport. The Tarmac Delay Rule aims to protect enplaned passengers on commercial aircraft from excessively long delays on the tarmac upon taxi-out or taxi-in, and monetarily penalizes airlines that violate the stipulated 3-h tarmac time limit. Comparing the actual flight schedule and delay data after the Tarmac Delay Rule was in effect with that before, we find that the Rule has been highly effective in reducing the frequency of occurrence of long tarmac times. However, another significant effect of the rule has been the rise in flight cancellation rates. Cancellations result in passengers requiring rebooking, and often lead to extensive delay in reaching their final destinations. Using an algorithm to estimate passenger delay, we quantify delays to passengers in 2007, before the Tarmac Delay Rule was enacted, and compare these delays to those estimated for hypothetical scenarios with the Tarmac Delay Rule in effect for that same year. Our delay estimates are calculated using U.S. Department of Transportation data from 2007. Through our results and several sensitivity analyses, we show that the overall impact of the current Tarmac Delay Rule is a significant increase in passenger delays, especially for passengers scheduled to travel on the flights which are at risk of long tarmac delays. We evaluate the impacts on passengers of a number of rule variations, including changes to the maximum time on the tarmac, and variations in that maximum by time-of-day. Through extensive scenario analyses, we conclude that a better balance between the conflicting objectives of reducing the frequency of long tarmac times and reducing total passenger delays can be achieved through a modified version of the existing rule. This modified version involves increasing the tarmac time limit to 3.5 h and only applying the rule to flights with planned departure times before 5pm. Finally, in order to implement the Rule more effectively, we suggest the tarmac time limit to be defined in terms of the time when the aircraft begin returning to the gate instead of being defined in terms of the time when passengers are allowed to deplane.     

Intercontinental-airport regulation

This paper analyzes strategic interaction between intercontinental airport regulators, each of which levies airport charges paid by airlines and chooses its airport capacity under conditions of congestion. Congestion from intercontinental flights is common across intercontinental airports since departure and arrival airports are linked one to one, while purely domestic traffic also uses each airport. The paper focuses on two questions. First, if both continents can strategically set separate airport charges for domestic and intercontinental flights, how will the outcome differ from the first-best solution? Second, how is strategic airport behavior affected by the extent of market power of the airlines serving the intercontinental market? We see that strategic airport pricing and capacity choices by regulators lead to a welfare loss: the regulators both behave as monopolists in the market for intercontinental flights, charging a mark-up and decreasing capacity. This welfare loss even overshadows possible negative effects from imperfect competition within the intercontinental airline market. We further discuss how the presence of multiple regulators on one continent or a simple pricing rule might constrain the welfare loss created by strategic airport regulation.     

Operating cost based cruise speed reduction for ground delay programs: Effect of scope length

Ground delay programs typically involve the delaying of aircraft that are departing from origin airports within some set distance of a capacity constrained destination airport. Long haul flights are not delayed in this way. A trade-off exists when fixing the distance parameter: increasing the ‘scope’ distributes delay among more aircraft and may reduce airborne holding delay but could also result in unnecessary delay in the (frequently observed) case of early program cancellation. In order to overcome part of this drawback, a fuel based cruise speed reduction strategy aimed at realizing airborne delay, was suggested by the authors in previous publications. By flying slower, at a specific speed, aircraft that are airborne can recover part of their initially assigned delay without incurring extra fuel consumption if the ground delay program is canceled before planned. In this paper, the effect of the scope of the program is assessed when applying this strategy. A case study is presented by analyzing all the ground delay programs that took place at San Francisco, Newark Liberty and Chicago O’Hare International airports during one year. Results show that by the introduction of this technique it is possible to define larger scopes, partially reducing the amount of unrecovered delay.     

Stochastic optimization models for ground delay program planning with equity–efficiency tradeoffs

Bad weather is a major contributor to air traffic delays. The ration-by-distance algorithm was proposed to increase the efficiency of ground delay program (GDP) planning in situations where there is uncertainty regarding the duration of the weather conditions that motivated the GDP. This algorithm, however, can treat shorter flights unfairly. We describe a two-stage stochastic, multi-objective integer program for GDP planning. This multi-objective approach allows one to balance equity and efficiency. We provide experimental evidence showing the effectiveness of the solutions generated.     

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.     

Impact of slot controls with a market-based allocation mechanism at San Francisco International Airport

This paper presents an empirical analysis of the possible impact of the application of slot controls as a demand-management measure at San Francisco International Airport (SFO). We examine the specific case of slot controls allocated with a market-based mechanism. The paper first describes the nature of the delay problem at SFO and how slot controls would work to manage demand, briefly reviewing their history in the US. We then describe the methodology used to analyze their potential impact given the assumption of a market-based allocation mechanism and present our findings on their predicted impacts on arrival delays and the nature and level of scheduled passenger air service at the airport. Finally, we present conclusions as to the overall potential of slot controls to alleviate delay at SFO and their non-delay consequences. The methods presented in the paper facilitate a detailed analysis of the incidence of the impact of slot controls on passengers, airlines and individual communities that depend on SFO for access to the national air transportation system.     

Multi‐objective airport gate assignment problem in planning and operations

We consider the assignment of gates to arriving and departing flights at a large hub airport. This problem is highly complex even in planning stage when all flight arrivals and departures are assumed to be known precisely in advance. There are various considerations that are involved while assigning gates to incoming and outgoing flights (such a flight pair for the same aircraft is called a turn) at an airport. Different gates have restrictions, such as adjacency, last‐in first‐out gates and towing requirements, which are known from the structure and layout of the airport. Some of the cost components in the objective function of the basic assignment model include notional penalty for not being able to assign a gate to an aircraft, penalty for the cost of towing an aircraft with a long layover, and penalty for not assigning preferred gates to certain turns. One of the major contributions of this paper is to provide mathematical model for all these complex constraints that are observed at a real airport. Further, we study the problem in both planning and operations modes simultaneously, and such an attempt is, perhaps, unique and unprecedented. For planning mode, we sequentially introduce new additional objectives to our gate assignment problem that have not been studied in the literature so far—(i) maximization of passenger connection revenues, (ii) minimization of zone usage costs, and (iii) maximization of gate plan robustness—and include them to the model along with the relevant constraints. For operations mode, the main objectives studied in this paper are recovery of schedule by minimizing schedule variations and maintaining feasibility by minimal retiming in the event of major disruptions. Additionally, the operations mode models must have very, very short run times of the order of a few seconds. These models are then applied to a functional airline at one of its most congested hubs. Implementation is carried out using Optimization Programming Language, and computational results for actual data sets are reported. For the planning mode, analyst perception of weights for the different objectives in the multi‐objective model is used wherever actual dollar value of the objective coefficient is not available. The results are also reported for large, reasonable changes in objective function coefficients. For the operations mode, flight delays are simulated, and the performance of the model is studied. The final results indicate that it is possible to apply this model to even large real‐life problems instances to optimality within short run times with clever formulation of conventional continuous time assignment model. Copyright © 2013 John Wiley & Sons, Ltd.     

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.     

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%.     

Slot misuse phenomena in capacity-constrained airports with seasonal demand: the Greek experience

Abstract

Airport slot misuse disturbs the efficient and continuous operation of capacity-constrained airports, leading to congestion and delay problems. Deviations from the coordinated schedule in regional airport systems that feature seasonal demand and delays in certain peak periods are studied in this article. The Greek airport system is considered as a case study. Deviations are quantified by computing the difference between scheduled and actual aircraft arrival times as well as the hourly slot capacity utilization ratio. Two collective indicators for airport benchmarking are proposed. An in-depth analysis of slot allocation deviations and the delays they cause is carried out for a representative sample of airports that are classified according to the proposed indicators. A brief discussion on potential measures to mitigate slot misuse is also presented.     

Effectiveness of roadside crash countermeasures

In this article, an "intelligent" airline seat inventory control system is developed. Applications of the system are considered for both nonstop flights and flights with stopovers. The system developed is able to recognize a situation characterized by the number of reservations made by individual passenger classes and the number of canceled reservations at a certain moment in time before departure. The system can also make the appropriate decision without knowing the functional relationships in effect between individual variables. As in other intelligent systems, the "intelligent" airline seat inventory control system proposed here is able to generalize, adapt and learn based on new knowledge and new information. The "intelligent" airline seat inventory control system is based on fuzzy logic. The system makes on-line decisions as to whether to accept or reject any passenger request using established fuzzy rules. The "intelligent" system's results are compared with those of the EMSR model for nonstop flights. The results for flights with stopovers are compared with those obtained using integer programming. The final conclusions are very promising.     

Role of the Railways in the Future of Air Transport

Abstract

The role of the railways in the air transport industry is usually limited to provision of access to airports. However, the development of high-speed rail networks and the congestion and environmental problems faced by the air transport industry suggest the railways could have a greater role in working with the airlines to provide an integrated transport service for medium-distance journeys (up to 800 km). Many air journeys involve two flights and a transfer at a hub airport. The alternative being investigated here would replace air journeys by a rail journey and a flight, and a transfer between them at the hub airport. Such integration could offer a positive alternative to aircraft on some routes and lead to railway journeys to airports becoming part of air transport services, and not only to provide access to them. Integration could therefore provide a better use of available air capacity rather than duplicating some high-speed rail routes and services.     

Metaheuristics for efficient aircraft scheduling and re-routing at busy terminal control areas

Intelligent decision support systems for the real-time management of landing and take-off operations can be very effective in helping air traffic controllers to limit airport congestion at busy terminal control areas. The key optimization problem to be solved regards the assignment of airport resources to take-off and landing aircraft and the aircraft sequencing on them. The problem can be formulated as a mixed integer linear program. However, since this problem is strongly NP-hard, heuristic algorithms are typically adopted in practice to compute good quality solutions in a short computation time. This paper presents a number of algorithmic improvements implemented in the AGLIBRARY solver (a state-of-the-art optimization solver to deal with complex routing and scheduling problems) in order to improve the possibility of finding good quality solutions quickly. The proposed framework starts from a good initial solution for the aircraft scheduling problem with fixed routes (given the resources to be traversed by each aircraft), computed via a truncated branch-and-bound algorithm. A metaheuristic is then applied to improve the solution by re-routing some aircraft in the terminal control area. New metaheuristics, based on variable neighbourhood search, tabu search and hybrid schemes, are introduced. Computational experiments are performed on an Italian terminal control area under various types of disturbances, including multiple aircraft delays and a temporarily disrupted runway. The metaheuristics achieve solutions of remarkable quality, within a small computation time, compared with a commercial solver and with the previous versions of AGLIBRARY.     

航班快速恢复建模与仿真研究

随着民用航空的发展与竞争,航班延误不仅影响航空飞行的安全与正常,更与航空公司的运营效率、运营成本及乘客利益息息相关。针对某一恶劣天气影响,对某公司受影响航班进行重新调配,考虑到航班的备降、盘旋等待、延误、取消等多种状态,以总成本最小为目标函数,建立航班快速恢复模型,通过MATLAB运用遗传算法设计航班恢复算法进行求解,得出最经济的航班恢复方案。     

A parameterized consideration set model for airport choice: an application to the San Francisco Bay Area

Airport choice is an important air travel-related decision in multiple airport regions. This paper proposes the use of a probabilistic choice set multinomial logit (PCMNL) model for airport choice that generalizes the multinomial logit model used in all earlier airport choice studies. The paper discusses the properties of the PCMNL model, and applies it to examine airport choice of business travelers residing in the San Francisco Bay Area. Substantive policy implications of the results are discussed. Overall, the results indicate that it is important to analyze the choice (consideration) set formation of travelers. Failure to recognize consideration effects of air travelers can lead to biased model parameters, misleading evaluation of the effects of policy action, and a diminished data fit.     

Robust flight-to-gate assignment using flight presence probabilities

In this paper we present a novel method to improve the robustness of solutions to the Flight-to-Gate Assignment Problem (FGAP), with the aim to reduce the need for gate re-planning due to unpredicted flight schedule disturbances in the daily operations at an airport. We propose an approach in which the deterministic gate constraints are replaced by stochastic gate constraints that incorporate the inherent stochastic flight delays in such a way so as to ensure that the expected gate conflict probability of two flights assigned to the same gate at the same time does not exceed a user-specified value. The novel approach is integrated into an existing multiple time slot FGAP model that relies on a binary integer programming formulation and is tested using real-life data pertaining to Amsterdam Airport Schiphol. The results confirm that the proposed approach holds out great promise to improve the robustness of the FGAP solutions.     

Sensitivity of prices to demand shocks: A natural experiment in the San Francisco Bay Area

We analyze the impact of a freeway interchange collapse in the San Francisco Bay Area on the difference in airfare quotes for travel into the area’s main airports. The incident temporarily made Oakland airport a less attractive choice for traveling to San Francisco, so we hypothesize that fares for travel into Oakland will be relatively lower while the freeway interchange was out of service. We test our contention using a sample of fare quotes collected on-line, and find the expected effect of a magnitude of 6–7%. Our results imply the following important conclusions. First, the demand-side shock was well absorbed by the supply side. Second, adjustment of prices and return to the status quo once the shock vanished was swift.