IDEAS home Printed from https://ideas.repec.org/a/taf/tjorxx/v74y2023i12p2545-2557.html
   My bibliography  Save this article

Bi-objective capacitated assortment planning under the MNL model: Trade-offs between revenue and market share

Author

Listed:
  • Yuyang Tan
  • Chunxiang Guo

Abstract

Assortment planning is a challenge for retailers because most current solutions only consider revenue maximization and ignore the trade-offs between revenue and market share. To address this challenge, we develop a bi-objective capacitated assortment planning (B-CAP) problem based on the multinomial logit (MNL) choice model and reveal managerial insights into the bi-objective function of the B-CAP problem. To solve this problem, we first examine the performance guarantees of the revenue-ordered assortment. Then, we provide parametric linear programming to generate candidate assortments and analyze the unimodality of the bi-objective function to simplify the computational complexity. Hence, the two-stage approach consisting of the geometric algorithm and Fibonacci search is designed to obtain the optimal solution. Finally, we present numerical experiments on both simulated and real data. The results indicate that the two-stage approach performs well in solving the B-CAP problem. Besides, an interesting finding is that market share may be significantly increased without a huge loss in total revenue when the trade-off parameter is small.

Suggested Citation

  • Yuyang Tan & Chunxiang Guo, 2023. "Bi-objective capacitated assortment planning under the MNL model: Trade-offs between revenue and market share," Journal of the Operational Research Society, Taylor & Francis Journals, vol. 74(12), pages 2545-2557, December.
  • Handle: RePEc:taf:tjorxx:v:74:y:2023:i:12:p:2545-2557
    DOI: 10.1080/01605682.2022.2157341
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1080/01605682.2022.2157341
    Download Restriction: Access to full text is restricted to subscribers.

    File URL: https://libkey.io/10.1080/01605682.2022.2157341?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.

    More about this item

    Statistics

    Access and download statistics

    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:taf:tjorxx:v:74:y:2023:i:12:p:2545-2557. 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 Longhurst (email available below). General contact details of provider: http://www.tandfonline.com/tjor .

    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.