Author
Listed:
- Zhengchao Wang
(Imperial College Business School, Imperial College London, London SW7 2AZ, United Kingdom)
- Heikki Peura
(Department of Information and Service Management, Aalto University School of Business, 00076 Aalto, Finland)
- Wolfram Wiesemann
(Imperial College Business School, Imperial College London, London SW7 2AZ, United Kingdom)
Abstract
When a firm selects an assortment of products to offer to customers, it uses a choice model to anticipate their probability of purchasing each product. In practice, the estimation of these models is subject to statistical errors, which may lead to significantly suboptimal assortment decisions. Recent work has addressed this issue using robust optimization, where the true parameter values are assumed unknown and the firm chooses an assortment that maximizes its worst-case expected revenues over an uncertainty set of likely parameter values, thus mitigating estimation errors. In this paper, we introduce the concept of randomization into the robust assortment optimization literature. We show that the standard approach of deterministically selecting a single assortment to offer is not always optimal in the robust assortment optimization problem. Instead, the firm can improve its worst-case expected revenues by selecting an assortment randomly according to a prudently designed probability distribution. We demonstrate this potential benefit of randomization both theoretically in an abstract problem formulation as well as empirically across three popular choice models: the multinomial logit model, the Markov chain model, and the preference ranking model. We show how an optimal randomization strategy can be determined exactly and heuristically. Besides the superior in-sample performance of randomized assortments, we demonstrate improved out-of-sample performance in a data-driven setting that combines estimation with optimization. Our results suggest that more general versions of the assortment optimization problem—incorporating business constraints, more flexible choice models and/or more general uncertainty sets—tend to be more receptive to the benefits of randomization. Funding: Z. Wang acknowledges funding from the Imperial College President’s PhD Scholarship programme. W. Wiesemann acknowledges funding from the Engineering and Physical Sciences Research Council [Grants EP/R045518/1, EP/T024712/1, and EP/W003317/1]. Supplemental Material: The online appendix is available at https://doi.org/10.1287/opre.2022.0129 .
Suggested Citation
Zhengchao Wang & Heikki Peura & Wolfram Wiesemann, 2024.
"Randomized Assortment Optimization,"
Operations Research, INFORMS, vol. 72(5), pages 2042-2060, September.
Handle:
RePEc:inm:oropre:v:72:y:2024:i:5:p:2042-2060
DOI: 10.1287/opre.2022.0129
Download full text from publisher
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:72:y:2024:i:5:p:2042-2060. 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.