IDEAS home Printed from https://ideas.repec.org/a/inm/orijoc/v36y2024i2p479-494.html
   My bibliography  Save this article

An Exact Method for (Constrained) Assortment Optimization Problems with Product Costs

Author

Listed:
  • Markus Leitner

    (Department of Operations Analytics, Vrije Universiteit Amsterdam, 1081 HV Amsterdam, Netherlands)

  • Andrea Lodi

    (Jacobs Technion-Cornell Institute, Cornell Tech and Technion - IIT, New York, New York 10044)

  • Roberto Roberti

    (Department of Information Engineering, University of Padua, 35131 Padua, Italy)

  • Claudio Sole

    (Canada Excellence Research Chair in Data-Science for Real-time Decision-Making, Polytechnique Montréal, Montreal, Quebec H3T 1J4, Canada)

Abstract

We study the problem of optimizing assortment decisions in the presence of product-specific costs when customers choose according to a multinomial logit model. This problem is NP-hard, and approximate solutions methods have been proposed in the literature to obtain both lower and upper bounds in a tractable manner. We propose the first exact solution method for this problem and show that provably optimal assortments of instances with up to 1,000 products can be found, on average, in about 2/10 of a second. In particular, we propose a bounding procedure to enhance an approximation method originally proposed by Feldman and Topaloglu and provide tight lower and upper bounds at a fraction of a second. We show how these bounds can be used to effectively identify an optimal assortment. We also describe how to adapt our approach to handle cardinality or space/resource capacity constraints on the assortment as well as assortment optimization under a mixed-multinomial logit model. In both cases, our solution method provides significant computational boosts compared with exact methods from the literature.

Suggested Citation

  • Markus Leitner & Andrea Lodi & Roberto Roberti & Claudio Sole, 2024. "An Exact Method for (Constrained) Assortment Optimization Problems with Product Costs," INFORMS Journal on Computing, INFORMS, vol. 36(2), pages 479-494, March.
  • Handle: RePEc:inm:orijoc:v:36:y:2024:i:2:p:479-494
    DOI: 10.1287/ijoc.2022.0262
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/ijoc.2022.0262
    Download Restriction: no

    File URL: https://libkey.io/10.1287/ijoc.2022.0262?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. Jacob Feldman & Alice Paul & Huseyin Topaloglu, 2019. "Technical Note—Assortment Optimization with Small Consideration Sets," Operations Research, INFORMS, vol. 67(5), pages 1283-1299, September.
    2. 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.
    3. 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.
    4. Sumit Kunnumkal & Victor Martínez-de-Albéniz, 2019. "Tractable Approximations for Assortment Planning with Product Costs," Operations Research, INFORMS, vol. 67(2), pages 436-452, March.
    5. Dorothee Honhon & Sreelata Jonnalagedda & Xiajun Amy Pan, 2012. "Optimal Algorithms for Assortment Selection Under Ranking-Based Consumer Choice Models," Manufacturing & Service Operations Management, INFORMS, vol. 14(2), pages 279-289, April.
    6. 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.
    7. Guillermo Gallego & Huseyin Topaloglu, 2014. "Constrained Assortment Optimization for the Nested Logit Model," Management Science, INFORMS, vol. 60(10), pages 2583-2601, October.
    8. Silvano Martello & Paolo Toth, 2003. "An Exact Algorithm for the Two-Constraint 0--1 Knapsack Problem," Operations Research, INFORMS, vol. 51(5), pages 826-835, October.
    9. 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.
    10. 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.
    11. 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.
    12. Silvano Martello & Paolo Toth, 1997. "Upper Bounds and Algorithms for Hard 0-1 Knapsack Problems," Operations Research, INFORMS, vol. 45(5), pages 768-778, October.
    13. Nan Liu & Yuhang Ma & Huseyin Topaloglu, 2020. "Assortment Optimization Under the Multinomial Logit Model with Sequential Offerings," INFORMS Journal on Computing, INFORMS, vol. 32(3), pages 835-853, July.
    14. Heng Zhang & Paat Rusmevichientong & Huseyin Topaloglu, 2020. "Assortment Optimization Under the Paired Combinatorial Logit Model," Operations Research, INFORMS, vol. 68(3), pages 741-761, May.
    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. 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.
    2. Mehrani, Saharnaz & Sefair, Jorge A., 2022. "Robust assortment optimization under sequential product unavailability," European Journal of Operational Research, Elsevier, vol. 303(3), pages 1027-1043.
    3. Sumit Kunnumkal & Victor Martínez-de-Albéniz, 2019. "Tractable Approximations for Assortment Planning with Product Costs," Operations Research, INFORMS, vol. 67(2), pages 436-452, March.
    4. Jacob B. Feldman & Huseyin Topaloglu, 2017. "Revenue Management Under the Markov Chain Choice Model," Operations Research, INFORMS, vol. 65(5), pages 1322-1342, October.
    5. Çömez-Dolgan, Nagihan & Dağ, Hilal & Fescioglu-Unver, Nilgun & Şen, Alper, 2023. "Multi-plant manufacturing assortment planning in the presence of transshipments," European Journal of Operational Research, Elsevier, vol. 310(3), pages 1033-1050.
    6. 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.
    7. 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.
    8. 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.
    9. Wang, Mengmeng & Zhang, Xun & Li, Xiaolong, 2023. "Multiple-purchase choice model: estimation and optimization," International Journal of Production Economics, Elsevier, vol. 265(C).
    10. Jacob Feldman & Alice Paul & Huseyin Topaloglu, 2019. "Technical Note—Assortment Optimization with Small Consideration Sets," Operations Research, INFORMS, vol. 67(5), pages 1283-1299, September.
    11. Ali Aouad & Vivek Farias & Retsef Levi, 2021. "Assortment Optimization Under Consider-Then-Choose Choice Models," Management Science, INFORMS, vol. 67(6), pages 3368-3386, June.
    12. Ali Aouad & Jacob Feldman & Danny Segev, 2023. "The Exponomial Choice Model for Assortment Optimization: An Alternative to the MNL Model?," Management Science, INFORMS, vol. 69(5), pages 2814-2832, May.
    13. 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.
    14. 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.
    15. 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.
    16. Çö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).
    17. Guillermo Gallego & Huseyin Topaloglu, 2014. "Constrained Assortment Optimization for the Nested Logit Model," Management Science, INFORMS, vol. 60(10), pages 2583-2601, October.
    18. 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.
    19. Alice Paul & Jacob Feldman & James Mario Davis, 2018. "Assortment Optimization and Pricing Under a Nonparametric Tree Choice Model," Manufacturing & Service Operations Management, INFORMS, vol. 20(3), pages 550-565, July.
    20. 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.

    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:orijoc:v:36:y:2024:i:2:p:479-494. 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.