The multi-period single-sourcing problem (MPSSP) is the problem of finding an assignment, over time, of customers to warehouses such that each customer is assigned to exactly one warehouse in each period, subject to capacity constraints, such that the total transportation and inventory costs are minimized. We propose a general stochastic model for the MPSSP, and derive a tight condition on this stochastic model under which the MPSSP is feasible with probability 1 when the number of customers goes to infinity. This result can be used to generate suitable experimental data. Moreover, we show that the normalized optimal value of the problem converges almost surely to a constant, for which we provide an explicit expression; this property can be useful in constructing asymptotically optimal heuristics for the problem. The rate of convergence to the limiting value is illustrated empirically.
- Probabilistic analysis
- Generalized Assignment Problem
- Dynamic assignments
Romeijn, H. E., & Romero Morales, D. (2001). A Probabilistic Analysis of the Multi-period Single-sourcing Problem. Discrete Applied Mathematics, 112(1-3), 301–328. https://doi.org/10.1016/S0166-218X(00)00320-6