Advanced Search
MyIDEAS: Login

A dynamic programming algorithm based on expected revenue approximation for the network revenue management problem

Contents:

Author Info

  • Huang, Kuancheng
  • Liang, Yu-Tung
Registered author(s):

    Abstract

    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.

    Download Info

    If you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
    File URL: http://www.sciencedirect.com/science/article/pii/S1366554510001092
    Download Restriction: Full text for ScienceDirect subscribers only

    As the access to this document is restricted, you may want to look for a different version under "Related research" (further below) or search for a different version of it.

    Bibliographic Info

    Article provided by Elsevier in its journal Transportation Research Part E: Logistics and Transportation Review.

    Volume (Year): 47 (2011)
    Issue (Month): 3 (May)
    Pages: 333-341

    as in new window
    Handle: RePEc:eee:transe:v:47:y:2011:i:3:p:333-341

    Contact details of provider:
    Web page: http://www.elsevier.com/wps/find/journaldescription.cws_home/600244/description#description

    Order Information:
    Postal: http://www.elsevier.com/wps/find/journaldescription.cws_home/600244/bibliographic
    Web: http://www.elsevier.com/wps/find/journaldescription.cws_home/600244/bibliographic

    Related research

    Keywords: Revenue management Seat control policy Dynamic programming;

    References

    No references listed on IDEAS
    You can help add them by filling out this form.

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as in new window

    Cited by:
    1. Huang, Kuancheng & Lin, Chia-Yi, 2014. "A simulation analysis for the re-solving issue of the network revenue management problem," Journal of Air Transport Management, Elsevier, vol. 38(C), pages 36-42.

    Lists

    This item is not listed on Wikipedia, on a reading list or among the top items on IDEAS.

    Statistics

    Access and download statistics

    Corrections

    When requesting a correction, please mention this item's handle: RePEc:eee:transe:v:47:y:2011:i:3:p:333-341. See general information about how to correct material in RePEc.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Zhang, Lei).

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If references are entirely missing, you can add them using this form.

    If the full references list an item that is present in RePEc, but the system did not link to it, you can help with this form.

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your profile, as there may be some citations waiting for confirmation.

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.