Robust Controls for Network Revenue Management
Georgia Perakis,
Guillaume Roels
Sloan School of Management, Massachusetts Institute of Technology, Cambridge, Massachusetts 02139
Anderson School of Management, University of California, Los Angeles, California 90095
georgiap{at}mit.edu
groels{at}anderson.ucla.edu
Revenue management models traditionally assume that future demand is unknown but can be described by a stochastic process or a probability distribution. Demand is, however, often difficult to characterize, especially in new or nonstationary markets. In this paper, we develop robust formulations for the capacity allocation problem in revenue management using the maximin and the minimax regret criteria under general polyhedral uncertainty sets. Our approach encompasses the following open-loop controls: partitioned booking limits, nested booking limits, displacement-adjusted virtual nesting, and fixed bid prices. In specific problem instances, we show that a booking policy of the type of displacement-adjusted virtual nesting is robust, both from a maximin and a minimax regret perspectives. Our numerical analysis reveals that the minimax regret controls perform very well on average, despite their worst-case focus, and outperform the traditional controls when demand is correlated or censored. In particular, on real large-scale problem sets, the minimax regret approach outperforms by up to 2% the traditional heuristics. The maximin controls are more conservative but have the merit of being associated with a minimum revenue guarantee. Our models are scalable to solve practical problems because they combine efficient (exact or heuristic) solution methods with very modest data requirements.
Key Words: revenue management; yield management; network; robust optimization; regret
History: Received: November 20, 2006;
accepted: November 20, 2008.
Copyright © 2009 by INFORMS.
