A Stochastic Approximation Method to Compute Bid Prices in Network Revenue Management Problems

We present a stochastic approximation method to compute bid prices in network revenue management problems. The key idea is to visualize the total expected revenue as a function of the bid prices and to use sample path-based derivatives to search for a good set of bid prices. We deal with the discrete nature of the network revenue management setting by formulating a smoothed version of the problem, which assumes that it is possible to accept a fraction of an itinerary request. We show that the iterates of our method converge to a stationary point of the total expected revenue function of the smoothed version. Computational experiments demonstrate that the bid prices obtained by our method outperform the ones obtained by standard benchmark methods, and our method is especially advantageous when the bid prices are not recomputed frequently.

[1]  K. Talluri,et al.  The Theory and Practice of Revenue Management , 2004 .

[2]  Itir Z. Karaesmen,et al.  Overbooking with Substitutable Inventory Classes , 2004, Oper. Res..

[3]  P. Glynn,et al.  Stochastic Optimization by Simulation: Convergence Proofs for the GI/G/1 Queue in Steady-State , 1994 .

[4]  Paul Glasserman,et al.  Sensitivity Analysis for Base-Stock Levels in Multiechelon Production-Inventory Systems , 1995 .

[5]  Daniel Adelman,et al.  Dynamic Bid Prices in Revenue Management , 2007, Oper. Res..

[6]  Huseyin Topaloglu,et al.  Using Stochastic Approximation Methods to Compute Optimal Base-Stock Levels in Inventory Control Problems , 2008, Oper. Res..

[7]  Michael C. Fu,et al.  Sample Path Derivatives for (s, S) Inventory Systems , 1994, Oper. Res..

[8]  Ioana Popescu,et al.  Revenue Management in a Dynamic Network Environment , 2003, Transp. Sci..

[9]  Paul Glasserman.  Perturbation Analysis of Production Networks , 1994 .

[10]  Dimitris Bertsimas,et al.  Simulation-Based Booking Limits for Airline Revenue Management , 2005, Oper. Res..

[11]  M. Fu,et al.  Optimization of( s, S ) inventory systems with random lead times and a service level constraint , 1998 .

[12]  John N. Tsitsiklis,et al.  Neuro-Dynamic Programming , 1996, Encyclopedia of Machine Learning.

[13]  Garrett J. van Ryzin,et al.  A Randomized Linear Programming Method for Computing Network Bid Prices , 1999, Transp. Sci..

[14]  Garrett J. van Ryzin,et al.  Stocking Retail Assortments Under Dynamic Consumer Substitution , 2001, Oper. Res..

[15]  Huseyin Topaloglu,et al.  Using Lagrangian Relaxation to Compute Capacity-Dependent Bid Prices in Network Revenue Management , 2009, Oper. Res..

[16]  G. Ryzin,et al.  Revenue Management Without Forecasting or Optimization: An Adaptive Algorithm for Determining Airline Seat Protection Levels , 2000 .

[17]  K. Talluri,et al.  An Analysis of Bid-Price Controls for Network Revenue Management , 1998 .

[18]  Garrett J. van Ryzin,et al.  Computing Virtual Nesting Controls for Network Revenue Management Under Customer Choice Behavior , 2008, Manuf. Serv. Oper. Manag..

[19]  P. Glynn,et al.  Stochastic optimization by simulation: numerical experiments with the M / M /1 queue in steady-state , 1994 .

[20]  Elizabeth Louise Williamson,et al.  Airline network seat inventory control : methodologies and revenue impacts , 1992 .

[21]  Garrett J. van Ryzin,et al.  Simulation-Based Optimization of Virtual Nesting Controls for Network Revenue Management , 2008, Oper. Res..

[22]  Harold J. Kushner,et al.  wchastic. approximation methods for constrained and unconstrained systems , 1978 .

[23]  S. Fotopoulos.  Stochastic modeling and analysis of manufacturing systems , 1996 .