Publikationen
Zahlreiche Veröffentlichungen sind auch zum Download verfügbar: http://ssrn.com/author=1005596.
Art der Publikation: Beitrag in Zeitschrift
Integrated Revenue Management Approaches for Capacity Control with Planned Upgrades
- Autor(en):
- Steinhardt, C.; Gönsch, J.
- Titel der Zeitschrift:
- European Journal of Operational Research
- Jahrgang (Veröffentlichung):
- 223 (2012)
- Heftnummer:
- 2
- Seiten:
- 380-391
- Schlagworte:
- Revenue management;Upgrades; Capacity control; Dynamic programming; Decomposition;Car rental
- Volltext:
- Integrated Revenue Management Approaches for Capacity Control with Planned Upgrades (844 KB)
- Link zum Volltext:
- https://doi.org/10.1016/j.ejor.2012.05.047
- Zitation:
- Download BibTeX
Kurzfassung
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.