MSOM
HOME HELP FEEDBACK SUBSCRIPTIONS ARCHIVE SEARCH TABLE OF CONTENTS
 QUICK SEARCH:   [advanced]


     


MANUFACTURING & SERVICE OPERATIONS MANAGEMENT
Vol. 10, No. 3, Summer 2008, pp. 448-467
DOI: 10.1287/msom.1070.0210
This Article
Right arrow Full Text (PDF)
Right arrow References
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Alert me to new issues of the journal
Right arrow Download to citation manager
Right arrow reprints & permissions
Citing Articles
Right arrow Citing Articles via HighWire
Right arrow Citing Articles via Google Scholar
Google Scholar
Right arrow Articles by van Ryzin, G.
Right arrow Articles by Vulcano, G.
Right arrow Search for Related Content

Computing Virtual Nesting Controls for Network Revenue Management Under Customer Choice Behavior

Garrett van Ryzin, Gustavo Vulcano

Graduate School of Business, Columbia University, New York, New York 10027
Stern School of Business, New York University, New York, New York 10012

gjv1{at}columbia.edu
gvulcano{at}stern.nyu.edu

We consider a revenue management, network capacity control problem in a setting where heterogeneous customers choose among the various products offered by a firm (e.g., different flight times, fare classes, and/or routings). Customers may therefore substitute if their preferred products are not offered. These individual customer choice decisions are modeled as a very general stochastic sequence of customers, each of whom has an ordered list of preferences. Minimal assumptions are made about the statistical properties of this demand sequence. We assume that the firm controls the availability of products using a virtual nesting control strategy and would like to optimize the protection levels for its virtual classes accounting for the (potentially quite complex) choice behavior of its customers.

We formulate a continuous demand and capacity approximation for this problem, which allows for the partial acceptance of requests for products. The model admits an efficient calculation of the sample path gradient of the network revenue function. This gradient is then used to construct a stochastic steepest ascent algorithm. We show the algorithm converges in probability to a stationary point of the expected revenue function under mild conditions. The algorithm is relatively efficient even on large network problems, and in our simulation experiments it produces significant revenue increases relative to traditional virtual nesting methods. On a large-scale, real-world airline example using choice behavior models fit to actual booking data, the method produced an estimated 10% improvement in revenue relative to the controls used by the airline. The examples also provide interesting insights into how protection levels should be adjusted to account for choice behavior. Overall, the results indicate that choice behavior has a significant impact on both capacity control decisions and revenue performance and that our method is a viable approach for addressing the problem.

Key Words: choice behavior; revenue management; network capacity control; stochastic approximation; stochastic gradients
History: Received: June 21, 2004; accepted: February 22, 2007.




This article has been cited by other articles:


Home page
Operations ResearchHome page
J. J. M. Bront, I. Mendez-Diaz, and G. Vulcano
A Column Generation Algorithm for Choice-Based Network Revenue Management
Operations Research, May 1, 2009; 57(3): 769 - 784.
[Abstract] [PDF]


Home page
MSOMHome page
T. Bodea, M. Ferguson, and L. Garrow
Data Set--Choice-Based Revenue Management: Data from a Major Hotel Chain
MSOM, April 1, 2009; 11(2): 356 - 361.
[Abstract] [PDF]


Home page
Operations ResearchHome page
G. van Ryzin and G. Vulcano
Simulation-Based Optimization of Virtual Nesting Controls for Network Revenue Management
Operations Research, July 1, 2008; 56(4): 865 - 880.
[Abstract] [PDF]




HOME HELP FEEDBACK SUBSCRIPTIONS ARCHIVE SEARCH TABLE OF CONTENTS
Copyright © 2008 by INFORMS.