IDEAS home Printed from https://ideas.repec.org/a/inm/ortrsc/v47y2013i2p181-197.html
   My bibliography  Save this article

Expected Future Value Decomposition Based Bid Price Generation for Large-Scale Network Revenue Management

Author

Listed:
  • L. F. Escudero

    (Departamento de Estadística e Investigación Operativa, Universidad Rey Juan Carlos, Madrid, Spain)

  • J. F. Monge

    (Centro de Investigación Operativa, Universidad Miguel Hernández, Elche (Alicante), Spain)

  • D. Romero Morales

    (Saïd Business School, University of Oxford, Oxford, United Kingdom)

  • J. Wang

    (Saïd Business School, University of Oxford, Oxford, United Kingdom)

Abstract

This paper studies a multistage stochastic programming (SP) model for large-scale network revenue management. We solve the model by means of the so-called expected future value (EFV) decomposition via scenario analysis, estimating the impact of the decisions made at a given stage on the objective function value related to the future stages. The EFV curves are used to define bid prices on bundles of resources directly, as opposed to the traditional additive approach. We compare our revenues to those obtained by additive bid prices, such as the bid prices derived from the deterministic equivalent model (DEM) of the compact representation of the SP model. Our computational experience shows that the revenues obtained by our approach are better for middle-range values of the load factor of demand, whereas the differences among all the approaches we have tested are insignificant for extreme values. Moreover, our approach requires significantly less computation time than does the optimization of DEM by plain use of optimization engines. Problem instances with 72 pairs of bundle-fare classes have been solved in less than one minute, with 800 pairs in less than five minutes, and with 4,000 pairs in less than one hour. The time taken by DEM was, in general, of one order of magnitude higher. Finally, for the three largest problem instances, and after two hours, the expected revenue returned by DEM was below that obtained by EFV by 13.47%, 17.14%, and 38.94%, respectively.

Suggested Citation

  • 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.
    • Handle: RePEc:inm:ortrsc:v:47:y:2013:i:2:p:181-197
    DOI: 10.1287/trsc.1120.0422
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/trsc.1120.0422
    Download Restriction: no
    File URL: https://libkey.io/10.1287/trsc.1120.0422?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
    ---><---

    References listed on IDEAS

    as
    1. 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.
    2. Daniel Adelman, 2007. "Dynamic Bid Prices in Revenue Management," Operations Research, INFORMS, vol. 55(4), pages 647-661, August.
    3. Dimitris Bertsimas & Ioana Popescu, 2003. "Revenue Management in a Dynamic Network Environment," Transportation Science, INFORMS, vol. 37(3), pages 257-277, August.
    4. Andris Möller & Werner Römisch & Klaus Weber, 2008. "Airline network revenue management by multistage stochastic programming," Computational Management Science, Springer, vol. 5(4), pages 355-377, October.
    5. Fred Glover & Randy Glover & Joe Lorenzo & Claude McMillan, 1982. "The Passenger-Mix Problem in the Scheduled Airlines," Interfaces, INFORMS, vol. 12(3), pages 73-80, June.
    6. 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.
    7. Wong, Jinn-Tsai & Koppelman, Frank S. & Daskin, Mark S., 1993. "Flexible assignment approach to itinerary seat allocation," Transportation Research Part B: Methodological, Elsevier, vol. 27(1), pages 33-48, February.
    8. 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.
    9. Kalyan Talluri & Garrett van Ryzin, 1999. "A Randomized Linear Programming Method for Computing Network Bid Prices," Transportation Science, INFORMS, vol. 33(2), pages 207-216, May.
    10. Kalyan Talluri & Garrett van Ryzin, 1998. "An Analysis of Bid-Price Controls for Network Revenue Management," Management Science, INFORMS, vol. 44(11-Part-1), pages 1577-1593, November.
    11. John R. Birge, 1985. "Decomposition and Partitioning Methods for Multistage Stochastic Linear Programs," Operations Research, INFORMS, vol. 33(5), pages 989-1007, October.
    12. Richard D. Wollmer, 1992. "An Airline Seat Management Model for a Single Leg Route When Lower Fare Classes Book First," Operations Research, INFORMS, vol. 40(1), pages 26-37, February.
    13. 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.
    14. L. Escudero & A. Garín & M. Merino & G. Pérez, 2007. "A two-stage stochastic integer programming approach as a mixture of Branch-and-Fix Coordination and Benders Decomposition schemes," Annals of Operations Research, Springer, vol. 152(1), pages 395-420, July.
    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. Unai Aldasoro & Laureano Escudero & María Merino & Juan Monge & Gloria Pérez, 2015. "On parallelization of a stochastic dynamic programming algorithm for solving large-scale mixed 0–1 problems under uncertainty," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 23(3), pages 703-742, October.
    2. 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.
    3. Castro, Jordi & Escudero, Laureano F. & Monge, Juan F., 2023. "On solving large-scale multistage stochastic optimization problems with a new specialized interior-point approach," European Journal of Operational Research, Elsevier, vol. 310(1), pages 268-285.
    4. Aldasoro, Unai & Escudero, Laureano F. & Merino, María & Pérez, Gloria, 2017. "A parallel Branch-and-Fix Coordination based matheuristic algorithm for solving large sized multistage stochastic mixed 0–1 problems," European Journal of Operational Research, Elsevier, vol. 258(2), pages 590-606.

    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. 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.
    2. Ş. İlker Birbil & J. B. G. Frenk & Joaquim A. S. Gromicho & Shuzhong Zhang, 2014. "A Network Airline Revenue Management Framework Based on Decomposition by Origins and Destinations," Transportation Science, INFORMS, vol. 48(3), pages 313-333, August.
    3. Georgia Perakis & Guillaume Roels, 2010. "Robust Controls for Network Revenue Management," Manufacturing & Service Operations Management, INFORMS, vol. 12(1), pages 56-76, November.
    4. 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.
    5. Jeffrey I. McGill & Garrett J. van Ryzin, 1999. "Revenue Management: Research Overview and Prospects," Transportation Science, INFORMS, vol. 33(2), pages 233-256, May.
    6. Chevalier, Philippe & Lamas, Alejandro & Lu, Liang & Mlinar, Tanja, 2015. "Revenue management for operations with urgent orders," European Journal of Operational Research, Elsevier, vol. 240(2), pages 476-487.
    7. E. Andrew Boyd & Ioana C. Bilegan, 2003. "Revenue Management and E-Commerce," Management Science, INFORMS, vol. 49(10), pages 1363-1386, October.
    8. 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.
    9. Nicolas Houy & François Le Grand, 2015. "The Monte Carlo first-come-first-served heuristic for network revenue management," Working Papers halshs-01155698, HAL.
    10. 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.
    11. 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.
    12. 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.
    13. Chiang, David Ming-Huang & Wu, Andy Wei-Di, 2011. "Discrete-order admission ATP model with joint effect of margin and order size in a MTO environment," International Journal of Production Economics, Elsevier, vol. 133(2), pages 761-775, October.
    14. An, Jaehyung & Mikhaylov, Alexey & Jung, Sang-Uk, 2021. "A Linear Programming approach for robust network revenue management in the airline industry," Journal of Air Transport Management, Elsevier, vol. 91(C).
    15. Topaloglu, Huseyin, 2009. "On the asymptotic optimality of the randomized linear program for network revenue management," European Journal of Operational Research, Elsevier, vol. 197(3), pages 884-896, September.
    16. Yuri Levin & Mikhail Nediak & Huseyin Topaloglu, 2012. "Cargo Capacity Management with Allotments and Spot Market Demand," Operations Research, INFORMS, vol. 60(2), pages 351-365, April.
    17. Dimitris Bertsimas & Sanne de Boer, 2005. "Simulation-Based Booking Limits for Airline Revenue Management," Operations Research, INFORMS, vol. 53(1), pages 90-106, February.
    18. Chan Seng Pun & Diego Klabjan & Fikri Karaesmen & Sergey Shebalov, 2016. "Itinerary-based nesting control with upsell," Journal of Revenue and Pricing Management, Palgrave Macmillan, vol. 15(2), pages 107-137, April.
    19. Wang, Xiubin & Wang, Fenghuan, 2007. "Dynamic network yield management," Transportation Research Part B: Methodological, Elsevier, vol. 41(4), pages 410-425, May.
    20. Dan Zhang & Larry Weatherford, 2017. "Dynamic Pricing for Network Revenue Management: A New Approach and Application in the Hotel Industry," INFORMS Journal on Computing, INFORMS, vol. 29(1), pages 18-35, February.

    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:inm:ortrsc:v:47:y:2013:i:2:p:181-197. 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: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .

    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.