Itinerary-based nesting control with upsell

Journal of Revenue and Pricing Management - Tập 15 - Trang 107-137 - 2016
Chan Seng Pun, Diego Klabjan1, Fikri Karaesmen2, Sergey Shebalov3
1Northwestern University, Evanston, USA
2Koc University, Istanbul Turkey
3Sabre Holdings, Southlake, USA

Tóm tắt

In order to accept future high-yield booking requests, airlines protect seats from low-yield passengers. More seats may be reserved when passengers faced with closed fare classes can upsell to open higher fare classes. We address the airline revenue management problem with capacity nesting and customer upsell, and formulate this problem by a stochastic optimization model to determine a set of static protection levels for each itinerary. We apply an approximate dynamic programming framework to approximate the objective function by piecewise linear functions, whose slopes (marginal revenue) are iteratively updated and returned by an efficient heuristic that simultaneous handles both nesting and upsells. The resulting allocation policy is tested over a real airline network and benchmarked against the randomized linear programming bid-price policy under various demand settings. Simulation results suggest that the proposed allocation policy significantly outperforms when incremental demand or upsell probability are high. Structural analyses are also provided for special demand dependence cases.

Tài liệu tham khảo

Belobaba, P.P. and Weatherford, L.R. (1996) Comparing decision rules that incorporate customer diversion in perishable asset revenue management situations. Decision Sciences Journal 27 (2): 343–363. Bitran, G. and Caldentey, R. (2003) An overview of pricing models for revenue management. Manufacturing & Service Operations Management 5 (3): 203–229. Brumelle, S.L. and McGill, J.I. (1993) Airline seat allocation with multiple nested fare classes. Operations Research 41 (1): 127–137. Brumelle, S.L., McGill, J.I., Oum, T., Sawaki, K. and Tretheway, M.W. (1990) Allocation of airline seats between stochastically dependent demands. Transportation Science 24 (3): 183–192. Chen, L. and Homem-de-Mello, T. (2010) Re-solving stochastic programming models for airline revenue management. Annals of Operations Research 177 (1): 91–114. Cooper, W.L. (2002) Asymptotic behavior of an allocation policy for revenue management. Operations Research 50 (4): 720–727. Cooper, W.L. and Gupta, D. (2006) Stochastic comparisons in airline revenue management. Manufacturing & Service Operations Management 8 (3): 221–234. Curry, R.E. (1990) Optimal airline seat allocation with fare classes nested by origins and destinations. Transportation Science 24 (3): 193–204. de Boer, S.V., Freling, R. and Piersma, N. (2002) Mathematical programming for network revenue management revisited. European Journal of Operational Research 137 (1): 72–92. Fiig, T., Isler, K., Hopperstad, C. and Belobaba, P.P. (2010) Optimization of mixed fare structures: Theory and applications. Journal of Revenue and Pricing Management 9 (1/2): 1–19. Gallego, G., Li, L. and Ratliff, R. (2009) Choice-based EMSR methods for single-leg revenue management with demand dependencies. Journal of Revenue and Pricing Management 8 (2/3): 207–240. Grimmett, G. and Stirzaker, D. (2001) Probability and Random Processes. 3rd edn. Oxford University Press, NYC, USA. Higle, J.L. (2007) Bid-price control with origin-destination demand: A stochastic programming approach. Journal of Revenue and Pricing Management 5 (4): 291–304. Li, M.Z.F. and Oum, T.H. (2002) A note on the single leg, multifare seat allocation problem. Transportation Science 36 (3): 349. Littlewood, K. (ed.) (1972) Forecasting and control of passenger bookings, Volume 12. The 12th AGIFORS Symposium, Nathanya, Israel. Liu, Q. and van Ryzin, G. (2008) On the choice-based linear programming model for network revenue management. Manufacturing Service Operations Management 10 (2): 288–310. McGill, J.I. and Van Ryzin, G.J. (1999) Revenue management: Research overview and prospects. Transportation Science 33 (2): 233. Powell, W.B. (2007) Approximate dynamic programming: Solving the curses of dimensionality. Wiley Series in Probability and Statistics. 1st edn. Wiley-Interscience: NYC,USA. Powell, W., Ruszczynski, A. and Topaloglu, H. (2004) Learning algorithms for separable approximations of discrete stochastic optimization problems. Mathematics of Operations Research 29 (4): 814–836. Robinson, L.W. (1995) Optimal and approximate control policies for airline booking with sequential nonmonotonic fare classes. Operations Research 43 (2): 252–263. Talluri, K. and van Ryzin, G. (1998) An analysis of bid-price controls for network revenue management. Management Science 44 (11): 1577–1593. Talluri, K. and Van Ryzin, G. (1999) A randomized linear programming method for computing network bid prices. Transportation Science 33 (2): 207–216. Talluri, K. and van Ryzin, G. (2004) The theory and practice of revenue management. International Series in Operations Research & Management Science. 1st edn. Springer: NYC, USA. Topaloglu, H. (2009) On the asymptotic optimality of the randomized linear program for network revenue management. European Journal of Operational Research 197 (3): 884–896. van Ryzin, G.J. and McGill, J.I. (2000) Revenue management without forecasting of optimization: An adaptive algorithm for determining airline seat protection levels. Management Science 46 (6): 760–775. Williamson, E.L. (1992) Airline network seat inventory control: Methodologies and revenue impacts. PhD thesis, Massachusetts Institution of Technology, Cambridge, MA. Wollmer, R.D. (1992) An airline seat management model for a single leg route when lower fare classes book first. Operations Research 40 (1): 26–37. Zhang, D. and Adelman, D. (2009) An approximate dynamic programming approach to network revenue management with customer choice. Transportation Science 43 (3): 381–394.