Dynamic Inventory Repositioning in On-Demand Rental Networks

Abstract

We consider a rental service with a fixed number of rental units distributed across multiple locations. The units are accessed by customers without prior reservation and on an on-demand basis. Customers can decide on how long to keep a unit and where to return it. Because of the randomness in demand and in returns, there is a need to periodically reposition inventory away from some locations and into others. In deciding on how much inventory to reposition and where, the system manager balances potential lost sales with repositioning costs. Although the problem is increasingly common in applications involving on-demand rental services, not much is known about the nature of the optimal policy for systems with a general network structure or about effective approaches to solving the problem. In this paper, first, we show that the optimal policy in each period can be described in terms of a well-specified region over the state space. Within this region, it is optimal not to reposition any inventory, whereas, outside the region, it is optimal to reposition but only such that the system moves to a new state that is on the boundary of the no-repositioning region. We also provide a simple check for when a state is in the no-repositioning region. Second, we leverage the features of the optimal policy, along with properties of the optimal cost function, to propose a provably convergent approximate dynamic programming algorithm to tackle problems with a large number of dimensions. This paper was accepted by David Simchi-Levi, optimization. Funding: The research of S. Benjaafar is in part funded by the US National Science Foundation (NS) [Grant SCC-1831140]. The research of X. Li is in part funded by the SingaporeMinistry of Education [Grant R-266-000-128-133]. This work used the Extreme Science and Engineering Discovery Environment [NSF Grant ACI-1548562], the Bridges-2 system [NSF Grant ACI-1445606], and resources from the University of Pittsburgh Center for Research Computing. Supplemental Material: Data and the electronic companion are available at https://doi.org/10.1287/mnsc.2021.4286 .

Cite this work

No public copy is stored for this record, so only the metadata is cited.

Stored only when both papers are in the corpus — 38 citations exist upstream.

Papers that cite the same references — the relational fallback while embeddings are still backfilling.