## 摘要

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.

原文 | English |
---|---|

頁（從 - 到） | 333-341 |

頁數 | 9 |

期刊 | Transportation Research Part E: Logistics and Transportation Review |

卷 | 47 |

發行號 | 3 |

DOIs | |

出版狀態 | Published - 1 1月 2011 |