Integrated revenue management approaches for capacity control with planned upgrades
In many service industries, firms offer a portfolio of similar products based on different types of resources. Mismatches between demand and capacity can therefore often be managed by using product upgrades. Clearly, it is desirable to consider this possibility in the revenue management systems that are used to decide on the acceptance of requests. To incorporate upgrades, we build upon different dynamic programming formulations from the literature and gain several new structural insights that facilitate the control process under certain conditions. We then propose two dynamic programming decomposition approaches that extend the traditional decomposition for capacity control by simultaneously considering upgrades as well as capacity control decisions. While the first approach is specifically suited for the multi-day capacity control problem faced, for example, by hotels and car rental companies, the second one is more general and can be applied in arbitrary network revenue management settings that allow upgrading. Both approaches are formally derived and analytically related to each other. It is shown that they give tighter upper bounds on the optimal solution of the original dynamic program than the well-known deterministic linear program. Using data from a major car rental company, we perform computational experiments that show that the proposed approaches are tractable for real-world problem sizes and outperform those disaggregated, successive planning approaches that are used in revenue management practice today.
If you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
As the access to this document is restricted, you may want to look for a different version under "Related research" (further below) or search for a different version of it.
References listed on IDEAS
Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:
- Kalyan Talluri, 2008. "On bounds for network revenue management," Economics Working Papers 1066, Department of Economics and Business, Universitat Pompeu Fabra, revised May 2009.
- Wen-Chyuan Chiang & Jason C.H. Chen & Xiaojing Xu, 2007. "An overview of research on revenue management: current issues and future research," International Journal of Revenue Management, Inderscience Enterprises Ltd, vol. 1(1), pages 97-128.
- Qian Liu & Garrett van Ryzin, 2008. "On the Choice-Based Linear Programming Model for Network Revenue Management," Manufacturing & Service Operations Management, INFORMS, vol. 10(2), pages 288-310, October.
- Guillermo Gallego & Robert Phillips, 2004. "Revenue Management of Flexible Products," Manufacturing & Service Operations Management, INFORMS, vol. 6(4), pages 321-337, January.
- Joern Meissner & Arne Strauss, 2008.
"Network Revenue Management with Inventory-Sensitive Bid Prices and Customer Choice,"
MRG/0008, Department of Management Science, Lancaster University, revised Apr 2010.
- Meissner, Joern & Strauss, Arne, 2012. "Network revenue management with inventory-sensitive bid prices and customer choice," European Journal of Operational Research, Elsevier, vol. 216(2), pages 459-468.
- Lang, Jan Christian, 2009. "Production and inventory management with substitutions," Publications of Darmstadt Technical University, Institute for Business Studies (BWL) 42531, Darmstadt Technical University, Department of Business Administration, Economics and Law, Institute for Business Studies (BWL).
- Alstrup, Jens & Boas, Soren & Madsen, Oli B. G. & Vidal, ReneVictor Valqui, 1986. "Booking policy for flights with two types of passengers," European Journal of Operational Research, Elsevier, vol. 27(3), pages 274-288, December.
When requesting a correction, please mention this item's handle: RePEc:eee:ejores:v:223:y:2012:i:2:p:380-391. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Zhang, Lei)
If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.
If references are entirely missing, you can add them using this form.
If the full references list an item that is present in RePEc, but the system did not link to it, you can help with this form.
If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your profile, as there may be some citations waiting for confirmation.
Please note that corrections may take a couple of weeks to filter through the various RePEc services.