A single-resource revenue management problem with random resource consumptions

被引:13
作者
Zhuang, W. [2 ]
Gumus, M. [1 ]
Zhang, D. [3 ]
机构
[1] McGill Univ, Desautels Fac Management, Operat Management Area, Montreal, PQ H3A 1G5, Canada
[2] Xiamen Univ, Sch Management, Xiamen, Fujian, Peoples R China
[3] Univ Colorado, Leeds Sch Business, Boulder, CO 80309 USA
关键词
revenue management; dynamic programming; transportation; STOCHASTIC KNAPSACK-PROBLEM; YIELD MANAGEMENT; MODEL; OVERBOOKING;
D O I
10.1057/jors.2011.129
中图分类号
C93 [管理学];
学科分类号
12 ; 1201 ; 1202 ; 120202 ;
摘要
We study a single-resource multi-class revenue management problem where the resource consumption for each class is random and only revealed at departure. The model is motivated by cargo revenue management problems in the airline and other shipping industries. We study how random resource consumption distribution affects the optimal expected profit and identify a preference acceptance order on classes. For a special case where the resource consumption for each class follows the same distribution, we fully characterize the optimal control policy. We then propose two easily computable heuristics: (i) a class-independent heuristic through parameter scaling, and (ii) a decomposition heuristic that decomposes the dynamic programming formulation into a collection of one-dimensional problems. We conduct extensive numerical experiments to investigate the performance of the two heuristics and compared them with several widely studied heuristic policies. Our results show that both heuristics work very well, with class-independent heuristic slightly better between the two. In particular, they consistently outperform heuristics that ignore demand and/or resource consumption uncertainty. Our results demonstrate the importance of considering random resource consumption as another problem dimension in revenue management applications. Journal of the Operational Research Society (2012) 63, 1213-1227. doi:10.1057/jors.2011.129 Published online 14 December 2011
引用
收藏
页码:1213 / 1227
页数:15
相关论文
共 22 条
[1]   Single-leg air-cargo revenue management [J].
Amaruchkul, Kannapha ;
Cooper, William L. ;
Gupta, Diwakar .
TRANSPORTATION SCIENCE, 2007, 41 (04) :457-469
[2]  
Becker B, 2007, J REVENUE PRICING MA, V6, P175, DOI 10.1057/palgrave.rpm.5160084
[3]  
Billings JohnS., 2003, J REVENUE PRICING MA, V2, P69
[4]  
Boeing, 2009, WORLD AIR CARG FOR 2
[5]  
Gupta D, 2008, J REVENUE PRICING MA, V7, P341, DOI 10.1057/rpm.2008.29
[6]   A Markov model for single-leg air cargo revenue management under a bid-price policy [J].
Han, Dong Ling ;
Tang, Loon Ching ;
Huang, Huei Chuen .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2010, 200 (03) :800-811
[7]   An approximate algorithm for the two-dimensional air cargo revenue management problem [J].
Huang, Kuancheng ;
Chang, Ko-chen .
TRANSPORTATION RESEARCH PART E-LOGISTICS AND TRANSPORTATION REVIEW, 2010, 46 (03) :426-435
[8]   Air cargo revenue management: Characteristics and complexities [J].
Kasilingam, RG .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1997, 96 (01) :36-44
[9]   The dynamic and stochastic knapsack problem [J].
Kleywegt, AJ ;
Papastavrou, JD .
OPERATIONS RESEARCH, 1998, 46 (01) :17-35
[10]   The dynamic and stochastic knapsack problem with random sized items [J].
Kleywegt, AJ ;
Papastavrou, JD .
OPERATIONS RESEARCH, 2001, 49 (01) :26-41