IDEAS home Printed from https://ideas.repec.org/a/inm/ormsom/v24y2022i2p1220-1240.html
   My bibliography  Save this article

Omnichannel Assortment Optimization Under the Multinomial Logit Model with a Features Tree

Author

Listed:
  • Venus Lo

    (Department of Management Sciences, City University of Hong Kong, Kowloon, Hong Kong S.A.R.;)

  • Huseyin Topaloglu

    (School of Operations Research and Information Engineering, Cornell Tech, New York, New York 10011)

Abstract

Problem definition : We consider the assortment optimization problem of a retailer that operates a physical store and an online store. The products that can be offered are described by their features. Customers purchase among the products that are offered in their preferred store. However, customers who purchase from the online store can first test out products offered in the physical store. These customers revise their preferences for online products based on the features that are shared with the in-store products. The full assortment is offered online, and the goal is to select an assortment for the physical store to maximize the retailer’s total expected revenue. Academic/practical relevance : The physical store’s assortment affects preferences for online products. Unlike traditional assortment optimization, the physical store’s assortment influences revenue from both stores. Methodology : We introduce a features tree to organize products by features. The nonleaf vertices on the tree correspond to features, and the leaf vertices correspond to products. The ancestors of a leaf correspond to features of the product. Customers choose among the products within their store’s assortment according to the multinomial logit model. We consider two settings; either all customers purchase online after viewing products in the physical store, or we have a mix of customers purchasing from each store. Results : When all customers purchase online, we give an efficient algorithm to find the optimal assortment to display in the physical store. With a mix of customers, the problem becomes NP-hard, and we give a fully polynomial-time approximation scheme. We numerically demonstrate that we can closely approximate the case where products have arbitrary combinations of features without a tree structure and that our fully polynomial-time approximation scheme performs remarkably well. Managerial implications : We characterize conditions under which it is optimal to display expensive products with underrated features and expose inexpensive products with overrated features.

Suggested Citation

  • Venus Lo & Huseyin Topaloglu, 2022. "Omnichannel Assortment Optimization Under the Multinomial Logit Model with a Features Tree," Manufacturing & Service Operations Management, INFORMS, vol. 24(2), pages 1220-1240, March.
  • Handle: RePEc:inm:ormsom:v:24:y:2022:i:2:p:1220-1240
    DOI: 10.1287/msom.2021.1001
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/msom.2021.1001
    Download Restriction: no

    File URL: https://libkey.io/10.1287/msom.2021.1001?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
    ---><---

    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:ormsom:v:24:y:2022:i:2:p:1220-1240. 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.

    We have no bibliographic references for this item. You can help adding them by using 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.