Fluid Approximations for Revenue Management Under High-Variance Demand

被引:3
作者
Bai, Yicheng [1 ]
El Housni, Omar [1 ]
Jin, Billy [1 ]
Rusmevichientong, Paat [2 ]
Topaloglu, Huseyin [1 ]
Williamson, David P. [1 ]
机构
[1] Cornell Univ, Sch Operat Res & Informat Engn, Ithaca, NY 14853 USA
[2] Univ Southern Calif, Marshall Sch Business, Los Angeles, CA 90089 USA
关键词
revenue management; fluid approximations; dynamic programming-optimal control; high variance;
D O I
10.1287/mnsc.2023.4769
中图分类号
C93 [管理学];
学科分类号
12 ; 1201 ; 1202 ; 120202 ;
摘要
One of the most prevalent demand models in the revenue management literature is based on dividing the selling horizon into a number of time periods such that there is at most one customer arrival at each time period. This demand model is equivalent to using a discrete-time approximation to a Poisson process, but it has an important shortcoming. If the mean number of customer arrivals is large, then the coefficient of variation of the number of customer arrivals has to be small. In other words, large demand volume and large demand variability cannot coexist in this demand model. In this paper, we start with a revenue management model that incorporates general mean and variance for the number of customer arrivals. This revenue management model has a random selling horizon length, capturing the distribution of the number of customer arrivals. The question we seek to answer is the form of the fluid approximation that corresponds to this revenue management model. It is tempting to construct the fluid approximation by computing the expected consumption of the resource capacities in the constraints and the total expected revenue in the objective function through the distribution of the number of customer arrivals. We demonstrate that this answer is wrong in the sense that it yields a fluid approximation that is not asymptotically tight as the resource capacities get large. We give an alternative fluid approximation where perhaps surprisingly, the distribution of the number of customer arrivals does not play any role in the constraints. We show that this fluid approximation is asymptotically tight as the resource capacities get large. A numerical study also demonstrates that the policies driven by the latter fluid approximation perform substantially better, so there is practical value in getting the fluid approximation right under high-variance demand.
引用
收藏
页码:4016 / 4026
页数:11
相关论文
共 16 条
[1]  
Aouad A., 2022, A nonparametric framework for online stochastic matching with correlated arrivals
[2]  
Bai Y, 2022, COORDINATED INVENTOR
[3]  
Balseiro SR, 2021, Survey of Dynamic Resource Constrained Reward Collection Problems: Unified Model and Analysis
[4]   Dynamic Pricing Strategies in the Presence of Demand Shifts [J].
Besbes, Omar ;
Saure, Denis .
M&SOM-MANUFACTURING & SERVICE OPERATIONS MANAGEMENT, 2014, 16 (04) :513-528
[5]   Asymptotic behavior of an allocation policy for revenue management [J].
Cooper, WL .
OPERATIONS RESEARCH, 2002, 50 (04) :720-727
[6]  
Feng Y., 2022, Near-optimal Bayesian online assortment of reusable resources
[7]   A multiproduct dynamic pricing problem and its applications to network yield management [J].
Gallego, G ;
VanRyzin, G .
OPERATIONS RESEARCH, 1997, 45 (01) :24-41
[8]   OPTIMAL DYNAMIC PRICING OF INVENTORIES WITH STOCHASTIC DEMAND OVER FINITE HORIZONS [J].
GALLEGO, G ;
VANRYZIN, G .
MANAGEMENT SCIENCE, 1994, 40 (08) :999-1020
[9]  
Gallego G, 2004, Technical report, CORC Technical Report Tr-2004-01
[10]   A Re-Solving Heuristic with Bounded Revenue Loss for Network Revenue Management with Customer Choice [J].
Jasin, Stefanus ;
Kumar, Sunil .
MATHEMATICS OF OPERATIONS RESEARCH, 2012, 37 (02) :313-345