Data-Driven Frequency-Based Airline Profit Maximization

Although numerous traditional models predict market share and demand along airline routes, the prediction of existing models is not precise enough, and to the best of our knowledge, there is no use of data mining--based forecasting techniques for improving airline profitability. We propose the maximizing airline profits (MAP) architecture designed to help airlines and make two key contributions in airline market share and route demand prediction and prediction-based airline profit optimization. Compared to past methods used to forecast market share and demand along airline routes, we introduce a novel ensemble forecasting (MAP-EF) approach considering two new classes of features: (i) features derived from clusters of similar routes and (ii) features based on equilibrium pricing. We show that MAP-EF achieves much better Pearson correlation coefficients (greater than 0.95 vs. 0.82 for market share, 0.98 vs. 0.77 for demand) and R2-values compared to three state-of-the-art works for forecasting market share and demand while showing much lower variance. Using the results of MAP-EF, we develop MAP--bilevel branch and bound (MAP-BBB) and MAP-greedy (MAP-G) algorithms to optimally allocate flight frequencies over multiple routes to maximize an airline’s profit. We also study two extensions of the profit maximization problem considering frequency constraints and long-term profits. Furthermore, we develop algorithms for computing Nash equilibrium frequencies when there are multiple strategic airlines. Experimental results show that airlines can increase profits by a significant margin. All experiments were conducted with data aggregated from four sources: the U.S. Bureau of Transportation Statistics (BTS), the U.S. Bureau of Economic Analysis (BEA), the National Transportation Safety Board (NTSB), and the U.S. Census Bureau (CB).

[1]  Dipasis Bhadra,et al.  Structure and dynamics of the core US air travel markets: A basic empirical analysis of domestic passenger demand , 2008, Journal of Air Transport Management.

[2]  Bala Shetty,et al.  The nonlinear knapsack problem - algorithms and applications , 2002, Eur. J. Oper. Res..

[3]  Sergei Vassilvitskii,et al.  k-means++: the advantages of careful seeding , 2007, SODA '07.

[4]  P. Rousseeuw Silhouettes: a graphical aid to the interpretation and validation of cluster analysis , 1987 .

[5]  Ulrich Pferschy,et al.  Dynamic Programming Revisited: Improving Knapsack Algorithms , 1999, Computing.

[6]  G. Dantzig Discrete-Variable Extremum Problems , 1957 .

[7]  S. Kakutani A generalization of Brouwer’s fixed point theorem , 1941 .

[8]  Yaffa Machnes,et al.  THE ROLE OF WEALTH IN THE DEMAND FOR INTERNATIONAL AIR TRAVEL. , 1994 .

[9]  David Pisinger A Minimal Algorithm for the Bounded Knapsack Problem , 1995, IPCO.

[10]  Hans-Peter Kriegel,et al.  A Density-Based Algorithm for Discovering Clusters in Large Spatial Databases with Noise , 1996, KDD.

[11]  Mark Hansen,et al.  Impact of aircraft size and seat availability on airlines' demand and market share in duopoly markets , 2005 .

[12]  Yoshinori Suzuki,et al.  The relationship between on-time performance and airline market share: a new approach , 2000 .

[13]  Deeparnab Chakrabarty,et al.  Knapsack Problems , 2008 .

[14]  Bo An,et al.  MAP: Frequency-Based Maximization of Airline Profits based on an Ensemble Forecasting Approach , 2016, KDD.

[15]  Mark Hansen,et al.  Airline competition in a hub-dominated environment: An application of noncooperative game theory , 1990 .

[16]  Yada Zhu,et al.  Co-Clustering based Dual Prediction for Cargo Pricing Optimization , 2015, KDD.

[17]  Hans Kellerer,et al.  Approximation algorithms for knapsack problems with cardinality constraints , 2000, Eur. J. Oper. Res..

[18]  Christopher M. Bishop,et al.  Pattern Recognition and Machine Learning (Information Science and Statistics) , 2006 .

[19]  Jian Xu,et al.  Smart Pacing for Effective Online Ad Campaign Optimization , 2015, KDD.

[20]  Carl E. Rasmussen,et al.  Gaussian processes for machine learning , 2005, Adaptive computation and machine learning.

[21]  Robert C. Bolles,et al.  Random sample consensus: a paradigm for model fitting with applications to image analysis and automated cartography , 1981, CACM.

[22]  Dipasis Bhadra,et al.  Air Travel by State , 2005 .

[23]  Weinan Zhang,et al.  Optimal real-time bidding for display advertising , 2014, KDD.

[24]  R. L. Thorndike Who belongs in the family? , 1953 .

[25]  Laks V. S. Lakshmanan,et al.  Optimal recommendations under attraction, aversion, and social influence , 2014, KDD.