The most reliable flight itinerary problem

Redmond, Michael; Campbell, Ann Melissa; Ehmke, Jan Fabian

doi:10.1002/net.21866

Cited by 11 publications

(6 citation statements)

References 13 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…According to the 2018 Civil Aviation Industry Development Statistics Report by Civil Aviation Administration of China (CAAC), the total passenger traffic of the whole industry was 61,173,770 which is 10.9% higher than that in 2017. This increase in air traffic and technology development comes with a greater expectation of reliable travel from a passenger perspective [1]. In addition to passengers, air traffic units are paying more and more attention to the reliability of air transport, especially flight block time reliability.…”

Section: Introductionmentioning

confidence: 99%

Assessment of Flight Block Time Reliability Under Different Delay Time Windows: A Case Study

Tian

Wang

et al. 2020

IEEE Access

View full text Add to dashboard Cite

In transportation field, reliability is the probability of reaching the destination from the starting point within the expected time. While the concept of reliability, including travel time reliability model and its evaluation indicators have been extensively studied in ground transportation, they are relatively very scarce in air transportation. Flight block time reliability not only exert a strong influence on passenger behavior but also greatly affect aerodromes, airlines and air traffic management, thus affecting the entire air transportation. This paper proposes a methodology for evaluating the flight block time under different delay time windows. We applied the Density-Based Spatial Clustering of Applications with Noise (DBSCAN) method to set windows which reflects different delays. We proposed a probabilistic model of flight block time based on a series system. A case study is performed to compare flight block time, flight air time, flight taxi-in time, and flight taxi-out time at different time reliability metrics with different delays. In particular, we found the best fit for each flight time segment of three delay time windows among nine well-known distribution functions to calculate the flight block time reliability indexes. Based on our analysis, we find that the reliability of delay time window 3 from 22:20-23:00 to be relatively less compared to the other delay time windows. The results from the reliability estimation demonstrate that the model is efficient in estimating the reliability of flight block time in different delay time windows. INDEX TERMS Flight operations, flight block time reliability, flight time distribution, DBSCAN, flight delay.

show abstract

Section: Introductionmentioning

confidence: 99%

Assessment of Flight Block Time Reliability Under Different Delay Time Windows: A Case Study

Tian

Wang

et al. 2020

IEEE Access

View full text Add to dashboard Cite

show abstract

“…e increase in air traffic and technology development comes with a greater expectation of reliable travel from the passenger perspective [11]. e travel time reliability is the variations in journey time that travellers cannot predict in ground transportation [12].…”

Section: Literature Reviewmentioning

confidence: 99%

“…Here, equation (11) is the objective function which ensures that the worst case of unfairness differs as little as possible from the average fairness by minimizing the maximum distance between the fairness metric of an airline and the average fairness metric of all airlines. Equation (12) requests that the reliability of flight block time for airport pair g, air season j, and aircraft type r is supposed to be in the range from σ to σ.…”

Section: E Fairness Metricmentioning

confidence: 99%

An Improved Whale Algorithm for Setting Standard Scheduled Block Time Based on the Airline Fairness

Wang

Tian

Lin

et al. 2020

Discrete Dynamics in Nature and Society

View full text Add to dashboard Cite

Standard scheduled flight block time (SBT) setting is of great concern for Civil Aviation Administration of China (CAAC) and airlines in China. However, the standard scheduled flight block times are set in the form of on-site meetings in practice and current literature has not provided any efficient mathematical models to calculate the flight block times fairly among the airlines. The objective of this paper is to develop and solve a mathematical model for standard SBT setting with consideration of both fairness and reliability. We use whale optimization algorithm (WOA) and an improved version of the whale optimization algorithm (IWOA) to solve the SBT setting problem. A novel nonlinear update equation of convergence factor for random iterations is used in place of the original linear one in the proposed IWOA algorithm. Experimental results show that the suggested approach is effective, and IWOA performs better than WOA in the concerned problem, whose solutions are better compared to the flight block times released by CAAC. In particular, it is interesting to find that MSE, RMSE, MAE, MAPE and Theil of the reliability in 60%–70% range are always the smallest and the average fairness of airlines is better than that of 60%–75% range. The model and solving approach presented in this article have great potential to be applied by CAAC to determine the standard SBTs strategically.

show abstract

“…They propose branch-and-bound approaches that solve instances with up to 50 nodes within one hour and a half of computing time. Similarly, [8] proposes an approach to find the most reliable multi-leg (single path) flight itinerary to reach a destination within a time limit. The authors suppose that each edge of the network is a leg departing and arriving at given times, which are modeled by certain probability distributions.…”

Section: Introductionmentioning

confidence: 99%

Optimization algorithms for resilient path selection in networks

Casazza

Ceselli

2021

Computers & Operations Research

View full text Add to dashboard Cite

We study a Resilient Path Selection Problem (RPSP) arising in the design of communication networks with reliability guarantees. A graph is given, in which every arc has a cost and a probability of failure, and in which two nodes are marked as source and destination. The aim of our RPSP is to find a subgraph of minimum cost, containing a set of paths from the source to the destination nodes, such that the probability that all paths fail simultaneously is lower than a given threshold. We explore its theoretical properties and show that, despite a few interesting special cases can be solved in polynomial time, it is in general NP-hard. In fact, we prove that even deciding if a given subgraph has a probability of failure not exceeding a given threshold is already NP-Complete. We therefore introduce an integer relaxation that simplifies the computation of such probability, and we design an exact algorithm for the full RPSP exploiting this relaxation and other ad-hoc procedures. We present computational results, highlighting that our exact algorithms can handle graphs with up to 30 nodes within minutes of computing time, consistently producing proven optimal solutions. Moreover, we show that our algorithms can be used also as heuristics, outperforming path protection schemes from the literature also on much larger networks.

show abstract

The most reliable flight itinerary problem

Cited by 11 publications

References 13 publications

Assessment of Flight Block Time Reliability Under Different Delay Time Windows: A Case Study

Assessment of Flight Block Time Reliability Under Different Delay Time Windows: A Case Study

An Improved Whale Algorithm for Setting Standard Scheduled Block Time Based on the Airline Fairness

Optimization algorithms for resilient path selection in networks

Contact Info

Product

Resources

About