Dynamic Assortment Optimization for Reusable Products with Random Usage Durations
| Autor: | Huseyin Topaloglu, Mika Sumida, Paat Rusmevichientong |
|---|---|
| Rok vydání: | 2020 |
| Předmět: |
050208 finance
021103 operations research Computer science Strategy and Management Product (mathematics) 0502 economics and business 05 social sciences 0211 other engineering and technologies 02 engineering and technology Management Science and Operations Research Duration (project management) Industrial engineering |
| Zdroj: | Management Science. 66:2820-2844 |
| ISSN: | 1526-5501 0025-1909 |
| DOI: | 10.1287/mnsc.2019.3346 |
| Popis: | We consider dynamic assortment problems with reusable products, in which each arriving customer chooses a product within an offered assortment, uses the product for a random duration of time, and returns the product back to the firm to be used by other customers. The goal is to find a policy for deciding on the assortment to offer to each customer so that the total expected revenue over a finite selling horizon is maximized. The dynamic-programming formulation of this problem requires a high-dimensional state variable that keeps track of the on-hand product inventories, as well as the products that are currently in use. We present a tractable approach to compute a policy that is guaranteed to obtain at least 50% of the optimal total expected revenue. This policy is based on constructing linear approximations to the optimal value functions. When the usage duration is infinite or follows a negative binomial distribution, we also show how to efficiently perform rollout on a simple static policy. Performing rollout corresponds to using separable and nonlinear value function approximations. The resulting policy is also guaranteed to obtain at least 50% of the optimal total expected revenue. The special case of our model with infinite usage durations captures the case where the customers purchase the products outright without returning them at all. Under infinite usage durations, we give a variant of our rollout approach whose total expected revenue differs from the optimal by a factor that approaches 1 with rate cubic-root of Cmin, where Cmin is the smallest inventory of a product. We provide computational experiments based on simulated data for dynamic assortment management, as well as real parking transaction data for the city of Seattle. Our computational experiments demonstrate that the practical performance of our policies is substantially better than their performance guarantees and that performing rollout yields noticeable improvements. This paper was accepted by Yinyu Ye, optimization. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|