IDEAS home Printed from https://ideas.repec.org/a/eee/jaitra/v38y2014icp36-42.html
   My bibliography  Save this article

A simulation analysis for the re-solving issue of the network revenue management problem

Author

Listed:
  • Huang, Kuancheng
  • Lin, Chia-Yi

Abstract

The classic dynamic programming approach is not applicable to the airline network revenue management (RM) problem of a practical size due to the curse of dimensionality. Many heuristic methods, including the most popular bid-price control approach, generate the approximate control decisions based on various static formulations, which need to be re-solved to take into account the dynamic features of the problem. By a simulation experiment, this study examines the re-solving issue of the bid-price method and tests a new method, the parameterized function approach, in which no problem-resolving is required. Based on the results, the parameterized function approach is found to be a promising alternative. As for the bid-price control approach, a high re-solving frequency is needed for a good result.

Suggested Citation

  • 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.
    • Handle: RePEc:eee:jaitra:v:38:y:2014:i:c:p:36-42
    DOI: 10.1016/j.jairtraman.2013.12.016
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0969699713001609
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.jairtraman.2013.12.016?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. William L. Cooper, 2002. "Asymptotic Behavior of an Allocation Policy for Revenue Management," Operations Research, INFORMS, vol. 50(4), pages 720-727, August.
    2. Mustafa Akan & Barış Ata, 2009. "Bid-Price Controls for Network Revenue Management: Martingale Characterization of Optimal Bid Prices," Mathematics of Operations Research, INFORMS, vol. 34(4), pages 912-936, November.
    3. Sumit Kunnumkal & Huseyin Topaloglu, 2010. "Computing Time-Dependent Bid Prices in Network Revenue Management Problems," Transportation Science, INFORMS, vol. 44(1), pages 38-62, February.
    4. Huseyin Topaloglu, 2009. "Using Lagrangian Relaxation to Compute Capacity-Dependent Bid Prices in Network Revenue Management," Operations Research, INFORMS, vol. 57(3), pages 637-649, June.
    5. Nicola Secomandi, 2008. "An Analysis of the Control-Algorithm Re-solving Issue in Inventory and Revenue Management," Manufacturing & Service Operations Management, INFORMS, vol. 10(3), pages 468-483, December.
    6. Lijian Chen & Tito Homem-de-Mello, 2010. "Re-solving stochastic programming models for airline revenue management," Annals of Operations Research, Springer, vol. 177(1), pages 91-114, June.
    7. Meissner, Joern & Strauss, Arne, 2012. "Network revenue management with inventory-sensitive bid prices and customer choice," European Journal of Operational Research, Elsevier, vol. 216(2), pages 459-468.
    8. L. F. Escudero & J. F. Monge & D. Romero Morales & J. Wang, 2013. "Expected Future Value Decomposition Based Bid Price Generation for Large-Scale Network Revenue Management," Transportation Science, INFORMS, vol. 47(2), pages 181-197, May.
    9. Jeffrey I. McGill & Garrett J. van Ryzin, 1999. "Revenue Management: Research Overview and Prospects," Transportation Science, INFORMS, vol. 33(2), pages 233-256, May.
    10. Huang, Kuancheng & Liang, Yu-Tung, 2011. "A dynamic programming algorithm based on expected revenue approximation for the network revenue management problem," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 47(3), pages 333-341, May.
    11. Daniel Adelman, 2007. "Dynamic Bid Prices in Revenue Management," Operations Research, INFORMS, vol. 55(4), pages 647-661, August.
    12. Wen-Chyuan Chiang & Jason C.H. Chen & Xiaojing Xu, 2007. "An overview of research on revenue management: current issues and future research," International Journal of Revenue Management, Inderscience Enterprises Ltd, vol. 1(1), pages 97-128.
    13. Huseyin Topaloglu, 2008. "A Stochastic Approximation Method to Compute Bid Prices in Network Revenue Management Problems," INFORMS Journal on Computing, INFORMS, vol. 20(4), pages 596-610, November.
    14. Stefanus Jasin & Sunil Kumar, 2012. "A Re-Solving Heuristic with Bounded Revenue Loss for Network Revenue Management with Customer Choice," Mathematics of Operations Research, INFORMS, vol. 37(2), pages 313-345, May.
    15. Michael O. Ball & Maurice Queyranne, 2009. "Toward Robust Revenue Management: Competitive Analysis of Online Booking," Operations Research, INFORMS, vol. 57(4), pages 950-963, August.
    16. Lawrence R. Weatherford & Samuel E. Bodily, 1992. "A Taxonomy and Research Overview of Perishable-Asset Revenue Management: Yield Management, Overbooking, and Pricing," Operations Research, INFORMS, vol. 40(5), pages 831-844, October.
    Full references (including those not matched with items on IDEAS)

    Citations

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


    Cited by:

    1. Li, Dongjun & Islam, Dewan Md Zahurul & Robinson, Mark & Song, Dong-Ping & Dong, Jing-Xin & Reimann, Marc, 2024. "Network revenue management game in the railway industry: Stackelberg equilibrium, global optimality, and mechanism design," European Journal of Operational Research, Elsevier, vol. 312(1), pages 240-254.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Strauss, Arne K. & Klein, Robert & Steinhardt, Claudius, 2018. "A review of choice-based revenue management: Theory and methods," European Journal of Operational Research, Elsevier, vol. 271(2), pages 375-387.
    2. Yuhang Ma & Paat Rusmevichientong & Mika Sumida & Huseyin Topaloglu, 2020. "An Approximation Algorithm for Network Revenue Management Under Nonstationary Arrivals," Operations Research, INFORMS, vol. 68(3), pages 834-855, May.
    3. L. F. Escudero & J. F. Monge & D. Romero Morales & J. Wang, 2013. "Expected Future Value Decomposition Based Bid Price Generation for Large-Scale Network Revenue Management," Transportation Science, INFORMS, vol. 47(2), pages 181-197, May.
    4. Nicolas Houy & François Le Grand, 2015. "The Monte Carlo first-come-first-served heuristic for network revenue management," Working Papers halshs-01155698, HAL.
    5. Meissner, Joern & Strauss, Arne, 2012. "Improved bid prices for choice-based network revenue management," European Journal of Operational Research, Elsevier, vol. 217(2), pages 417-427.
    6. Nicolas Houy & François Le Grand, 2015. "Financing and advising with (over)confident entrepreneurs : an experimental investigation," Working Papers 1514, Groupe d'Analyse et de Théorie Economique Lyon St-Étienne (GATE Lyon St-Étienne), Université de Lyon.
    7. Catherine Cleophas & Daniel Kadatz & Sebastian Vock, 2017. "Resilient revenue management: a literature survey of recent theoretical advances," Journal of Revenue and Pricing Management, Palgrave Macmillan, vol. 16(5), pages 483-498, October.
    8. Syed Asif Raza & Rafi Ashrafi & Ali Akgunduz, 2020. "A bibliometric analysis of revenue management in airline industry," Journal of Revenue and Pricing Management, Palgrave Macmillan, vol. 19(6), pages 436-465, December.
    9. Meissner, Joern & Strauss, Arne, 2012. "Network revenue management with inventory-sensitive bid prices and customer choice," European Journal of Operational Research, Elsevier, vol. 216(2), pages 459-468.
    10. Thomas W. M. Vossen & Dan Zhang, 2015. "Reductions of Approximate Linear Programs for Network Revenue Management," Operations Research, INFORMS, vol. 63(6), pages 1352-1371, December.
    11. Georgia Perakis & Guillaume Roels, 2010. "Robust Controls for Network Revenue Management," Manufacturing & Service Operations Management, INFORMS, vol. 12(1), pages 56-76, November.
    12. Wuyang Yuan & Lei Nie & Xin Wu & Huiling Fu, 2018. "A dynamic bid price approach for the seat inventory control problem in railway networks with consideration of passenger transfer," PLOS ONE, Public Library of Science, vol. 13(8), pages 1-23, August.
    13. Stefanus Jasin, 2014. "Reoptimization and Self-Adjusting Price Control for Network Revenue Management," Operations Research, INFORMS, vol. 62(5), pages 1168-1178, October.
    14. Chaoxu Tong & Huseyin Topaloglu, 2014. "On the Approximate Linear Programming Approach for Network Revenue Management Problems," INFORMS Journal on Computing, INFORMS, vol. 26(1), pages 121-134, February.
    15. Dragos Florin Ciocan & Vivek Farias, 2012. "Model Predictive Control for Dynamic Resource Allocation," Mathematics of Operations Research, INFORMS, vol. 37(3), pages 501-525, August.
    16. Dan Zhang, 2011. "An Improved Dynamic Programming Decomposition Approach for Network Revenue Management," Manufacturing & Service Operations Management, INFORMS, vol. 13(1), pages 35-52, April.
    17. Sumit Kunnumkal & Kalyan Talluri, 2011. "Equivalence of piecewise-linear approximation and Lagrangian relaxation for network revenue management," Economics Working Papers 1305, Department of Economics and Business, Universitat Pompeu Fabra, revised Nov 2012.
    18. Juan M. Chaneton & Gustavo Vulcano, 2011. "Computing Bid Prices for Revenue Management Under Customer Choice Behavior," Manufacturing & Service Operations Management, INFORMS, vol. 13(4), pages 452-470, October.
    19. Stefanus Jasin & Sunil Kumar, 2013. "Analysis of Deterministic LP-Based Booking Limit and Bid Price Controls for Revenue Management," Operations Research, INFORMS, vol. 61(6), pages 1312-1320, December.
    20. Laumer, Simon & Barz, Christiane, 2023. "Reductions of non-separable approximate linear programs for network revenue management," European Journal of Operational Research, Elsevier, vol. 309(1), pages 252-270.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:jaitra:v:38:y:2014:i:c:p:36-42. See general information about how to correct material in RePEc.

    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 CitEc recognized a bibliographic reference but did not link an item in RePEc 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 RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: http://www.journals.elsevier.com/journal-of-air-transport-management/ .

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

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.