IDEAS home Printed from https://ideas.repec.org/a/inm/oropre/v57y2009i3p769-784.html
   My bibliography  Save this article

A Column Generation Algorithm for Choice-Based Network Revenue Management

Author

Listed:
  • Juan José Miranda Bront

    (Departamento de Computación, Facultad de Ciencias Exactas y Naturales, Universidad de Buenos Aires, Buenos Aires, Argentina)

  • Isabel Méndez-Díaz

    (Departamento de Computación, Facultad de Ciencias Exactas y Naturales, Universidad de Buenos Aires, Buenos Aires, Argentina)

  • Gustavo Vulcano

    (Department of Information, Operations and Management Sciences, Stern School of Business, New York University, New York, New York 10012)

Abstract

During the past few years, there has been a trend to enrich traditional revenue management models built upon the independent demand paradigm by accounting for customer choice behavior. This extension involves both modeling and computational challenges. One way to describe choice behavior is to assume that each customer belongs to a segment , which is characterized by a consideration set , i.e., a subset of the products provided by the firm that a customer views as options. Customers choose a particular product according to a multinomial-logit criterion, a model widely used in the marketing literature. In this paper, we consider the choice-based, deterministic, linear programming model (CDLP) of Gallego et al. (2004) [Gallego, G., G. Iyengar, R. Phillips, A. Dubey. 2004. Managing flexible products on a network. Technical Report CORC TR-2004-01, Department of Industrial Engineering and Operations Research, Columbia University, New York], and the follow-up dynamic programming decomposition heuristic of van Ryzin and Liu (2008) [van Ryzin, G. J., Q. Liu. 2008. On the choice-based linear programming model for network revenue management. Manufacturing Service Oper. Management 10 (2) 288--310]. We focus on the more general version of these models, where customers belong to overlapping segments. To solve the CDLP for real-size networks, we need to develop a column generation algorithm. We prove that the associated column generation subproblem is indeed NP-hard and propose a simple, greedy heuristic to overcome the complexity of an exact algorithm. Our computational results show that the heuristic is quite effective and that the overall approach leads to high-quality, practical solutions.

Suggested Citation

  • 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.
    • Handle: RePEc:inm:oropre:v:57:y:2009:i:3:p:769-784
    DOI: 10.1287/opre.1080.0567
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/opre.1080.0567
    Download Restriction: no
    File URL: https://libkey.io/10.1287/opre.1080.0567?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. 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.
    2. Gregory Dobson & Shlomo Kalish, 1988. "Positioning and Pricing a Product Line," Marketing Science, INFORMS, vol. 7(2), pages 107-125.
    3. 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.
    4. 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.
    5. 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.
    6. 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.
    7. 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.
    8. Paul E. Green & Abba M. Krieger, 1985. "Models and Heuristics for Product Line Selection," Marketing Science, INFORMS, vol. 4(1), pages 1-19.
    9. Rajeev Kohli & Ramesh Krishnamurti, 1987. "A Heuristic Approach to Product Design," Management Science, INFORMS, vol. 33(12), pages 1523-1533, December.
    10. 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.
    11. Ward Hanson & Kipp Martin, 1996. "Optimizing Multinomial Logit Profit Functions," Management Science, INFORMS, vol. 42(7), pages 992-1003, July.
    12. 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.
    13. Richard D. McBride & Fred S. Zufryden, 1988. "An Integer Programming Approach to the Optimal Product Line Selection Problem," Marketing Science, INFORMS, vol. 7(2), pages 126-140.
    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. 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. Dimitris Bertsimas & Velibor V. Mišić, 2019. "Exact First-Choice Product Line Optimization," Operations Research, INFORMS, vol. 67(3), pages 651-670, May.
    3. Hongmin Li & Scott Webster & Gwangjae Yu, 2020. "Product Design Under Multinomial Logit Choices: Optimization of Quality and Prices in an Evolving Product Line," Manufacturing & Service Operations Management, INFORMS, vol. 22(5), pages 1011-1025, September.
    4. Winfried Steiner & Harald Hruschka, 2002. "A Probabilistic One-Step Approach to the Optimal Product Line Design Problem Using Conjoint and Cost Data," Review of Marketing Science Working Papers 1-4-1003, Berkeley Electronic Press.
    5. Kraus, Ursula G. & Yano, Candace Arai, 2003. "Product line selection and pricing under a share-of-surplus choice model," European Journal of Operational Research, Elsevier, vol. 150(3), pages 653-671, November.
    6. Bechler, Georg & Steinhardt, Claudius & Mackert, Jochen & Klein, Robert, 2021. "Product line optimization in the presence of preferences for compromise alternatives," European Journal of Operational Research, Elsevier, vol. 288(3), pages 902-917.
    7. Schön, Cornelia, 2010. "On the product line selection problem under attraction choice models of consumer behavior," European Journal of Operational Research, Elsevier, vol. 206(1), pages 260-264, October.
    8. Andrade, Xavier & Guimarães, Luís & Figueira, Gonçalo, 2021. "Product line selection of fast-moving consumer goods," Omega, Elsevier, vol. 102(C).
    9. Guillermo Gallego & Huseyin Topaloglu, 2014. "Constrained Assortment Optimization for the Nested Logit Model," Management Science, INFORMS, vol. 60(10), pages 2583-2601, October.
    10. 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.
    11. Wilhelm, Wilbert E. & Xu, Kaihong, 2002. "Prescribing product upgrades, prices and production levels over time in a stochastic environment," European Journal of Operational Research, Elsevier, vol. 138(3), pages 601-621, May.
    12. Daria Dzyabura & Srikanth Jagabathula, 2018. "Offline Assortment Optimization in the Presence of an Online Channel," Management Science, INFORMS, vol. 64(6), pages 2767-2786, June.
    13. 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.
    14. G. E. Fruchter & A. Fligler & R. S. Winer, 2006. "Optimal Product Line Design: Genetic Algorithm Approach to Mitigate Cannibalization," Journal of Optimization Theory and Applications, Springer, vol. 131(2), pages 227-244, November.
    15. Day, Jamison M. & Venkataramanan, M.A., 2006. "Profitability in product line pricing and composition with manufacturing commonalities," European Journal of Operational Research, Elsevier, vol. 175(3), pages 1782-1797, December.
    16. Winfried J. Steiner & Harald Hruschka, 2002. "Produktliniengestaltung mit Genetischen Algorithmen," Schmalenbach Journal of Business Research, Springer, vol. 54(7), pages 575-601, November.
    17. Dimitris Bertsimas & Velibor V. Mišić, 2017. "Robust Product Line Design," Operations Research, INFORMS, vol. 65(1), pages 19-37, February.
    18. 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.
    19. Michalek, Jeremy J. & Ebbes, Peter & Adigüzel, Feray & Feinberg, Fred M. & Papalambros, Panos Y., 2011. "Enhancing marketing with engineering: Optimal product line design for heterogeneous markets," International Journal of Research in Marketing, Elsevier, vol. 28(1), pages 1-12.
    20. 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.

    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:oropre:v:57:y:2009:i:3:p:769-784. 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.