Title: A discrete-time dynamic programming approach for network airline revenue management

Authors: Jingying Li; Alberto Garcia-Diaz; Joseph Hubert Wilck IV

Addresses: Department of Industrial and Information Engineering, University of Tennessee, 410 East Stadium Hall, Knoxville, TN 37996, USA ' Department of Industrial and Information Engineering, University of Tennessee, 410 East Stadium Hall, Knoxville, TN 37996, USA ' Department of Engineering, East Carolina University, 204 Slay Building, Mail Stop 117, Greenville, NC 27858-4353, USA

Abstract: A discrete-time dynamic programming (DP) model is proposed to determine the optimal bid price for each booking request under both single and multiple booking scenarios. The optimal revenue function and opportunity cost are analysed and an asymptotical property is presented. Several approximation schemes to solve the DP model are proposed, including the network decomposition method and the function approximation technique. The solution methodology is discussed and the performance of the different methods is evaluated by their computational efficiencies and revenue impacts. The results show that the proposed approximation algorithms represent a major step forward in terms of revenue growth and computational ability.

Keywords: revenue management; dynamic programming; networks; airline industry; optimal bid price; booking requests; network decomposition; function approximation; group bookings; passenger demand; network bid price control.

DOI: 10.1504/IJIDS.2014.059732

International Journal of Information and Decision Sciences, 2014 Vol.6 No.1, pp.1 - 26

Published online: 05 Jul 2014 *

Full-text access for editors Full-text access for subscribers Purchase this article Comment on this article