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


     


OPERATIONS RESEARCH
Vol. 53, No. 1, January-February 2005, pp. 90-106
DOI: 10.1287/opre.1040.0164
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 Bertsimas, D.
Right arrow Articles by de Boer, S.
Right arrow Search for Related Content

Simulation-Based Booking Limits for Airline Revenue Management

Dimitris Bertsimas, Sanne de Boer

Operations Research Center, Massachusetts Institute of Technology, 77 Massachusetts Avenue, E40-130, Cambridge, Massachusetts 02139
Operations Research Center, Massachusetts Institute of Technology, 77 Massachusetts Avenue, E40-130, Cambridge, Massachusetts 02139

dbertsim{at}mit.edu
sanne{at}alum.mit.edu

Deterministic mathematical programming models that capture network effects play a predominant role in the theory and practice of airline revenue management. These models do not address important issues like demand uncertainty, nesting, and the dynamic nature of the booking process. Alternatively, the network problem can be broken down into leg-based problems for which there are satisfactory solution methods, but this approach cannot be expected to capture all relevant network aspects. In this paper, we propose a new algorithm that addresses these issues. Starting with any nested booking-limit policy, we combine a stochastic gradient algorithm and approximate dynamic programming ideas to improve the initial booking limits. Preliminary simulation experiments suggest that the proposed algorithm can lead to practically significant revenue enhancements.

Subject classifications: simulation:applications; inventory:perishable items; transportation:airlines.
History: Received January 2001; revision received December 2003; accepted December 2003.




This article has been cited by other articles:


Home page
INFORMS Journal on ComputingHome page
H. Topaloglu
A Stochastic Approximation Method to Compute Bid Prices in Network Revenue Management Problems
INFORMS Journal on Computing, September 1, 2008; 20(4): 596 - 610.
[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 page
MSOMHome page
G. van Ryzin and G. Vulcano
Computing Virtual Nesting Controls for Network Revenue Management Under Customer Choice Behavior
MSOM, June 1, 2008; 10(3): 448 - 467.
[Abstract] [PDF]


Home page
Transportation ScienceHome page
H. Topaloglu and W. Powell
Incorporating Pricing Decisions into the Stochastic Dynamic Fleet Management Problem
Transportation Science, August 1, 2007; 41(3): 281 - 301.
[Abstract] [PDF]


Home page
Transportation ScienceHome page
W. L. Cooper and T. Homem-de-Mello
Some Decomposition Methods for Revenue Management
Transportation Science, August 1, 2007; 41(3): 332 - 353.
[Abstract] [PDF]


Home page
Operations ResearchHome page
D. Adelman
Dynamic Bid Prices in Revenue Management
Operations Research, July 1, 2007; 55(4): 647 - 661.
[Abstract] [PDF]


Home page
INFORMS Journal on ComputingHome page
P. Pai, E. Gad, R. Achar, M. Nakhla, and R. Khazaka
A Projection-Based Reduction Approach to Computing Sensitivity of Steady-State Response of Nonlinear Circuits
INFORMS Journal on Computing, January 1, 2006; 18(2): 173 - 185.
[Abstract] [PDF]




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