4.6 Article

An efficient learning framework for multiproduct inventory systems with customer choices

Related references

Note: Only part of the references are listed.
Article Management

Understanding the Value of Fulfillment Flexibility in an Online Retailing Environment

Levi DeValve et al.

Summary: This study investigates the practical value of partial fulfillment flexibility using a data-driven model, theoretical analysis, and numerical simulations. The results show that increasing flexibility in fulfillment networks can lead to significant profit improvement for e-retailers. The study also provides guidance on when fulfillment flexibility is most valuable and identifies the risks of myopic fulfillment.

M&SOM-MANUFACTURING & SERVICE OPERATIONS MANAGEMENT (2023)

Article Management

Shrinking the Upper Confidence Bound: A Dynamic Product Selection Problem for Urban Warehouses

Rong Jin et al.

Summary: This paper investigates algorithms for dynamically selecting high-potential products on retailers' ultrafast delivery platforms by using a linear generalization semibandit model to address the product selection problem. A novel online learning algorithm is proposed to reduce fixed costs, and experimental results on an industrial dataset from Alibaba Group show that it outperforms the standard UCB algorithm by reducing total regret by at least 10%.

MANAGEMENT SCIENCE (2021)

Article Management

Marrying Stochastic Gradient Descent with Bandits: Learning Algorithms for Inventory Systems with Fixed Costs

Hao Yuan et al.

Summary: This paper studies a single-product inventory system with fixed costs and censored demand. The authors propose a new learning algorithm, the (d, S) policy, which combines various methods in a seamless and nontrivial fashion. The paper not only proves the cumulative regret of the algorithm, but also develops several technically interesting results.

MANAGEMENT SCIENCE (2021)

Article Operations Research & Management Science

Nonparametric Learning Algorithms for Joint Pricing and Inventory Control with Lost Sales and Censored Demand

Boxiao Chen et al.

Summary: We consider a joint pricing and inventory control problem and develop a learning algorithm based on nonparametric spline approximation. The algorithm separates the planning horizon into an exploration phase and an exploitation phase. It achieves a (nearly) square-root regret rate, which (almost) matches the theoretical lower bound.

MATHEMATICS OF OPERATIONS RESEARCH (2021)

Article Engineering, Manufacturing

Optimal Learning Algorithms for Stochastic Inventory Systems with Random Capacities

Weidong Chen et al.

PRODUCTION AND OPERATIONS MANAGEMENT (2020)

Article Management

Dynamic Inventory Control with Stockout Substitution and Demand Learning

Boxiao Chen et al.

MANAGEMENT SCIENCE (2020)

Article Management

The Data-Driven Newsvendor Problem: New Bounds and Insights

Retsef Levi et al.

OPERATIONS RESEARCH (2015)

Article Mathematics, Applied

A faster algorithm for the resource allocation problem with convex cost functions

Cong Shi et al.

JOURNAL OF DISCRETE ALGORITHMS (2015)

Article Operations Research & Management Science

Learning to Optimize via Posterior Sampling

Daniel Russo et al.

MATHEMATICS OF OPERATIONS RESEARCH (2014)

Article Management

Fixed vs. Random Proportions Demand Models for the Assortment Planning Problem Under Stockout-Based Substitution

Dorothee Honhon et al.

M&SOM-MANUFACTURING & SERVICE OPERATIONS MANAGEMENT (2013)

Article Management

On Implications of Demand Censoring in the Newsvendor Problem

Omar Besbes et al.

MANAGEMENT SCIENCE (2013)

Article Management

Optimal Algorithms for Assortment Selection Under Ranking-Based Consumer Choice Models

Dorothee Honhon et al.

M&SOM-MANUFACTURING & SERVICE OPERATIONS MANAGEMENT (2012)

Article Management

Blind Network Revenue Management

Omar Besbes et al.

OPERATIONS RESEARCH (2012)

Article Management

Assortment Planning and Inventory Decisions Under Stockout-Based Substitution

Dorothee Honhon et al.

OPERATIONS RESEARCH (2010)

Article Operations Research & Management Science

A Nonparametric Asymptotic Analysis of Inventory Planning with Censored Demand

Woonghee Tim Huh et al.

MATHEMATICS OF OPERATIONS RESEARCH (2009)

Article Operations Research & Management Science

An Adaptive Algorithm for Finding the Optimal Base-Stock Policy in Lost Sales Inventory Systems with Censored Demand

Woonghee Tim Huh et al.

MATHEMATICS OF OPERATIONS RESEARCH (2009)

Article Operations Research & Management Science

Provably near-optimal sampling-based policies for stochastic inventory control models

Retsef Levi et al.

MATHEMATICS OF OPERATIONS RESEARCH (2007)

Article Management

Centralized and competitive inventory models with demand substitution

S Netessine et al.

OPERATIONS RESEARCH (2003)

Article Computer Science, Artificial Intelligence

Finite-time analysis of the multiarmed bandit problem

P Auer et al.

MACHINE LEARNING (2002)

Article Management

Stocking retail assortments under dynamic consumer substitution

S Mahajan et al.

OPERATIONS RESEARCH (2001)

Article Mathematics, Applied

The sample average approximation method for stochastic discrete optimization

AJ Kleywegt et al.

SIAM JOURNAL ON OPTIMIZATION (2001)

Article Management

Adaptive ordering and pricing for perishable products

AN Burnetas et al.

OPERATIONS RESEARCH (2000)

Article Management

Management of multi-item retail inventory systems with demand substitution

SA Smith et al.

OPERATIONS RESEARCH (2000)