IDEAS home Printed from https://ideas.repec.org/a/eee/ejores/v271y2018i2p375-387.html
   My bibliography  Save this article

A review of choice-based revenue management: Theory and methods

Author

Listed:
  • Strauss, Arne K.
  • Klein, Robert
  • Steinhardt, Claudius

Abstract

Over the last fifteen years, the theory and practice of revenue management has experienced significant developments due to the need to incorporate customer choice behavior. In this paper, we portray these developments by reviewing the key literature on choice-based revenue management, specifically focusing on methodological publications of availability control over the years 2004–2017. For this purpose, we first state the choice-based network revenue management problem by formulating the underlying dynamic program, and structure the review according to its components and the resulting inherent challenges. In particular, we first focus on the demand modeling by giving an overview of popular choice models, discussing their properties, and describing estimation procedures relevant to choice-based revenue management. Second, we elaborate on assortment optimization, which is a fundamental component of the problem. Third, we describe recent developments on tackling the entire control problem. We also discuss the relation to dynamic pricing. Finally, we give directions for future research.

Suggested Citation

  • 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.
  • Handle: RePEc:eee:ejores:v:271:y:2018:i:2:p:375-387
    DOI: 10.1016/j.ejor.2018.01.011
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377221718300110
    Download Restriction: Full text for ScienceDirect subscribers only

    File URL: https://libkey.io/10.1016/j.ejor.2018.01.011?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. Gustavo Vulcano & Garrett van Ryzin & Richard Ratliff, 2012. "Estimating Primary Demand for Substitutable Products from Sales Transaction Data," Operations Research, INFORMS, vol. 60(2), pages 313-334, April.
    2. Sumit Kunnumkal & Kalyan Talluri, 2016. "Technical Note—A Note on Relaxations of the Choice Network Revenue Management Dynamic Program," Operations Research, INFORMS, vol. 64(1), pages 158-166, February.
    3. Arne K. Strauss & Kalyan Talluri, 2017. "Tractable Consideration Set Structures for Assortment Optimization and Network Revenue Management," Production and Operations Management, Production and Operations Management Society, vol. 26(7), pages 1359-1368, July.
    4. A. Gürhan Kök & Marshall L. Fisher & Ramnath Vaidyanathan, 2008. "Assortment Planning: Review of Literature and Industry Practice," International Series in Operations Research & Management Science, in: Narendra Agrawal & Stephen A. Smith (ed.), Retail Supply Chain Management, chapter 0, pages 99-153, Springer.
    5. 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.
    6. 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.
    7. Srikanth Jagabathula & Paat Rusmevichientong, 2017. "Nonparametric Joint Assortment and Price Choice Model," Management Science, INFORMS, vol. 63(9), pages 3128-3145, September.
    8. Guillermo Gallego & Richard Ratliff & Sergey Shebalov, 2015. "A General Attraction Model and Sales-Based Linear Program for Network Revenue Management Under Customer Choice," Operations Research, INFORMS, vol. 63(1), pages 212-232, February.
    9. Sumit Kunnumkal & Kalyan Talluri, 2016. "On a Piecewise-Linear Approximation for Network Revenue Management," Mathematics of Operations Research, INFORMS, vol. 41(1), pages 72-91, February.
    10. Wu, Tai-Hsi, 1997. "A note on a global approach for general 0-1 fractional programming," European Journal of Operational Research, Elsevier, vol. 101(1), pages 220-223, August.
    11. Jacob Feldman & Huseyin Topaloglu, 2015. "Bounding Optimal Expected Revenues for Assortment Optimization under Mixtures of Multinomial Logits," Production and Operations Management, Production and Operations Management Society, vol. 24(10), pages 1598-1620, October.
    12. , & ,, 2013. "Choice by iterative search," Theoretical Economics, Econometric Society, vol. 8(3), September.
    13. 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.
    14. Paat Rusmevichientong & Huseyin Topaloglu, 2012. "Robust Assortment Optimization in Revenue Management Under the Multinomial Logit Choice Model," Operations Research, INFORMS, vol. 60(4), pages 865-882, August.
    15. Vivek F. Farias & Srikanth Jagabathula & Devavrat Shah, 2013. "A Nonparametric Approach to Modeling Choice with Limited Data," Management Science, INFORMS, vol. 59(2), pages 305-322, December.
    16. Ming Chen & Zhi-Long Chen, 2015. "Recent Developments in Dynamic Pricing Research: Multiple Products, Competition, and Limited Demand Information," Production and Operations Management, Production and Operations Management Society, vol. 24(5), pages 704-731, May.
    17. Li, Han-Lin, 1994. "A global approach for general 0-1 fractional programming," European Journal of Operational Research, Elsevier, vol. 73(3), pages 590-596, March.
    18. Kyle D. Chen & Warren H. Hausman, 2000. "Technical Note: Mathematical Properties of the Optimal Product Line Selection Problem Using Choice-Based Conjoint Analysis," Management Science, INFORMS, vol. 46(2), pages 327-332, February.
    19. Kalyan Talluri & Garrett van Ryzin, 2004. "Revenue Management Under a General Discrete Choice Model of Consumer Behavior," Management Science, INFORMS, vol. 50(1), pages 15-33, January.
    20. James M. Davis & Guillermo Gallego & Huseyin Topaloglu, 2014. "Assortment Optimization Under Variants of the Nested Logit Model," Operations Research, INFORMS, vol. 62(2), pages 250-273, April.
    21. 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.
    22. Garrett van Ryzin & Gustavo Vulcano, 2008. "Simulation-Based Optimization of Virtual Nesting Controls for Network Revenue Management," Operations Research, INFORMS, vol. 56(4), pages 865-880, August.
    23. Garrett van Ryzin & Gustavo Vulcano, 2015. "A Market Discovery Algorithm to Estimate a General Class of Nonparametric Choice Models," Management Science, INFORMS, vol. 61(2), pages 281-300, February.
    24. Jeffrey I. McGill & Garrett J. van Ryzin, 1999. "Revenue Management: Research Overview and Prospects," Transportation Science, INFORMS, vol. 33(2), pages 233-256, May.
    25. W. Zachary Rayfield & Paat Rusmevichientong & Huseyin Topaloglu, 2015. "Approximation Methods for Pricing Problems Under the Nested Logit Model with Price Bounds," INFORMS Journal on Computing, INFORMS, vol. 27(2), pages 335-357, May.
    26. Sumit Kunnumkal & Huseyin Topaloglu, 2008. "A refined deterministic linear program for the network revenue management problem with customer choice behavior," Naval Research Logistics (NRL), John Wiley & Sons, vol. 55(6), pages 563-580, September.
    27. Lingxiu Dong & Panos Kouvelis & Zhongjun Tian, 2009. "Dynamic Pricing and Inventory Control of Substitute Products," Manufacturing & Service Operations Management, INFORMS, vol. 11(2), pages 317-339, December.
    28. Gabriel Bitran & René Caldentey, 2003. "An Overview of Pricing Models for Revenue Management," Manufacturing & Service Operations Management, INFORMS, vol. 5(3), pages 203-229, August.
    29. Qian Liu & Garrett van Ryzin, 2008. "On the Choice-Based Linear Programming Model for Network Revenue Management," Manufacturing & Service Operations Management, INFORMS, vol. 10(2), pages 288-310, October.
    30. Vineet Goyal & Retsef Levi & Danny Segev, 2016. "Near-Optimal Algorithms for the Assortment Planning Problem Under Dynamic Substitution and Stochastic Demand," Operations Research, INFORMS, vol. 64(1), pages 219-235, February.
    31. Dan Zhang & Daniel Adelman, 2009. "An Approximate Dynamic Programming Approach to Network Revenue Management with Customer Choice," Transportation Science, INFORMS, vol. 43(3), pages 381-394, August.
    32. Jacob B. Feldman & Huseyin Topaloglu, 2015. "Capacity Constraints Across Nests in Assortment Optimization Under the Nested Logit Model," Operations Research, INFORMS, vol. 63(4), pages 812-822, August.
    33. Aydın Alptekinoğlu & John H. Semple, 2016. "The Exponomial Choice Model: A New Alternative for Assortment and Price Optimization," Operations Research, INFORMS, vol. 64(1), pages 79-93, February.
    34. Yalç{i}n Akçay & Harihara Prasad Natarajan & Susan H. Xu, 2010. "Joint Dynamic Pricing of Multiple Perishable Products Under Consumer Choice," Management Science, INFORMS, vol. 56(8), pages 1345-1361, August.
    35. Hensher,David A. & Rose,John M. & Greene,William H., 2015. "Applied Choice Analysis," Cambridge Books, Cambridge University Press, number 9781107465923.
    36. Siddharth Mahajan & Garrett van Ryzin, 2001. "Stocking Retail Assortments Under Dynamic Consumer Substitution," Operations Research, INFORMS, vol. 49(3), pages 334-351, June.
    37. Daniel McFadden & Kenneth Train, 2000. "Mixed MNL models for discrete response," Journal of Applied Econometrics, John Wiley & Sons, Ltd., vol. 15(5), pages 447-470.
    38. Guang Li & Paat Rusmevichientong & Huseyin Topaloglu, 2015. "The d -Level Nested Logit Model: Assortment and Price Optimization Problems," Operations Research, INFORMS, vol. 63(2), pages 325-342, April.
    39. Train,Kenneth E., 2009. "Discrete Choice Methods with Simulation," Cambridge Books, Cambridge University Press, number 9780521747387.
    40. Sumit Kunnumkal, 2014. "Randomization Approaches for Network Revenue Management with Customer Choice Behavior," Production and Operations Management, Production and Operations Management Society, vol. 23(9), pages 1617-1633, September.
    41. Kalyan Talluri, 2014. "New Formulations for Choice Network Revenue Management," INFORMS Journal on Computing, INFORMS, vol. 26(2), pages 401-413, May.
    42. Daniel Adelman, 2007. "Dynamic Bid Prices in Revenue Management," Operations Research, INFORMS, vol. 55(4), pages 647-661, August.
    43. Garrett van Ryzin & Gustavo Vulcano, 2008. "Computing Virtual Nesting Controls for Network Revenue Management Under Customer Choice Behavior," Manufacturing & Service Operations Management, INFORMS, vol. 10(3), pages 448-467, October.
    44. Hauser, John R., 2014. "Consideration-set heuristics," Journal of Business Research, Elsevier, vol. 67(8), pages 1688-1699.
    45. Hongmin Li & Woonghee Tim Huh, 2011. "Pricing Multiple Products with the Multinomial Logit and Nested Logit Models: Concavity and Implications," Manufacturing & Service Operations Management, INFORMS, vol. 13(4), pages 549-563, October.
    46. Itai Sher & Jeremy T. Fox & Kyoo il Kim & Patrick Bajari, 2011. "Partial Identification of Heterogeneity in Preference Orderings Over Discrete Choices," NBER Working Papers 17346, National Bureau of Economic Research, Inc.
    47. Jacob B. Feldman & Huseyin Topaloglu, 2017. "Revenue Management Under the Markov Chain Choice Model," Operations Research, INFORMS, vol. 65(5), pages 1322-1342, October.
    48. Juan José Miranda Bront & Isabel Méndez-Díaz & Gustavo Vulcano, 2009. "A Column Generation Algorithm for Choice-Based Network Revenue Management," Operations Research, INFORMS, vol. 57(3), pages 769-784, June.
    49. 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.
    50. Garrett van Ryzin & Gustavo Vulcano, 2017. "Technical Note—An Expectation-Maximization Method to Estimate a Rank-Based Choice Model of Demand," Operations Research, INFORMS, vol. 65(2), pages 396-407, April.
    51. Zhang, Dan & Cooper, William L., 2009. "Pricing substitutable flights in airline revenue management," European Journal of Operational Research, Elsevier, vol. 197(3), pages 848-861, September.
    52. Guillermo Gallego & Huseyin Topaloglu, 2014. "Constrained Assortment Optimization for the Nested Logit Model," Management Science, INFORMS, vol. 60(10), pages 2583-2601, October.
    53. Jose Blanchet & Guillermo Gallego & Vineet Goyal, 2016. "A Markov Chain Approximation to Choice Modeling," Operations Research, INFORMS, vol. 64(4), pages 886-905, August.
    54. 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.
    55. Gustavo Vulcano & Garrett van Ryzin & Wassim Chaar, 2010. "OM Practice--Choice-Based Revenue Management: An Empirical Study of Estimation and Optimization," Manufacturing & Service Operations Management, INFORMS, vol. 12(3), pages 371-392, February.
    56. Paat Rusmevichientong & David Shmoys & Chaoxu Tong & Huseyin Topaloglu, 2014. "Assortment Optimization under the Multinomial Logit Model with Random Choice Parameters," Production and Operations Management, Production and Operations Management Society, vol. 23(11), pages 2023-2039, November.
    57. Chen, Lijian & Homem-de-Mello, Tito, 2010. "Mathematical programming models for revenue management under customer choice," European Journal of Operational Research, Elsevier, vol. 203(2), pages 294-305, June.
    58. Dan Zhang & William L. Cooper, 2005. "Revenue Management for Parallel Flights with Customer-Choice Behavior," Operations Research, INFORMS, vol. 53(3), pages 415-431, June.
    59. Jeffrey P. Newman & Mark E. Ferguson & Laurie A. Garrow & Timothy L. Jacobs, 2014. "Estimation of Choice-Based Models Using Sales Data from a Single Firm," Manufacturing & Service Operations Management, INFORMS, vol. 16(2), pages 184-197, May.
    60. William L. Cooper & Tito Homem-de-Mello & Anton J. Kleywegt, 2006. "Models of the Spiral-Down Effect in Revenue Management," Operations Research, INFORMS, vol. 54(5), pages 968-987, October.
    61. Guillermo Gallego & Ruxian Wang, 2014. "Multiproduct Price Optimization and Competition Under the Nested Logit Model with Product-Differentiated Price Sensitivities," Operations Research, INFORMS, vol. 62(2), pages 450-461, April.
    62. Paat Rusmevichientong & Zuo-Jun Max Shen & David B. Shmoys, 2010. "Dynamic Assortment Optimization with a Multinomial Logit Choice Model and Capacity Constraint," Operations Research, INFORMS, vol. 58(6), pages 1666-1680, December.
    63. Hübner, Alexander H. & Kuhn, Heinrich, 2012. "Retail category management: State-of-the-art review of quantitative research and software applications in assortment and shelf space management," Omega, Elsevier, vol. 40(2), pages 199-209, April.
    64. Gérard P. Cachon & Christian Terwiesch & Yi Xu, 2005. "Retail Assortment Planning in the Presence of Consumer Search," Manufacturing & Service Operations Management, INFORMS, vol. 7(4), pages 330-346, August.
    65. Michael D Wittman & Peter P Belobaba, 2017. "Dynamic availability of fare products with knowledge of customer characteristics," Journal of Revenue and Pricing Management, Palgrave Macmillan, vol. 16(2), pages 201-217, April.
    66. Ward Hanson & Kipp Martin, 1996. "Optimizing Multinomial Logit Profit Functions," Management Science, INFORMS, vol. 42(7), pages 992-1003, July.
    67. 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.
    68. Adam Bockelie & Peter Belobaba, 2017. "Incorporating ancillary services in airline passenger choice models," Journal of Revenue and Pricing Management, Palgrave Macmillan, vol. 16(6), pages 553-568, December.
    Full references (including those not matched with items on IDEAS)

    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. 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.
    2. Guillermo Gallego & Huseyin Topaloglu, 2014. "Constrained Assortment Optimization for the Nested Logit Model," Management Science, INFORMS, vol. 60(10), pages 2583-2601, October.
    3. Jacob B. Feldman & Huseyin Topaloglu, 2017. "Revenue Management Under the Markov Chain Choice Model," Operations Research, INFORMS, vol. 65(5), pages 1322-1342, October.
    4. Flores, Alvaro & Berbeglia, Gerardo & Van Hentenryck, Pascal, 2019. "Assortment optimization under the Sequential Multinomial Logit Model," European Journal of Operational Research, Elsevier, vol. 273(3), pages 1052-1064.
    5. C. I. Chiang, 2023. "Availability control under online reviews in hospitality," Journal of Revenue and Pricing Management, Palgrave Macmillan, vol. 22(5), pages 385-398, October.
    6. Kameng Nip & Zhenbo Wang & Zizhuo Wang, 2021. "Assortment Optimization under a Single Transition Choice Model," Production and Operations Management, Production and Operations Management Society, vol. 30(7), pages 2122-2142, July.
    7. Mika Sumida & Guillermo Gallego & Paat Rusmevichientong & Huseyin Topaloglu & James Davis, 2021. "Revenue-Utility Tradeoff in Assortment Optimization Under the Multinomial Logit Model with Totally Unimodular Constraints," Management Science, INFORMS, vol. 67(5), pages 2845-2869, May.
    8. Paat Rusmevichientong & Mika Sumida & Huseyin Topaloglu, 2020. "Dynamic Assortment Optimization for Reusable Products with Random Usage Durations," Management Science, INFORMS, vol. 66(7), pages 2820-2844, July.
    9. Çömez-Dolgan, Nagihan & Moussawi-Haidar, Lama & Jaber, Mohamad Y. & Cephe, Ecem, 2022. "Capacitated assortment planning of a multi-location system under transshipments," International Journal of Production Economics, Elsevier, vol. 251(C).
    10. Guang Li & Paat Rusmevichientong & Huseyin Topaloglu, 2015. "The d -Level Nested Logit Model: Assortment and Price Optimization Problems," Operations Research, INFORMS, vol. 63(2), pages 325-342, April.
    11. Rui Chen & Hai Jiang, 2020. "Capacitated assortment and price optimization under the nested logit model," Journal of Global Optimization, Springer, vol. 77(4), pages 895-918, August.
    12. Meng Qi & Ho‐Yin Mak & Zuo‐Jun Max Shen, 2020. "Data‐driven research in retail operations—A review," Naval Research Logistics (NRL), John Wiley & Sons, vol. 67(8), pages 595-616, December.
    13. James M. Davis & Guillermo Gallego & Huseyin Topaloglu, 2014. "Assortment Optimization Under Variants of the Nested Logit Model," Operations Research, INFORMS, vol. 62(2), pages 250-273, April.
    14. Hongmin Li & Scott Webster & Nicholas Mason & Karl Kempf, 2019. "Product-Line Pricing Under Discrete Mixed Multinomial Logit Demand," Service Science, INFORMS, vol. 21(1), pages 14-28, January.
    15. W. Zachary Rayfield & Paat Rusmevichientong & Huseyin Topaloglu, 2015. "Approximation Methods for Pricing Problems Under the Nested Logit Model with Price Bounds," INFORMS Journal on Computing, INFORMS, vol. 27(2), pages 335-357, May.
    16. 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.
    17. Xi Chen & Chao Shi & Yining Wang & Yuan Zhou, 2021. "Dynamic Assortment Planning Under Nested Logit Models," Production and Operations Management, Production and Operations Management Society, vol. 30(1), pages 85-102, January.
    18. Ruxian Wang & Zizhuo Wang, 2017. "Consumer Choice Models with Endogenous Network Effects," Management Science, INFORMS, vol. 63(11), pages 3944-3960, November.
    19. Antoine Désir & Vineet Goyal & Danny Segev & Chun Ye, 2020. "Constrained Assortment Optimization Under the Markov Chain–based Choice Model," Management Science, INFORMS, vol. 66(2), pages 698-721, February.
    20. Ali Aouad & Danny Segev, 2021. "Display Optimization for Vertically Differentiated Locations Under Multinomial Logit Preferences," Management Science, INFORMS, vol. 67(6), pages 3519-3550, June.

    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:ejores:v:271:y:2018:i:2:p:375-387. 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.elsevier.com/locate/eor .

    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.