標題: A dynamic programming algorithm based on expected revenue approximation for the network revenue management problem
作者: Huang, Kuancheng
Liang, Yu-Tung
運輸與物流管理系
註:原交通所+運管所

Department of Transportation and Logistics Management
關鍵字: Revenue management;Seat control policy;Dynamic programming
公開日期: 1-五月-2011
摘要: Since American Airlines successfully applied revenue management (RM) to raise its revenue, RM has become a common technique in the airline industry. Due to the current hub-and-spoke operation of the airline industry, the focus of RM research has shifted from the traditional single-leg problem to the network-type problem. The mainstream approaches, bid price and virtual nesting, are faced with some limitations such as inaccuracy due to their suboptimal nature and operation interruption caused by the required updates. This study developed an algorithm to generate a seat control policy by approximating the expected revenue function in a dynamic programming (DP) model. In order to deal with the issue of dimensionality for the DP model in a network context, this study used a suitable parameterized function and a sampling concept to achieve the approximation. In the numerical experiment, the objective function value of the developed algorithm was very close to the one achieved by the optimal control. We believe that this approach can serve as an alternative to the current mainstream approaches for the network RM problem for airlines and will provide an inspiring concept for other types of multi-resource RM problems. (C) 2010 Elsevier Ltd. All rights reserved.
URI: http://dx.doi.org/10.1016/j.tre.2010.11.005
http://hdl.handle.net/11536/32064
ISSN: 1366-5545
DOI: 10.1016/j.tre.2010.11.005
期刊: TRANSPORTATION RESEARCH PART E-LOGISTICS AND TRANSPORTATION REVIEW
Volume: 47
Issue: 3
起始頁: 333
結束頁: 341
顯示於類別:會議論文


文件中的檔案:

  1. 000287543000005.pdf

若為 zip 檔案,請下載檔案解壓縮後,用瀏覽器開啟資料夾中的 index.html 瀏覽全文。