Resource Allocation under Stochastic Demands using Shrinking Horizon Optimization
By: Alexandros E. Tzikas , Nazim Kemal Ure , Mansur Arief and more
Potential Business Impact:
Smarter planning gets more money from limited stuff.
We consider the problem of optimally allocating a limited number of resources across time to maximize revenue under stochastic demands. This formulation is relevant in various areas of control, such as supply chain, ticket revenue maximization, healthcare operations, and energy allocation in power grids. We propose a bisection method to solve the static optimization problem and extend our approach to a shrinking horizon algorithm for the sequential problem. The shrinking horizon algorithm computes future allocations after updating the distribution of future demands by conditioning on the observed values of demand. We illustrate the method on a simple synthetic example with jointly log-normal demands, showing that it achieves performance close to a bound obtained by solving the prescient problem.
Similar Papers
A Black-Box Approach for Exogenous Replenishment in Online Resource Allocation
Data Structures and Algorithms
Makes online selling work better with new stock.
Robust Dynamic Staffing with Predictions
Data Structures and Algorithms
Helps companies hire workers at the right time.
Resource-Splitting Games with Tullock-Based Lossy Contests
CS and Game Theory
Helps businesses share resources to make more money.