Multi-Period Donation Allocation for Food Banks under Stochastic Capacity and Supply
Irem Sengul Orgut, Julie S. Ivy, Reha Uzsoy, James Wilson
Abstract
Each food bank within the national Feeding America network faces the challenge of distributing donated food equitably across the food-insecure population it serves while minimizing food storage and waste over a multi-period planning horizon. Donated food supply is highly stochastic, and distribution to beneficiaries is done by autonomous local agencies whose capacities are uncertain and vary over time. Based on our long-standing partnership with a regional food bank in the southeastern United States, we address the equitable and effective distribution of food donations to charitable agencies over a finite planning horizon under uncertain capacity and supply. We derive structural properties of this problem and use them to develop efficient heuristics. An extensive numerical study evaluates the performance of the heuristics relative to a stochastic dynamic programming benchmark, which suffers from the curse of dimensionality. One heuristic consistently provides near-optimal solutions and can be easily implemented by food banks. Our results also apply to other problems involving the equitable and effective distribution of scarce resources under stochastic capacity and supply.
Create a lesson
Related papers
Beyond Expected Profit: How Risk Aversion Alters Learning in the Data-Driven Newsvendor
Omar Besbes, Alon Rieger
Optimal Subsidy Design for Productive Investment across Markets
Alexandros Pavlis
Descending Everest, Part II: Oracle Complexity of Minimizing a Sum of Convex (L0,L1)-Smooth Functions
Mikhail Rudomanov, Ivan Fomin, Alexander V. Gasnikov et al.
Infinite-Horizon Stochastic Recursive Differential Games with Jumps: Nonautonomous Coefficients and Nonzero Terminal Values
Sheng Luo, Qingmeng Wei, Yaxin Wen
Exact penalty methods with adaptive discretization for nonsmooth semi-infinite optimization
Giancarlo Bigi, Riccardo Tomassini
A Triangular Log-Det PDHG for Semidefinite Programming: Complementarity Selection and Global Linear Convergence
Lijun Ding, Jinwen Yang