Constrained Assortment Optimization Under the Paired Combinatorial Logit Model
| Autor: | Rohan Ghuge, Joseph Kwon, Viswanath Nagarajan, Adetee Sharma |
|---|---|
| Rok vydání: | 2022 |
| Předmět: | |
| Zdroj: | Operations Research. 70:786-804 |
| ISSN: | 1526-5463 0030-364X |
| Popis: | Assortment optimization involves selecting a subset of products to offer to customers in order to maximize revenue. Often, the selected subset must also satisfy some constraints, such as capacity or space usage. Two key aspects in assortment optimization are (1) modeling customer behavior and (2) computing optimal or near-optimal assortments efficiently. The paired combinatorial logit (PCL) model is a generic customer choice model that allows for arbitrary correlations in the utilities of different products. The PCL model has greater modeling power than other choice models, such as multinomial-logit and nested-logit. In “Constrained Assortment Optimization Under the Paired Combinatorial Logit Model,” Ghuge, Kwon, Nagarajan, and and Sharma provide efficient algorithms that find provably near-optimal solutions for PCL assortment optimization under several types of constraints. These include the basic unconstrained problem (which is already intractable to solve exactly), multidimensional space constraints, and partition constraints. The authors also demonstrate via extensive experiments that their algorithms typically achieve over 95% of the optimal revenues. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|