The Finite Horizon Nonstationary Stochastic Inventory Problem: Near-Myopic Bounds, Heuristics, Testing
针对季节性需求等非平稳环境下的库存问题，推导了最优策略的上下界，并测试了四种启发式方法，其中最优启发式平均成本仅比最优解高0.02%，计算成本仅为动态规划的0.5%。
Nonstationary stochastic periodic review inventory problems with proportional costs occur in a number of industrial settings with seasonal patterns, trends, business cycles, and limited life items. Myopic policies for such problems order as if the salvage value in the current period for ending inventory were the full purchase price, so that information about the future would not be needed. They have been shown in the literature to be optimal when demand “is increasing over time,” and to provide upper bounds for the stationary finite horizon problem (and in some other situations). Some results are also known, given special salvaging assumptions, about lower bounds on the optimal policy which are near-myopic. Here analogous but stronger bounds are derived for the general finite horizon problem, without such special assumptions. The best upper bound is an extension of the heuristic used by industry for some years for end of season (EOS) problems; the lower bound is an extension of earlier analytic methods. Four heuristics were tested against the optimal obtained by stochastic dynamic programming for 969 problems. The simplest heuristic is the myopic heuristic itself: it is good especially for moderately varying problems without heavy end of season salvage costs and averages only 2.75% in cost over the optimal. However, the best of the heuristics exceeds the optimal in cost by an average of only 0.02%, at about 0.5% of the computational cost of dynamic programming.